Name
Abstract | ||
|---|---|---|
A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network. This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number $m$ of tokens, such that starting with $m$ tokens in a given place, and none in the other places, some given transition is eventually enabled. We show that these problems are PSPACE-complete. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4230/LIPIcs.CONCUR.2018.6 | CONCUR |
DocType | Volume | Citations |
Conference | abs/1806.08170 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Parosh Aziz Abdulla | 1 | 2010 | 122.22 |
| Mohamed Faouzi Atig | 2 | 505 | 40.94 |
| Radu Ciobanu | 3 | 2 | 0.72 |
| Richard Mayr | 4 | 389 | 22.29 |
| Patrick Totzke | 5 | 38 | 8.52 |