The Complexity of Model Checking for Circumscriptive Formulae.
Marco CadoliPublished in: Inf. Process. Lett. (1992)
Keyphrases
- model checking
- pspace complete
- temporal logic
- formal verification
- temporal properties
- finite state
- model checker
- formal specification
- automated verification
- symbolic model checking
- finite state machines
- reachability analysis
- process algebra
- epistemic logic
- transition systems
- computation tree logic
- partial order reduction
- verification method
- formal methods
- np complete
- bounded model checking
- satisfiability problem
- reactive systems
- asynchronous circuits
- timed automata
- modal logic
- decision problems
- abstract interpretation
- alternating time temporal logic