Lookup NU author(s): Professor Eike Best,
Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This paper presents the operational semantics and the Petri net semantics of a fragment of the box algebra in tutorial style. For the operational semantics, inductive rules for marked expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. A companion paper shows how this mechanism can be extended to handle recursion.
Author(s): Best E, Koutny M
Editor(s): De Michelis, G., Diaz, M.
Publication type: Conference Proceedings (inc. Abstract)
Conference Name: 16th International Conference on Application and Theory of Petri Nets (APN)
Year of Conference: 1995
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science