Toggle Main Menu Toggle Search

ePrints

An Axiomatisation of Duplication Equivalence in the Petri Box Calculus

Lookup NU author(s): Professor Maciej Koutny

Downloads

Full text is not currently available for this publication.


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.


Publication metadata

Author(s): Hesketh M, Koutny M

Publication type: Report

Publication status: Published

Series Title: Department of Computing Science Technical Report Series

Year: 1997

Pages: 42

Report Number: 585

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/585.pdf


Share