TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants.
Étienne AndréDidier LimeMathias RamparisonPublished in: FORMATS (2018)
Keyphrases
- timed automata
- model checking
- upper bound
- lower bound
- reachability analysis
- temporal logic
- model checker
- formal verification
- temporal properties
- formal specification
- worst case
- symbolic model checking
- automated verification
- finite state
- bounded model checking
- transition systems
- partial order reduction
- epistemic logic
- verification method
- process algebra
- formal methods
- computation tree logic
- bayesian networks
- machine learning
- linear temporal logic
- reactive systems
- pspace complete
- theorem prover