Model Checking CTL is Almost Always Inherently Sequential.
Olaf BeyersdorffArne MeierMichael ThomasHeribert VollmerMartin MundhenkThomas SchneiderPublished in: TIME (2009)
Keyphrases
- model checking
- temporal logic
- computation tree logic
- temporal properties
- formal verification
- model checker
- finite state
- formal specification
- automated verification
- symbolic model checking
- reachability analysis
- bounded model checking
- epistemic logic
- pspace complete
- partial order reduction
- transition systems
- timed automata
- process algebra
- verification method
- finite state machines
- linear temporal logic
- concurrent systems
- asynchronous circuits
- formal methods
- reactive systems
- satisfiability problem
- modal logic
- software engineering