In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 609; Advances in Petri Nets 1992, pages 179-214. Springer-Verlag, 1992.
Abstract: We define an algebra comprising a class of basic Petri nets, enhanced with place and transition labels, together with operations of sequence, choice, parallel, iteration, prioritized choice and label hiding. An important characteristic of the algebra is that it combines transition-based composition for modelling synchronous communication, as in Petri net semantics for CCS or TCSP, with place composition for modelling shared variables. We use the algebra to give a family of net semantics for a version of OCCAM, comprising a full semantics, for which we have consistency with the Laws of OCCAM, and a range of semantics for partial data abstraction which give smaller nets (for more practical use of net tools and techniques) with a limited consistency such that safety (but not liveness) properties transfer from more-abstracted to less-abstracted semantics.
Keywords: OCCAM; Programming Language Semantics; Petri Net Algebras; Data Abstraction.
Back to the Petri Nets Bibliography