Model Checking Probabilistic Timed Automata with One or Two Clocks
Marcin JurdzinskiFrançois LaroussinieJeremy SprostonPublished in: CoRR (2008)
Keyphrases
- timed automata
- model checking
- reachability analysis
- temporal logic
- partial order reduction
- model checker
- symbolic model checking
- formal verification
- formal specification
- temporal properties
- finite state
- automated verification
- finite state machines
- pspace complete
- process algebra
- computation tree logic
- epistemic logic
- formal methods
- probabilistic model
- verification method
- concurrent systems
- transition systems
- bayesian networks
- bounded model checking
- theorem prover
- probabilistic reasoning
- planning domains
- theorem proving