On the Existence of Cutoffs for Model Checking Disjunctive Timed Networks.
Luca SpalazziFrancesco SpegniPublished in: ICTCS/CILC (2017)
Keyphrases
- model checking
- timed automata
- partial order reduction
- temporal logic
- finite state machines
- reachability analysis
- verification method
- formal specification
- symbolic model checking
- temporal properties
- automated verification
- computation tree logic
- formal verification
- finite state
- model checker
- process algebra
- transition systems
- bounded model checking
- petri net
- pspace complete
- social networks
- concurrent systems
- epistemic logic
- formal methods
- theorem proving
- theorem prover
- modal logic