A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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.doi:10.1016/s0019-9958(83)80040-0 fatcat:3mbgwqyu2vgufpel24c2y2naly