Abstract
The paper shows how to synthesize S-invariants and S-components for a refined Petri Box, from the characteristics of its constituents. The construction is based on the tree structure of the interface places gluing the refining fragments to the remaining part of the Box to be refined.
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
E.Best, R.Devillers and J.Esparza: General Refinement and Recursion for the Box Calculus. Hildesheimer Informatik-Berichte 26/92 (1992).
E.Best, R.Devillers and J.Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Proceedings Stacs-93, P. Enjalbert et al. (eds.). Springer-Verlag Lecture Notes in Computer Science Vol. 665, pp.130–140 (1993).
E.Best, R.Devillers and J.Hall: The Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets 1992, G. Rozenberg (ed.). Springer-Verlag Lecture Notes in Computer Science Vol. 609, pp. 21–69 (1992).
E.Best, R.Devillers, A.Kiehn and L.Pomello: Concurrent Bisimulations in Petri Nets. Acta Informatica 28, pp. 231–264 (1991).
E.Best, C.Fernández: Notations and Terminology on Petri Net Theory. GMD Arbeitspapiere 195 (1986).
E.Best and R.P.Hopkins: B(PN) 2 — A Basic Petri Net Programming Notation. To appear in the Proceedings of PARLE-93. Springer-Verlag Lecture Notes in Computer Science (June 1993).
R.Devillers: Maximality Preserving Bisimulation. TCS 102, pp. 165–183 (1992).
R.Devillers: Maximality Preservation and the ST-idea for Action Refinements. Advances in Petri Nets 1992. Lecture Notes in Computer Science 609, pp. 108–151 (1992).
R.Devillers: Tree Interfaces in the Petri Box Calculus. Draft Report LIT-265. Université Libre de Bruxelles (1992).
R.Devillers: General Refinement and Recursion for the Petri Box Calculus (Extended Abstract). Proceedings of the Workshop ”What Good are Partial Orders ?”, E.Best (ed.). Hildesheimer Informatik-Berichte 13/92, pp.57–76 (1992).
R.Devillers: S-invariant Analysis of Petri Boxes. Draft Report LIT-273. Université Libre de Bruxelles (December 1992).
R.Devillers: Towards a General Relabelling Operator for the Petri Box Calculus. Draft Report LIT-274. Université Libre de Bruxelles (January 1993).
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, G. Rozenberg (ed.). Springer-Verlag Lecture Notes in Computer Science Vol. 609, pp. 179–214 (1992).
R.Milner: Communication and Concurrency. Prentice Hall (1989).
W.Reisig: Petri Nets, an Introduction. EATCS Monographs on Theoretical Computer Science. Vol 4. Springer Verlag (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Devillers, R. (1993). Construction of S-invariants and S-components for refined Petri boxes. In: Ajmone Marsan, M. (eds) Application and Theory of Petri Nets 1993. ICATPN 1993. Lecture Notes in Computer Science, vol 691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56863-8_50
Download citation
DOI: https://doi.org/10.1007/3-540-56863-8_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56863-6
Online ISBN: 978-3-540-47759-4
eBook Packages: Springer Book Archive