Abstract
New generalised definitions are given for the refinement and recursion operators in the calculus of Petri Boxes. It is shown that not only recursion, but also other operators such as sequence, choice and iteration can be viewed as based on refinement. Various structural properties of these operators can be deduced from a general property of (simultaneous) refinement. A partial order based denotational approach for recursion is presented, which yields a unique fixpoint even in unguarded cases. The construction is based on a judicious naming discipline for places and transitions and yields a closed form for the fixpoint.
Work done within the Esprit Basic Research Working Group 6067 CALIBAN (CAusal calcuLI BAsed on Nets).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.C.M.Baeten and W.P.Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science (1990).
E.Best, R.Devillers and J.Esparza: General Refinement and Recursion Operators for the Box Calculus. Hildesheimer Informatikbericht (December 1992).
E.Best, R.Devillers and J.Hall: The Box Calculus: a New Causal Algebra with Multi-label Communication. Advances in Petri Nets 1992. Springer-Verlag Lecture Notes in Computer Science Vol. 609, 21–69 (1992).
E.Best and H.G.Linde-Göers: Compositional Process Semantics of Petri Boxes. Hildesheimer Informatikbericht (December 1992).
G.Boudol and I.Castellani: Flow Models of Distributed Computations: Event Structures and Nets. Rapport de Recherche, INRIA, Sophia Antipolis (July 1991).
P.Degano, R. De Nicola and U.Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Informatica 26 (1988).
R.J.van Glabbeek and F.V.Vaandrager: Petri Net Models for Algebraic Theories of Concurrency. Proc. PARLE 89, Springer-Verlag Lecture Notes in Computer Science Vol. 259, 224–242 (1987).
U.Goltz: Über die Darstellung von CCS-Programmen durch Petrinetze. (In German.) R.Oldenbourg Verlag, GMD-Bericht Nr.172 (1988).
U.Goltz and R.J.van Glabbeek: Refinement of Actions in Causality Based Models. Proc. of REX Workshop on Stepwise Refinement of Distributed Systems, Springer-Verlag Lecture Notes in Computer Science, 267–300 (1989).
R.P.Hopkins, J.Hall and O.Botti: A Basic-Net Algebra for Program Semantics and its Application to occam. Advances in Petri Nets 1992. Springer-Verlag Lecture Notes in Computer Science Vol. 609, 179–214 (1992).
C.A.R.Hoare: Communicating Sequential Processes. Prentice Hall (1985).
R.Milner: Communication and Concurrency. Prentice Hall (1989).
E.R.Olderog: Nets, Terms and Formulas. Habilitation (1989). Cambridge Tracts in Theoretical Computer Science (1991).
D.Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag Lecture Notes in Computer Science Vol. 369 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Devillers, R., Esparza, J. (1993). General refinement and recursion operators for the Petri Box calculus. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive