For the most recent entries see the Petri Nets Newsletter.

Refinement and Recursion in a High Level Petri Box Calculus.

Devillers, Raymond; Klaudel, Hanna

In: Desel, J.: Structures in Concurrency Theory, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11-13 May 1995, pages 144-159. 1995.

Abstract: The algebra of A-nets, a high level class of labelled Petri nets introduced in the Petri Box Calculus in order to cope with structured data, is extended with a general refinement operator and, based thereon, a general recursion operator; their properties may directly be derived from the corresponding operators for the low level Petri Boxes.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography