Are Good-for-Games Automata Good for Probabilistic Model Checking?
Joachim KleinDavid MüllerChristel BaierSascha KlüppelholzPublished in: LATA (2014)
Keyphrases
- model checking
- timed automata
- finite state
- finite state machines
- temporal logic
- model checker
- formal verification
- symbolic model checking
- partial order reduction
- temporal properties
- automated verification
- transition systems
- formal specification
- reachability analysis
- verification method
- bayesian networks
- video games
- concurrent systems
- computer games
- process algebra
- bounded model checking
- asynchronous circuits
- game theory
- probabilistic reasoning
- computation tree logic
- finite automata
- nash equilibrium
- epistemic logic
- pspace complete
- search algorithm
- planning domains
- game playing