The Complexity of Model Checking in Modal Event Calculi with Quantifiers.
Iliano CervesatoMassimo FranceschetAngelo MontanariPublished in: Electron. Trans. Artif. Intell. (1998)
Keyphrases
- model checking
- pspace complete
- temporal logic
- transition systems
- modal logic
- model checker
- formal verification
- formal specification
- symbolic model checking
- automated verification
- verification method
- finite state
- temporal properties
- timed automata
- finite state machines
- computation tree logic
- partial order reduction
- process algebra
- reachability analysis
- epistemic logic
- bounded model checking
- asynchronous circuits
- formal methods
- linear temporal logic
- computational complexity
- inference rules
- satisfiability problem
- cl pc
- np complete