Universal Safety for Timed Petri Nets is PSPACE-complete

Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Ciobanu, Radu, Mayr, Richard and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2018) Universal Safety for Timed Petri Nets is PSPACE-complete. In: CONCUR 2018, 2018-9-4 - ?, Beijing, China.

Access the full-text of this item by clicking on the Open Access link.


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.

Item Type: Conference or Workshop Item (Unspecified)
Additional Information: timestamp: Fri, 31 Aug 2018 14:54:00 +0200 biburl: https://dblp.org/rec/bib/conf/concur/2018 bibsource: dblp computer science bibliography, https://dblp.org
Uncontrolled Keywords: cs.LO, cs.LO, F.1.1
Depositing User: Symplectic Admin
Date Deposited: 21 Jan 2019 15:27
Last Modified: 19 Jan 2023 01:07
DOI: 10.4230/LIPIcs.CONCUR.2018.6
Open Access URL: http://drops.dagstuhl.de/opus/frontdoor.php?source...
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3031038