In: Lecture Notes in Computer Science, Vol. 802; Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, April 1993, pages 250-270. Springer-Verlag, 1993.
Abstract: The Petri Box Algebra defines a linear notation to express a structured class of Petri nets which can be seen as a modification and generalisation of Milner's CCS. The calculus has been designed as an intermediate stage notations into Petri nets. This paper defines the notion of a `Box process' intended to capture the (Petri net) partial order semantics of the Box semantics so defined, and the indirect non-compositional semantics which uses processes of Petri nets, for a class of expressions.
Back to the Petri Nets Bibliography