How Hard Is Finding Shortest Counter-Example Lassos in Model Checking?
Rüdiger EhlersPublished in: FM (2019)
Keyphrases
- model checking
- temporal logic
- formal verification
- model checker
- symbolic model checking
- formal specification
- automated verification
- finite state machines
- finite state
- temporal properties
- verification method
- pspace complete
- computation tree logic
- partial order reduction
- timed automata
- reachability analysis
- process algebra
- bounded model checking
- epistemic logic
- transition systems
- formal methods
- concurrent systems
- deterministic finite automaton
- asynchronous circuits
- ctl model update