Partial Order Reduction for Model Checking of Timed Automata.
Marius MineaPublished in: CONCUR (1999)
Keyphrases
- partial order reduction
- model checking
- timed automata
- temporal logic
- reachability analysis
- temporal properties
- formal specification
- formal verification
- finite state
- finite state machines
- symbolic model checking
- automated verification
- model checker
- pspace complete
- formal methods
- verification method
- process algebra
- epistemic logic
- bounded model checking
- computation tree logic
- real time
- reactive systems
- concurrent systems
- np complete
- transition systems
- distributed systems
- software engineering
- reinforcement learning