Universal Safety for Timed Petri Nets is PSPACE-complete

Medientyp: Elektronischer Konferenzbericht; Sonstige Veröffentlichung; E-Artikel

Titel: Universal Safety for Timed Petri Nets is PSPACE-complete

Beteiligte: Abdulla, Parosh Aziz [VerfasserIn]; Atig, Mohamed Faouzi [VerfasserIn]; Ciobanu, Radu [VerfasserIn]; Mayr, Richard [VerfasserIn]; Totzke, Patrick [VerfasserIn]

Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018

Sprache: Englisch

DOI: https://doi.org/10.4230/LIPIcs.CONCUR.2018.6

Schlagwörter: safety checking ; Petri nets ; timed networks ; coverability

Entstehung:

Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.

Beschreibung: 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.

Zugangsstatus: Freier Zugang

Nur in Feld suchen:

Zuletzt gesuchte Begriffe: