On model-checking timed automata with stopwatch observers.
Thomas BrihayeVéronique BruyèreJean-François RaskinPublished in: Inf. Comput. (2006)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- formal verification
- partial order reduction
- finite state
- model checker
- temporal properties
- formal specification
- process algebra
- formal methods
- bounded model checking
- finite state machines
- automated verification
- symbolic model checking
- computation tree logic
- epistemic logic
- verification method
- pspace complete
- theorem prover
- theorem proving
- concurrent systems
- transition systems