Browse by author
Lookup NU author(s): Professor Eike Best
Full text is not currently available for this publication.
A new Petri net calculus called the calculus of Petri Boxes is described. It has been designed to facilitate the compositional semantic translation of high level constructs such as blocks, variables and atomic actions into elementary Petri nets. The calculus is located 'midway' in such a transaltion. This tutorial-style paper first defines an algebra of Box expressions. The two algebras feature a general asynchronous communication operation extending that of CCS. Synchronisation is defined as as a unary operator. The algebras also include refinement and recursion. It is shown how they can be used to describe data and blocks. As the main results of this paper, it is proved that the algebras satisfy various desirable structural laws and enjoy desirable behavioural properties. A companion paper (E.Best, J Esparza and M. Koutny: Operational semantics of the Box Algebra') defines and indigenous operational semantics and shows the relationship to CSS and to the transition rule semantics of Petri nets. Another companion paper (J. Esparza: 'Fix-point definition of Recursion in the Box Algebra') describes the details of the definition of recursion.
Author(s): Best E, Hall J
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1992
Report Number: 373
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
