Lookup NU author(s): Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Hesketh M, Koutny M
Editor(s): Desel, J., Silva, M.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 19th International Conference on Application and Theory of Petri Nets (ICATPN)
Year of Conference: 1998
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science