Model Checking Probabilistic Timed Automata with One or Two Clocks.
Marcin JurdzinskiJeremy SprostonFrançois LaroussiniePublished in: Log. Methods Comput. Sci. (2008)
Keyphrases
- timed automata
- model checking
- reachability analysis
- temporal logic
- formal specification
- temporal properties
- formal verification
- partial order reduction
- model checker
- automated verification
- formal methods
- finite state
- finite state machines
- computation tree logic
- process algebra
- theorem prover
- probabilistic model
- transition systems
- probabilistic reasoning
- bayesian networks
- bounded model checking
- verification method
- pspace complete
- epistemic logic
- symbolic model checking
- asynchronous circuits
- conditional probabilities
- first order logic
- reactive systems
- optimal policy
- expert systems
- deterministic finite automaton
- real time