Summary: Multi­Clock Timed Networks
(Extended Abstract)
Parosh Aziz Abdulla
Uppsala University
Johann Deneux
Uppsala University
Pritha Mahata
Uppsala University
Abstract
We consider verification of safety properties for param­
eterized systems of timed processes, so called timed net­
works. 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 unde­
cidable when each timed process has two clocks.
On the other hand, we show that the problem is decidable

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences