Processes of place/transition-nets

Abstract

The idea of representing nonsequential processes as partially ordered sets (occurrence nets), is applied to place/transitions-nets (Petrinets), generalizing 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 we get the result that a place/transition-net is bounded if and only if its processes are K-dense.