Model Checking CTL is Almost Always Inherently Sequential
Olaf BeyersdorffArne MeierMartin MundhenkThomas SchneiderMichael ThomasHeribert VollmerPublished in: Log. Methods Comput. Sci. (2011)
Keyphrases
- model checking
- temporal logic
- computation tree logic
- temporal properties
- formal verification
- model checker
- automated verification
- symbolic model checking
- formal specification
- partial order reduction
- reachability analysis
- finite state
- finite state machines
- bounded model checking
- timed automata
- verification method
- alternating time temporal logic
- process algebra
- transition systems
- pspace complete
- concurrent systems
- reactive systems
- asynchronous circuits
- knowledge base
- domain independent
- planning domains
- temporal epistemic