Structural liveness of Petri nets is ExpSpace-hard and decidable

Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is verification of safety and liveness properties in this model; despite an extensive research effort, some basic problems remain open, which is exemplified by the complexity status of the reachability problem that is still not fully clarified. The liveness problems are known to be closely related to the reachability problem, and various structural properties of nets that are related to liveness have been studied. Somewhat surprisingly, the decidability status of the problem of determining whether a net is structurally live, i.e. whether there is an initial marking for which it is live, remained open for some time; e.g. Best and Esparza (Inf Process Lett 116(6):423–427, 2016 . https://doi.org/10.1016/j.ipl.2016.01.011 ) emphasize this open question. Here we show that the structural liveness problem for Petri nets is ExpSpace -hard and decidable. In particular, given a net N and a semilinear set S , it is decidable whether there is an initial marking of N for which the reachability set is included in S ; this is based on results by Leroux (28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, New Orleans, LA, USA, June 25–28, 2013, IEEE Computer Society, pp 23–32, 2013 . https://doi.org/10.1109/LICS.2013.7 ).