In: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 328-347. Springer-Verlag, June 1992.
Abstract: An efficient way to cope with the complexity in modelling a large-scale system consists in decomposing it into subsystems called modules, modelling each module using Petri nets and integrating these models together to obtain the model of the whole system. This paper addresses the liveness and boundedness analysis for a Petri net model with event graph modules (also called marked graphs). We prove that each event graph module can be replaced by a simple but still equivalent event graph model called minimal representation in which the internal transitions of the initial module are removed. We also prove some properties of general Petri nets which allow to simplify the liveness and boundedness analysis.