Graph-Theoretical Analysis of A Subclass of Petri-Nets

In this paper, an informal description of a Petri Net subclass is given, which is described in more detail in /HE79/. A diagram will be presented describing the relationship of that subclass to other well-known subclasses. A slightly different notion of liveness (compared to other approaches) is explained by an example, which is related to an interpretion in the area of concurrent programs. Finally, the same example /LAT/ of a non-live Petri Net is analysed as in /MEM/ (contained in these proceedings). The most important steps of the graphtheoretical analysis are shown.