For the most recent entries see the Petri Nets Newsletter.

An Axiomatisation of Duplication Equivalence in the Petri Box Calculus.

Hesketh, Martin; Koutny, Maciej

In: Desel, J.; Silva, M.: Lecture Notes in Computer Science, Vol. 1420: 19th Int. Conf. on Application and Theory of Petri Nets, ICATPN'98, Lisbon, Portugal, June 1998, pages 165-184. Berlin: Springer-Verlag, June 1998.

Abstract: The Petri Box Calculus (PBC) consists of an algebra of box expressions, and a corresponding algebra of boxes (a class of labelled Petri nets). A compositional semantics provides a translation from box expressions to boxes. There are several alternative ways of defining an equivalence notion for boxes, the strongest one being net isomorphism. In this paper we consider slightly weaker notion of equivalence, called duplication equivalence, which still can be argued to capture a very close structural similarity of concurrent systems represented by boxes. We transfer the notion of duplication equivalence to the domain of box expressions and investigate the relationship between duplication equivalent boxes and box expressions. The main result of this investigation is a sound and complete axiomatisation of duplication equivalence for a fragment of recursion-free PBC.

Keywords: Net-based algebra; analysis of structure of nets; verification using nets; equivalence and axiomatisation.

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

Back to the Petri Nets Bibliography