Model checking for probabilistic timed automata.
Gethin NormanDavid ParkerJeremy SprostonPublished in: Formal Methods Syst. Des. (2013)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- formal specification
- model checker
- finite state
- formal verification
- temporal properties
- partial order reduction
- symbolic model checking
- probabilistic model
- verification method
- transition systems
- automated verification
- epistemic logic
- formal methods
- pspace complete
- finite state machines
- theorem prover
- bounded model checking
- computation tree logic
- concurrent systems
- process algebra
- bayesian networks
- satisfiability problem
- probability theory
- theorem proving
- linear temporal logic