Browse by author
Lookup NU author(s): Professor Maciej KoutnyORCiD, Professor Eike Best
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This paper describes general theory underpinning the operational semantics and the denotational Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process 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. The paper also describes a denotational approach to the Petri net semantics of recursive expressions. A domain of nets is identified such that the solution of a given recursive equation can be found by fixpoint approximation from some suitable starting point. The consistency of the two semantics is demonstrated. The theory is generic for a wide class of algebraic operators and synchronisation schemes. © 1999 - Elsevier Science B.V. All rights reserved.
Author(s): Koutny M, Best E
Publication type: Article
Publication status: Published
Journal: Theoretical Computer Science
Year: 1999
Volume: 211
Issue: 1-2
Pages: 1-83
Print publication date: 03/03/1999
ISSN (print): 0304-3975
ISSN (electronic):
Publisher: Elsevier BV
URL: http://dx.doi.org/10.1016/S0304-3975(97)00180-1
DOI: 10.1016/S0304-3975(97)00180-1
Altmetrics provided by Altmetric
