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