eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-09-07
36:1
36:17
10.4230/LIPIcs.CONCUR.2023.36
article
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets
Jančar, Petr
1
https://orcid.org/0000-0002-8738-9850
Leroux, Jérôme
2
https://orcid.org/0000-0002-7214-9467
Dept of Comp. Sci., Faculty of Science, Palacký University Olomouc, Czech Republic
LaBRI, CNRS, Univ. Bordeaux, France
A set of configurations H is a home-space for a set of configurations X of a Petri net if every configuration reachable from (any configuration in) X can reach (some configuration in) H. The semilinear home-space problem for Petri nets asks, given a Petri net and semilinear sets of configurations X, H, if H is a home-space for X. In 1989, David de Frutos Escrig and Colette Johnen proved that the problem is decidable when X is a singleton and H is a finite union of linear sets with the same periods. In this paper, we show that the general (semilinear) problem is decidable. This result is obtained by proving a duality between the reachability problem and the non-home-space problem. In particular, we prove that for any Petri net and any linear set of configurations L we can effectively compute a semilinear set C of configurations, called a non-reachability core for L, such that for every set X the set L is not a home-space for X if, and only if, C is reachable from X. We show that the established relation to the reachability problem yields the Ackermann-completeness of the (semilinear) home-space problem. For this we also show that, given a Petri net with an initial marking, the set of minimal reachable markings can be constructed in Ackermannian time.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol279-concur2023/LIPIcs.CONCUR.2023.36/LIPIcs.CONCUR.2023.36.pdf
Petri nets
home-space property
semilinear sets
Ackermannian complexity