Parametric Model Checking Timed Automata Under Non-Zenoness Assumption.
Étienne AndréHoang Gia NguyenLaure PetrucciJun SunPublished in: NFM (2017)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- temporal properties
- automated verification
- model checker
- formal specification
- finite state machines
- finite state
- theorem prover
- formal verification
- partial order reduction
- computation tree logic
- symbolic model checking
- pspace complete
- artificial intelligence
- bounded model checking
- asynchronous circuits
- verification method
- concurrent systems
- epistemic logic
- process algebra
- specification language
- machine learning
- transition systems
- theorem proving
- formal methods
- dynamic programming
- reactive systems
- planning domains
- knowledge base
- automated reasoning
- real time