|
Published Articles >> Table of Contents >> Abstract
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
pp. 345-354
Multi-Clock Timed Networks
Parosh Aziz Abdulla, Uppsala University
Johann Deneux, Uppsala University
Pritha Mahata, Uppsala University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319629
Send link to a friend
| Abstract |
|
We consider verification of safety properties for parameterized systems of timed processes, so called 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.
|
 Additional Information
|
Citation:
Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata,
"Multi-Clock Timed Networks,"
lics,
pp. 345-354,
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04),
2004
|
|
