Simple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract).
Agnieszka ZbrzeznyAndrzej ZbrzeznyPublished in: CS&P (2016)
Keyphrases
- model checking
- extended abstract
- timed automata
- reachability analysis
- temporal logic
- finite state machines
- finite state
- symbolic model checking
- formal verification
- partial order reduction
- temporal properties
- automated verification
- theorem prover
- formal specification
- model checker
- computation tree logic
- verification method
- epistemic logic
- pspace complete
- formal methods
- first order logic
- asynchronous circuits
- concurrent systems
- process algebra
- dynamic programming
- linear temporal logic
- bounded model checking
- binary decision diagrams
- knowledge representation