Larger Automata and Less Work for LTL Model Checking.
Jaco GeldenhuysHenri HansenPublished in: SPIN (2006)
Keyphrases
- model checking
- finite state machines
- finite state
- timed automata
- temporal logic
- bounded model checking
- formal specification
- temporal properties
- model checker
- symbolic model checking
- formal verification
- partial order reduction
- transition systems
- linear temporal logic
- automated verification
- reachability analysis
- verification method
- pspace complete
- process algebra
- computation tree logic
- finite automata
- asynchronous circuits
- tree automata
- formal methods
- linear time temporal logic
- concurrent systems
- epistemic logic
- software engineering
- reactive systems
- deterministic automata
- heuristic search