40 Years of Computing at Newcastle
Department Technical Report Series No. 585
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
M. Hesketh and M. Koutny
University of Newcastle upon Tyne. 1997.
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 expression 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 the boxes are supposed to represent. 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.
Department Technical Report Series - 1997
Department Technical Report Series Index
Contents Page - 40 Years of Computing at Newcastle
Technical Report Abstract No. 585, 30 June 1997