Browse by author
Lookup NU author(s):
Full text is not currently available for this publication.
The Petri Box Calculus consists of an algebra of Box expressions, and a corresponding algebra of Petri Boxes, which are classes of isomorphic labelled nets. A compositional semantic provides a translation from Box expressions to Petri Boxes. This paper describes an algorithm for synthesising a Box expression from a net which is a member of the class of Petri Boxes, for a basic subset of the calculus. The related problems of checking isomorphism of members of the class of Petri Boxes, and equivalence of Box expressions are also investigated. An analysis of the synthesis algorithm provides a complete axiomatisation of the fragment of the calculus under consideration.
Author(s): Hesketh M
Publication type: Report
Publication status: Published
Series Title: Department of Computing Science Technical Report Series
Year: 1996
Pages: 53
Print publication date: 01/07/1996
Source Publication Date: July 1996
Report Number: 552
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/552.pdf
