Skip to main content
SpringerLink
Log in

Compositional process semantics of Petri Boxes

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 802))

Abstract

The Petri Box algebra defines a linear notation to express a structured class of Petri nets which can be seen as a modification and generalisation of Milner's CCS. The calculus has been designed as an intermediate stage in the compositional translation of higher level concurrent programming notations into Petri nets. This paper defines the notion of a ‘Box process’ intended to capture the (Petri net) partial order semantics of the Box algebra. The main result is the equivalence of the direct compositional semantics so defined, and the indirect non-compositional semantics which uses processes of Petri nets, for a class of expressions.

Work done within the Esprit Basic Research Action 3148 DEMON (Design Methods Based on Nets) and the Working Group 6067 CALIBAN (Causal Calculi Based on Nets).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M.Baeten and W.P.Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science (1990).

    Google Scholar 

  2. E.Best: Concurrent Behaviour: Sequences, Processes and Axioms. Seminar on Concurrency, Carnegie-Mellon University, Pittsburgh, PA, July 9–11, 1984 (eds. S.D.Brookes; A.W.Roscoe; G.Winskel) Springer-Verlag Lecture Notes in Computer Science Vol. 197, 221–245 (1985).

    Google Scholar 

  3. E.Best and R.Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science Vol. 55, 87–136 (1987).

    Google Scholar 

  4. E.Best, R.Devillers and J.Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Proceedings of STACS-93, P. Enjalbert et al. (eds.). Springer-Verlag Lecture Notes in Computer Science Vol. 665, 130–140 (1993).

    Google Scholar 

  5. E.Best, R.Devillers and J.G.Hall: The Box Calculus: a New Causal Algebra with Multi-label Communication. In: DEMON Special Volume of the Advances in Petri Nets (ed. G.Rozenberg), Springer-Verlag Lecture Notes in Computer Science Vol.609, 21–69 (1992).

    Google Scholar 

  6. E.Best and R.P.Hopkins: B(PN) 2 — A Basic Petri Net Programming Notation. Proc. PARLE-93, Springer-Verlag LNCS (June 1993).

    Google Scholar 

  7. E.Best, J.Esparza and M.Koutny: Operational Semantics for the Box Algebra. Hildesheimer Informatikbericht Nr. 13/93 (1993).

    Google Scholar 

  8. E.Best and H.G.Linde-Göers: Compositional Process Semantics of Petri Boxes. Hildesheimer Informatikbericht Nr. 12/93 (1993).

    Google Scholar 

  9. G.Boudol and I.Castellani: Flow Models of Distributed Computations: Event Structures and Nets. Rapport de Recherche, INRIA, Sophia Antipolis (July 1991).

    Google Scholar 

  10. L.Cherkasova and V.Kotov: Descriptive and Analytical Process Algebras. Advances in Petri Nets 89 (ed. G.Rozenberg), Springer-Verlag Lecture Notes in Computer Science Vol. 424, 77-104 (1989).

    Google Scholar 

  11. P.Degano, R.De Nicola and U.Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Informatica 26 (1988).

    Google Scholar 

  12. R.Devillers: Construction of S-invariants and S-components for Refined Petri Boxes. Proc. of Conf. on Appl. and Theory of Petri NetsChicago, Springer-Verlag LNCS (June 1993).

    Google Scholar 

  13. J.Engelfriet: Branching Processes of Petri Nets. Acta Informatica Vol. 28, 575–591 (1991).

    Google Scholar 

  14. 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).

    Google Scholar 

  15. U.Goltz: Über die Darstellung von CCS-Programmen durch Petrinetze. (In German.) R.Oldenbourg Verlag, GMD-Bericht Nr.172 (1988). See also: U.Goltz: On Representing CCS Programs by Finite Petri Nets. Proc. MFCS-88, Springer-Verlag Lecture Notes in Computer Science Vol.324, 339–350 (1988).

    Google Scholar 

  16. 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).

    Google Scholar 

  17. U.Goltz and W.Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57(2–3), 125–147 (1983).

    Google Scholar 

  18. 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).

    Google Scholar 

  19. C.A.R.Hoare: Communicating Sequential Processes. Prentice Hall (1985).

    Google Scholar 

  20. H.G.Linde-Göers: Compositional Branching Processes of Petri Nets. Ph.D. Thesis (1993).

    Google Scholar 

  21. D.May: occam. SIGPLAN Notices, Vol. 18(4), 69–79 (April 1983).

    Google Scholar 

  22. J.-J.Ch.Meyer and E.P.de Vink: Pomset Semantics for True Concurrency with Synchronisation and Recursion. Proc. MFCS-89, Springer LNCS Vol.379 (ed. Kreczmar/Mirkowska) (1989).

    Google Scholar 

  23. R.Milner: Communication and Concurrency. Prentice Hall (1989).

    Google Scholar 

  24. E.R.Olderog: Nets, Terms and Formulas. Habilitation (1989). Cambridge Tracts in Theoretical Computer Science (1991).

    Google Scholar 

  25. V. Pratt: Modeling Concurrency with Partial Orders. Int. Journal of Parallel Programming, Vol. 15(1), 33–71 (1986).

    Google Scholar 

  26. D.Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag Lecture Notes in Computer Science Vol. 369 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hildesheim, Marienburger Platz 22, D-31141, Hildesheim

    Eike Best & Hans-Günther Linde-Göers

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Günther Linde-Göers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Linde-Göers, HG. (1994). Compositional process semantics of Petri Boxes. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-58027-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58027-0

  • Online ISBN: 978-3-540-48419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation