On Refinement of Büchi Automata for Explicit Model Checking.
Frantisek BlahoudekAlexandre Duret-LutzVojtech RujbrJan StrejcekPublished in: SPIN (2015)
Keyphrases
- model checking
- finite state
- timed automata
- finite state machines
- temporal logic
- model checker
- formal verification
- automated verification
- reachability analysis
- formal specification
- temporal properties
- symbolic model checking
- partial order reduction
- pspace complete
- epistemic logic
- concurrent systems
- formal methods
- verification method
- process algebra
- transition systems
- bounded model checking
- computation tree logic
- tree automata
- reactive systems
- theorem prover
- satisfiability problem
- optimal policy