Complexity of Model Checking for Modal Dependence Logic.
Johannes EbbingPeter LohmannPublished in: SOFSEM (2012)
Keyphrases
- model checking
- transition systems
- modal logic
- temporal logic
- pspace complete
- cl pc
- epistemic logic
- model checker
- bounded model checking
- verification method
- alternating time temporal logic
- linear temporal logic
- coalition logic
- symbolic model checking
- asynchronous circuits
- formal verification
- automated verification
- formal methods
- finite state
- formal specification
- finite state machines
- temporal properties
- concurrent systems
- ctl model update
- computation tree logic
- reactive systems
- satisfiability problem
- computational complexity
- process algebra
- reachability analysis
- inference rules
- timed automata
- control flow
- linear time temporal logic
- default logic
- situation calculus
- belief revision
- description language
- planning domains
- theorem proving