Decidable Model Checking of Probabilistic Hybrid Automata.
Jeremy SprostonPublished in: FTRTFT (2000)
Keyphrases
- model checking
- computation tree logic
- hybrid automata
- temporal logic
- finite state automata
- finite state machines
- linear time temporal logic
- finite state
- temporal properties
- automated verification
- formal verification
- formal specification
- model checker
- symbolic model checking
- bounded model checking
- epistemic logic
- reachability analysis
- formal methods
- timed automata
- concurrent systems
- first order logic
- bayesian networks
- verification method
- transition systems
- pspace complete
- probabilistic reasoning
- deterministic finite automaton
- linear temporal logic
- reactive systems
- asynchronous circuits
- satisfiability problem