Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1994: CONCUR ’94: Concurrency Theory pp 210–225Cite as

Operational Semantics for the Petri Box Calculus

  • Conference paper

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

Abstract

The Petri Box Calculus (PBC), based on Milner’s CCS, has been developed to provide a compositional semantics of high level programming constructs in terms of a class of Petri nets with interfaces, called Petri Boxes. In this paper we present a structural operational semantics for Box expressions which provide the syntax for the PBC. We show that the use of equations in addition to action rules leads to a uniform theory consisting essentially of a single action rule, a set of context rules, and a set of equations. To capture what is basically the standard Petri net transition rule, we introduce an overbarring and underbarring technique which is related to that used in the event systems due to Boudol and Castellani. We define step sequence rules and show their consistency and completeness with respect to the counterparts from net theory. The results hold also for expressions involving unguarded recursion.

Work done within the Esprit Basic Research Action 3148 DEMON and the Esprit Basic Research Working Group 6067 CALIBAN.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about 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).

    Article  MathSciNet  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).

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

    Chapter  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  MATH  MathSciNet  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: General Recursion. DEMON Technical Report, Computing Laboratory, The University of Newcastle upon Tyne (June 1991).

    Google Scholar 

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

    Google Scholar 

  17. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hail (1985).

    Google Scholar 

  18. R. Janicki and P.E. Lauer: Specification and Analysis of Concurrent Systems: the COSY Approach. Volume 26 in Springer Verlag’s Monographs on Theoretical Computer Science Series (1992).

    Google Scholar 

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

    Google Scholar 

  20. M. Koutny: Partial Order Semantics of Box Expressions. Proc. of 15th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, Springer (1994).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  23. G.J. Milne: CIRCAL and the Representation of Communication, Concurrency and Time. ACM ToPLaS 7 /2, 270–298 (April 1985).

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

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

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

    Google Scholar 

  28. Y.-J. Joung and S.A. Smolka: Efficient, Dynamically Structured Multiparty Interaction. Proc. of 28th Annual Allerton Conference on Communication, Control, and Computing (1990).

    Google Scholar 

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

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, University of Newcastle upon Tyne, NEl 7RU, UK

    Maciej Koutny

  2. Dept. of Computing Science, University of Edinburgh, EH9 3JZ, UK

    Javier Esparza

  3. Institut für Informatik, Universität Hildesheim, Marienburger Platz 22, D – 31141, Hildesheim, Germany

    Eike Best

Authors
  1. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Systems, Uppsala University, P.O. Box 325, S-751 05, Uppsala, Sweden

    Bengt Jonsson

  2. Swedish Institute of Computer Science, P.O. Box 1262, S-164 28, Kista, Sweden

    Joachim Parrow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koutny, M., Esparza, J., Best, E. (1994). Operational Semantics for the Petri Box Calculus. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48654-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58329-5

  • Online ISBN: 978-3-540-48654-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation