Model Checking Timed Automata with One or Two Clocks.
François LaroussinieNicolas MarkeyPhilippe SchnoebelenPublished in: CONCUR (2004)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- formal specification
- model checker
- partial order reduction
- automated verification
- temporal properties
- formal verification
- finite state
- epistemic logic
- finite state machines
- verification method
- symbolic model checking
- computation tree logic
- formal methods
- pspace complete
- planning domains
- process algebra
- concurrent systems
- transition systems
- bounded model checking
- knowledge based systems