Model checking rationally restricted right closures of recognizable graphs.
Olaf BurkartPublished in: INFINITY (1997)
Keyphrases
- model checking
- temporal logic
- automated verification
- formal verification
- symbolic model checking
- temporal properties
- model checker
- finite state
- finite state machines
- formal specification
- partial order reduction
- formal methods
- verification method
- process algebra
- timed automata
- transition systems
- reachability analysis
- pspace complete
- graph theory
- epistemic logic
- bounded model checking
- computation tree logic
- ordered binary decision diagrams
- alternating time temporal logic
- reactive systems
- concurrent systems
- abstract interpretation