Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
Christel BaierNathalie BertrandPatricia BouyerThomas BrihayeMarcus GrößerPublished in: LICS (2008)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- deterministic finite automaton
- automated verification
- formal specification
- formal verification
- model checker
- finite state machines
- finite state
- symbolic model checking
- partial order reduction
- temporal properties
- formal methods
- computation tree logic
- verification method
- concurrent systems
- transition systems
- theorem prover
- reactive systems
- pspace complete
- epistemic logic
- bounded model checking
- process algebra
- modal logic
- game theory
- alternating time temporal logic
- first order logic