License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.6
URN: urn:nbn:de:0030-drops-95447
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9544/
Go to the corresponding LIPIcs Volume Portal


Abdulla, Parosh Aziz ; Atig, Mohamed Faouzi ; Ciobanu, Radu ; Mayr, Richard ; Totzke, Patrick

Universal Safety for Timed Petri Nets is PSPACE-complete

pdf-format:
LIPIcs-CONCUR-2018-6.pdf (0.4 MB)


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. We 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.

BibTeX - Entry

@InProceedings{abdulla_et_al:LIPIcs:2018:9544,
  author =	{Parosh Aziz Abdulla and Mohamed Faouzi Atig and Radu Ciobanu and Richard Mayr and Patrick Totzke},
  title =	{{Universal Safety for Timed Petri Nets is PSPACE-complete}},
  booktitle =	{29th International Conference on Concurrency Theory  (CONCUR 2018)},
  pages =	{6:1--6:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Sven Schewe and Lijun Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9544},
  URN =		{urn:nbn:de:0030-drops-95447},
  doi =		{10.4230/LIPIcs.CONCUR.2018.6},
  annote =	{Keywords: timed networks, safety checking, Petri nets, coverability}
}

Keywords: timed networks, safety checking, Petri nets, coverability
Seminar: 29th International Conference on Concurrency Theory (CONCUR 2018)
Issue Date: 2018
Date of publication: 13.08.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI