On Yen's Path Logic for Petri Nets

In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof.

[1]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[2]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[3]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[4]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[5]  Rüdiger Valk,et al.  Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..

[6]  Serge Haddad,et al.  Checking linear temporal formulas on sequential recursive Petri nets , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.

[7]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 2004, Acta Informatica.

[8]  Hsu-Chun Yen.  A Note on Fine Covers and Iterable Factors of VAS Languages , 1995, Inf. Process. Lett..

[9]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1991, Theor. Comput. Sci..

[10]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[11]  Robert M. Keller,et al.  A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

[12]  Hsu-Chun Yen.  On the Regularity of Petri Net Languages , 1996, Inf. Comput..

[13]  Javier Esparza,et al.  On the Decidability of Model Checking for Several µ-calculi and Petri Nets , 1994, CAAP.

[14]  Tadao Kasami,et al.  Three measures for synchronic dependence in Petri nets , 1983, Acta Informatica.

[15]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[16]  Rupak Majumdar,et al.  Verifying liveness for asynchronous programs , 2009, POPL '09.

[17]  Ernst W. Mayr.  Persistence of vector replacement systems is decidable , 2004, Acta Informatica.

[18]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..