The Complexity of Model Checking in Modal Event Calculi with Quantifiers.
Iliano CervesatoMassimo FranceschetAngelo MontanariPublished in: KR (1998)
Keyphrases
- model checking
- pspace complete
- temporal logic
- transition systems
- modal logic
- model checker
- formal verification
- temporal properties
- finite state
- symbolic model checking
- partial order reduction
- automated verification
- formal specification
- computation tree logic
- formal methods
- verification method
- reachability analysis
- bounded model checking
- np complete
- decision problems
- finite state machines
- linear temporal logic
- cl pc
- reactive systems
- epistemic logic
- asynchronous circuits
- first order logic
- concurrent systems
- process algebra
- timed automata
- deterministic finite automaton
- knowledge base
- alternating time temporal logic
- computational complexity
- logic programming
- inference rules
- planning domains