Petri Nets, Hypergraphs and Conflicts (Preliminary Version)

We have extended the domain of application of previously known algorithms based on the representation of Petri nets as hypergraphs and graphs. In contrast to the class of conflict-free Petri nets the classes we consider are of practical interest, as they include nets representing systems that can be described with the linguistic constructs of many well known parallel languages.

[1]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[2]  Edsger W. Dijkstra,et al.  The structure of the “THE”-multiprogramming system , 1968, CACM.

[3]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[4]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[5]  C. A. Petri.  Communication with automata , 1966 .

[6]  Giorgio Ausiello,et al.  Graph Algorithms for Functional Dependency Manipulation , 1983, JACM.

[7]  Hsu-Chun Yen,et al.  An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems , 1987, Inf. Process. Lett..

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Stefano Crespi-Reghizzi,et al.  A Decidability Theorem for a Class of Vector-Addition Systems , 1975, Inf. Process. Lett..

[10]  Matthias Jantzen.  Complexity of Place/Transition Nets , 1986 .

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

[12]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[13]  Giuseppe F. Italiano,et al.  Amortized Efficiency of a Path Retrieval Data Structure , 1986, Theor. Comput. Sci..

[14]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[15]  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.

[16]  Umberto Nanni,et al.  Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets , 1992, LATIN.

[17]  Barbara Liskov,et al.  Guardians and Actions: Linguistic Support for Robust, Distributed Programs , 1983, TOPL.

[18]  Giorgio Ausiello,et al.  Dynamic Maintenance of Directed Hypergraphs , 1990, Theor. Comput. Sci..