Hypervolume Approximation in Timed Automata Model Checking.
Víctor A. BrabermanJorge Lucángeli ObesAlfredo OliveroFernando SchapachnikPublished in: FORMATS (2007)
Keyphrases
- timed automata
- model checking
- reachability analysis
- temporal logic
- formal verification
- finite state
- partial order reduction
- model checker
- formal specification
- automated verification
- formal methods
- finite state machines
- epistemic logic
- process algebra
- temporal properties
- symbolic model checking
- transition systems
- theorem prover
- verification method
- asynchronous circuits
- bounded model checking
- pspace complete
- theorem proving
- linear temporal logic
- computation tree logic
- alternating time temporal logic
- machine learning