Skip to main content
SpringerLink
Log in

Partial order semantics of Box expressions

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1994 (ICATPN 1994)

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

Included in the following conference series:

Abstract

We develop a partial order semantics for the process expressions underlying the Petri Box Calculus. We aim at a semantics which would be equivalent to the standard partial order semantics of the Petri nets (Boxes) corresponding to such expressions. The solution we present is a variant of step sequence semantics in which actions are annotated with an additional information about the relative position of the parts of the expression from which they were derived, as first proposed by Degano, De Nicola and Montanari. This information is then used to capture all essential causal dependencies among actions, leading to the definition of a partial order of action occurrences. To represent Petri net markings within process expressions we employ an overbarring and underbarring technique which is related to that used in the event systems due to Boudol and Castellani. The partial order operational model turns out to be consistent with that defined in the Petri net theory. More precisely, if an expression can execute a partial order then the same holds for the corresponding Petri Box. The converse holds for all guarded expressions.

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.

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, R.Devillers and J.Esparza: General Refinement and Recursion Operators in the Box Calculus. Proc. of STACS-93, Springer-Verlag Lecture Notes in Computer Science Vol. 665, 130–140 (1993).

    Google Scholar 

  3. E.Best, R.Devillers and J.Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets (ed. G.Rozenberg), Springer-Verlag Lecture Notes in Computer Science Vol.609, 21–69 (1992).

    Google Scholar 

  4. E.Best and R.P.Hopkins: B(PN) 2 — a Basic Petri Net Programming Notation. Proc. of PARLE-93, Springer-Verlag Lecture Notes in Computer Science Vol. 694, 379–390 (1993).

    Google Scholar 

  5. E.Best and H.G.Linde-Göers: Compositional Process Semantics of Petri Boxes. Proc. of MFPS (Mathematical Foundations of Programming Semantics), Springer-Verlag Lecture Notes in Computer Science (1993).

    Google Scholar 

  6. G.Boudol: Notes on Algebraic Calculi of Processes. In: Logics and Models of Concurrent Systems. K.R.Apt (ed.), 261–304 (1985).

    Google Scholar 

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

    Google Scholar 

  8. F.de Cindio, G.De Michelis, L.Pomello and C.Simone. Milner's Communicating Systems and Petri Nets. In: Selected Papers of 3rd European Workshop on Applications and Theory of Petri Nets, IF 66 (Springer-Verlag, Heidelberg), 40–59 (1983).

    Google Scholar 

  9. 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 

  10. P.Degano, R.De Nicola and U.Montanari: Partial Order Derivations for CCS. In: Proc. FCT, Lecture Notes in Computer Science Vol.199, Springer Verlag, 520–533 (1985).

    Google Scholar 

  11. R. de Simone: Higher-level Synchronising Devices in MEIJE-SCCS. Theoretical Computer Science Vol.37, 245–267 (1985).

    Article  Google Scholar 

  12. R.J. van Glabbeek and F.V.Vaandrager: Petri Net Models for Algebraic Theories of Concurrency. Proc. PARLE'87, Lecture Notes in Computer Science Vol.259, Springer Verlag, 224–242 (1987).

    Google Scholar 

  13. U.Goltz: On Representing CCS Programs by Finite Petri Nets. Arbeitspapiere der GMD Nr.290 (February 1988).

    Google Scholar 

  14. U.Goltz and A.Mycroft: On the Relationships of CCS and Petri Nets. In: J.Paredaens (ed.), Proc. 11th ICALP, Lecture Notes in Computer Science Vol.154, Springer Verlag, 196–208 (1984).

    Google Scholar 

  15. J.Hall, R.P.Hopkins and O.Botti: A Petri Box Semantics of occam. Advances in Petri Nets (ed. G.Rozenberg), Springer-Verlag Lecture Notes in Computer Science Vol.609, 179–214 (1992).

    Google Scholar 

  16. M.Koutny, J.Esparza and E.Best: Operational Semantics for the Petri Box Calculus. Hildesheimer Informatik-Berichte 13/93 (October 1993).

    Google Scholar 

  17. W.Li and P.E. Lauer: Using the Structural Operational Approach to Express True Concurrency. Technical Report 85-01, Departmant of Computer Science and Systems, McMaster University (1985).

    Google Scholar 

  18. H.G.Linde-Göers: Compositional Branching Processes of Petri Boxes. Ph.D. Thesis, Universität Hildesheim (October 1993).

    Google Scholar 

  19. D.May: occam. SIGPLAN Notices, Vol.l8(4), 69–79 (April).

    Google Scholar 

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

    Google Scholar 

  21. M.Nielsen and P.S.Thiagarajan: Degrees of Nondeterminism and Concurrency. Proc. of 4th Conf. on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag Lecture Notes in Computer Science Vol.181 (eds. M.Joseph and R.Shyamasundar), 89–117 (1984).

    Google Scholar 

  22. E.R.Olderog: Operational Petri Net Semantics for CCSP. In: G. Rozenberg (ed.), Advances in Petri Nets 1987, Springer-Verlag Lecture Notes in Computer Science, Vol. 266, 196–223 (1987).

    Google Scholar 

  23. G.Plotkin: A Structural Approach to Operational Semantics. Report DAIMI FN-19, Århus University, Computer Science Department, Aarhus, Denmark (1981).

    Google Scholar 

  24. D.Taubner: Finite Representations of CCS and TCSP by Automata and Petri Nets. Lecture Notes in Computer Science, Vol. 369, Springer Verlag (1989).

    Google Scholar 

  25. G.Winskel: Petri Nets, Algebras, Morphisms and Compositionality. Info. Control 72, 197–238 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Newcastle, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

Authors
  1. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Valette

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koutny, M. (1994). Partial order semantics of Box expressions. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-58152-9_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58152-9

  • Online ISBN: 978-3-540-48462-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation