Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus.
Mikolaj BojanczykChristoph DittmannStephan KreutzerPublished in: CoRR (2014)
Keyphrases
- model checking
- transition systems
- temporal logic
- process algebra
- modal logic
- timed automata
- sequent calculus
- model checker
- concurrent systems
- formal specification
- formal verification
- automated verification
- finite state
- partial order reduction
- temporal properties
- computation tree logic
- symbolic model checking
- pspace complete
- verification method
- epistemic logic
- finite state machines
- linear time temporal logic
- nonmonotonic logics
- formal methods
- cut elimination
- bounded model checking
- reachability analysis
- inference rules
- satisfiability problem
- reactive systems
- practical reasoning
- natural deduction
- alternating time temporal logic
- asynchronous circuits