MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable.
Karin QuaasPublished in: SynCoP (2014)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- finite state
- automated verification
- formal specification
- finite state machines
- partial order reduction
- temporal properties
- formal verification
- sufficient conditions
- computation tree logic
- model checker
- symbolic model checking
- np complete
- pspace complete
- process algebra
- bounded model checking
- formal methods
- epistemic logic
- verification method
- theorem proving
- theorem prover
- alternating time temporal logic
- specification language
- linear temporal logic
- machine learning
- planning domains
- first order logic
- knowledge based systems
- software engineering
- state space