Is there a best büchi automaton for explicit model checking?
Frantisek BlahoudekAlexandre Duret-LutzMojmír KretínskýJan StrejcekPublished in: SPIN (2014)
Keyphrases
- model checking
- finite state machines
- deterministic finite automaton
- temporal logic
- linear time temporal logic
- model checker
- formal verification
- automated verification
- formal specification
- finite state
- symbolic model checking
- partial order reduction
- temporal properties
- epistemic logic
- computation tree logic
- timed automata
- formal methods
- pspace complete
- process algebra
- verification method
- reachability analysis
- asynchronous circuits
- transition systems
- bounded model checking
- satisfiability problem
- planning domains
- markov chain
- linear temporal logic
- concurrent systems
- reactive systems