Abstract
The algebra of A-nets, a high level class of labelled Petri nets introduced in the Petri Box Calculus in order to cope with structured data, is extended with a general refinement operator and, based thereon, a general recursion operator; their properties may directly be derived from the corresponding operators for the low level Petri Boxes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri Box Calculus. In STACS’93, P. Enjalbert et al. (eds.), LNCS 665, pp. 130–140. Springer Verlag, 1993.
E. Best, R. Devillers, and J. Hall. The Box Calculus: a new causal algebra with multi-label communication. Advances in Petri Nets 1992, LNCS 609, pp. 21–69, 1992.
E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. To be presented at ICPN’95, LNCS, 1995.
E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A high level Petri net semantics of B(PN)2. To be presented at STRICT’95, LNCS, 1995.
E. Best and R.P. Hopkins. B(PN)2 -a Basic Petri Net Programming Notation. PARLE-93, LNCS 694, pp. 379–390, 1993.
E. Best and M. Koutny. A refined View of the Box Algebra - a Tutorial- Invited paper at ICPN’95, LNCS, 1995.
E. Best and M. Koutny. Solving Recursive Net Equations. Invited paper at ICALP’95, LNCS, 1995.
R. Devillers: S-invariant Analysis of General Refined Petri Boxes. In Computer Science 2: Research and Applications, pp. 411–428, Plenum Publishing, 1994.
R. Devillers. The Synchronisation Operator Revisited for the Petri Box Calculus. Technical Report LIT-290, Université Libre de Bruxelles, February 1994.
R. Devillers. S-invariant Analysis of General Recursive Petri Boxes. To appear in Acta Informatica, 1995.
J.A. Goguen, J.W. Thatcher and E.G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. Current Trends in Programming Methodology, vol. 4, pp. 80–149, Prentice-Hall, 1978.
U. Goltz and R.J. van Glabbeek: Refinement of Actions in Causality Based Models. Proc. of REX Workshop on Stepwise Refinement of Distributed Systems, LNCS 430, pp. 267–300, 1989.
H. Klaudel and E. Pelz. Communication as Unification in the Petri Box Calculus. To be presented at FCT95, LNCS, 1995.
R. Milner. A Calculus of Communicating Systems, LNCS 92, 1980.
W. Reisig. Petri nets and algebraic specifications. TCS 80, pp. 1–34, 1991.
J. Vautherin. Parallel systems specification with colored Petri nets and algebraic specification. Advances in Petri Nets 1987, LNCS 266, pp. 293–308, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Devillers, R., Klaudel, H. (1995). Refinement and Recursion in a High Level Petri Box Calculus. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_10
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive