On model checking for the µ-calculus and its fragments.
E. Allen EmersonCharanjit S. JutlaA. Prasad SistlaPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- model checking
- process algebra
- timed automata
- transition systems
- temporal logic
- formal specification
- reachability analysis
- formal verification
- partial order reduction
- model checker
- temporal properties
- automated verification
- finite state machines
- symbolic model checking
- finite state
- formal methods
- verification method
- concurrent systems
- epistemic logic
- pspace complete
- asynchronous circuits
- bounded model checking
- computation tree logic
- linear time temporal logic
- satisfiability problem
- linear temporal logic
- ordered binary decision diagrams
- artificial intelligence