Verifying Networks of Timed Processes
Abstract:
Over the last years there has been an increasing research effort directed towards the automatic verification of infinite state systems, such as timed automata, hybrid automata, data-independent systems, relational automata, Petri nets, and lossy channel systems. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of identical timed automata, each with a single real-valued clock. Using a standard reduction from safety properties to reachability properties, we can use our algorithm to decide general safety properties of timed networks. To our knowledge, this is the first decidability result concerning verification of systems that are infinite-state in "two dimentions": they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz. real-valued clocks. We illustrate our method by showing how it can be used to automatically verify Fischer's protocol, a timer-based protocol for enforcing mutual exclusion among an arbitrary number of processes. 1
Citations
| 325 | Model-checking for real-time systems – Alur, Courcoubetis, et al. - 1990 |
| 292 | Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems – Alur, Courcoubetis, et al. |
| 189 | A really temporal logic – Alur, Henzinger |
| 127 | B.: Verifying programs with unreliable channels – Abdulla, Jonsson - 1993 |
| 43 | Undecidable verification problems for programs with unreliable channels – Abdulla, Jonsson - 1996 |
