Parameterized model checking of networks of timed automata with Boolean guards.
Luca SpalazziFrancesco SpegniPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- timed automata
- model checking
- temporal logic
- reachability analysis
- formal specification
- finite state
- formal verification
- model checker
- automated verification
- theorem prover
- symbolic model checking
- real valued
- temporal properties
- pspace complete
- partial order reduction
- verification method
- bounded model checking
- finite state machines
- epistemic logic
- computation tree logic
- transition systems
- linear temporal logic
- machine learning
- theorem proving
- asynchronous circuits
- boolean functions
- formal methods
- first order logic
- process algebra
- alternating time temporal logic
- artificial intelligence
- np complete
- concurrent systems
- decision problems
- planning domains