The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions.
Martin MundhenkFelix WeißPublished in: RP (2010)
Keyphrases
- model checking
- modal logic
- temporal logic
- pspace complete
- epistemic logic
- classical logic
- cl pc
- transition systems
- coalition logic
- finite state
- formal specification
- automated verification
- temporal properties
- nonmonotonic logics
- bounded model checking
- inference rules
- formal verification
- model checker
- timed automata
- reachability analysis
- satisfiability problem
- computation tree logic
- verification method
- symbolic model checking
- formal methods
- decision problems
- concurrent systems
- process algebra
- modal operators
- asynchronous circuits
- default logic
- theorem prover
- situation calculus
- dynamic logic
- sequent calculus
- deterministic finite automaton
- description logics
- computational complexity