In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'98), 11-14 October 1998, San Diego, CA, pages 66-71. 1998.
Abstract: The theory behind the notions of place invariants and place flows for colored Petri nets has been known since 1980, but the lack of tool support entails that the practical use of these results has been very limited. The aim of this paper is to help bridging the gaps between the theory and tool support related to place flows. There are three related problem areas to address: finding place flows from the structure and inscriptions of CP-nets, showing how the place flows determine place invariants, and finally finding properties of CP-nets from place invariants. The paper shows how checking that a set of weights determines a place flow can be formulated as a lambda-expression rewriting problem, allowing us to use the whole set of techniques developed inside the field of lambda calculus. It is also shown how these techniques can be used to prove properties such as deadlock freeness.
Keywords: colored Petri nets, deadlock freeness, lambda calculus, place flows, place invariants.
Back to the Petri Nets Bibliography