文章基本信息

标题：Universal Safety for Timed Petri Nets is PSPACE-complete
本地全文：下载
作者：Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Radu Ciobanu 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：118
页码：1-15
DOI：10.4230/LIPIcs.CONCUR.2018.6
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：timed networks; safety checking; Petri nets; coverability