Shortest Paths in Reachability Graphs

We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets: Given two markings M1, M2 of the reachability graph, if some path leads from M1 to M2, then some path of polynomial length in the number of transitions of the net leads from M1 to M2.

[1]  Hsu-Chun Yen,et al.  A Unified Approach for Reasoning about Conflict-Free Petri Nets , 1993, Application and Theory of Petri Nets.

[2]  Rodney R. Howell,et al.  Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets , 1989, Theor. Comput. Sci..

[3]  Javier Esparza.  A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming , 1992, Inf. Process. Lett..

[4]  de Ng Dick Bruijn,et al.  Circuits and Trees in Oriented Linear Graphs , 1951 .

[5]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[6]  Javier Esparza,et al.  Model Checking Using Net Unfoldings , 1993, Sci. Comput. Program..

[7]  Javier Esparza,et al.  Model Checking of Persistent Petri Nets , 1991, CSL.

[8]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[9]  P. S. Thiagarajan,et al.  A Fresh Look at Free Choice Nets , 1984, Inf. Control..

[10]  Rodney R. Howell,et al.  On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets , 1988, European Workshop on Applications and Theory of Petri Nets.

[11]  Rodney R. Howell,et al.  Completeness Results for Conflict-Free Vector Replacement Systems , 1988, J. Comput. Syst. Sci..

[12]  Edward L. Robertson,et al.  Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[13]  H. Fleischner.  Eulerian graphs and related topics , 1990 .

[14]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[15]  Hsu-Chun Yen.  A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets , 1991, Inf. Process. Lett..