Technical Report 2004-012

Multi-Clock Timed Networks

Parosh Aziz Abdulla, Johann Deneuz, and Pritha Mahata

April 2004

We consider verification of safety properties for parameterized systems of timed processes, so called it timed networks. A timed network consists of a finite state process, called a controller, and an arbitrary set of identical timed processes. In a previous work, we showed that checking safety properties is decidable in the case where each timed process is equipped with a single real-valued clock. It was left open whether the result could be extended to multi-clock timed networks. We show that the problem becomes undecidable when each timed process has two clocks.

On the other hand, we show that the problem is decidable when clocks range over a discrete time domain. This decidability result holds when processes have any finite number of clocks.

Available as Postscript (299 kB, no cover), compressed Postscript (96 kB, no cover), and PDF (213 kB, no cover)

Download BibTeX entry.