Verifying Progress in Timed Systems

In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a model of TA to be deadlock- and timelock-free. We also present dynamic techniques for deadlock and timelock detection. The techniques are based on forward symbolic reachability and are onthe-fly, that is, they can return an answer as soon as possible, without necessarily having to construct and store the whole state space.

• Type: Conference
• Year: 1999
• Where: ARTS
• Authors: Stavros Tripakis
• Keywords: ARTS 1999, Distributed And Parallel Computing, Forward Symbolic Reachability, Static Sufficient Conditions, Timed Automata