The non-sequential behaviour of Petri nets. (English) Zbl 0551.68050

The idea of representing non-sequential processes as partially ordered sets (occurrence nets) is applied to place/transition nets (Petri nets), based on the well known notion of process for condition/event-systems. For occurrence nets some theorems relating K-density, cut finiteness, and discreteness are proved. With these theorems the result that a place/transition net is bounded if and only if its processes are K-dense is obtained.


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Full Text: DOI