Reducing CMSO Model Checking to Highly Connected Graphs.
Daniel LokshtanovM. S. RamanujanSaket SaurabhMeirav ZehaviPublished in: ICALP (2018)
Keyphrases
- highly connected
- model checking
- temporal logic
- reachability analysis
- formal verification
- automated verification
- formal specification
- partial order reduction
- temporal properties
- model checker
- transition systems
- finite state
- epistemic logic
- computation tree logic
- timed automata
- bounded model checking
- symbolic model checking
- pspace complete
- linear temporal logic
- formal methods
- finite state machines
- process algebra
- verification method
- asynchronous circuits
- artificial intelligence
- concurrent systems
- satisfiability problem