Almost-Sure Model-Checking of Reactive Timed Automata.
Patricia BouyerThomas BrihayeMarcin JurdzinskiQuentin MenetPublished in: QEST (2012)
Keyphrases
- timed automata
- model checking
- reactive systems
- temporal logic
- reachability analysis
- temporal properties
- finite state
- formal specification
- formal verification
- model checker
- formal methods
- automated verification
- process algebra
- verification method
- symbolic model checking
- partial order reduction
- pspace complete
- epistemic logic
- finite state machines
- transition systems
- asynchronous circuits
- concurrent systems
- modal logic
- real time
- np complete
- deterministic finite automaton
- natural language