Author:
Li Jiao
Affiliation:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China
Keyword(s):
Analysis, boundedness, composition, liveness, Petri nets, regularity.
Related
Ontology
Subjects/Areas/Topics:
Formal Methods
;
Petri Nets
;
Simulation and Modeling
Abstract:
By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be preserved after applying many compositional operations to Petri nets. This means that, by applying these compositional operations, a designer can construct complex nets satisfying regularity, liveness and boundedness properties from simpler ones without forward analysis.