Skip to main content
SpringerLink
Log in

On representing CCS programs by finite petri nets

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

Abstract

A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics.

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. E. Best: In Quest of a Morphism, Petri Net Newsletter 18, 14–18 (1984).

    Google Scholar 

  2. G. Boudol, I. Castellani: On the Semantics of Concurrency: Partial Orders and Transition Systems, in: proceedings TAPSOFT '87, Vol. 1, LNCS 249, Springer-Verlag (1987).

    Google Scholar 

  3. G. Boudol, G. Roucairol, R. de Simone: Petri Nets and Algebraic Calculi of Processes, INRIA, Rapports de Recherche No. 292 (1984).

    Google Scholar 

  4. F. de Cindio, et al.: Milner's Communicating Systems and Petri Nets, in: selected papers from the 3rd European Workshop on Application and Theory of Petri Nets, Springer Informatik Fachberichte 66 (1983).

    Google Scholar 

  5. L. Czaja: Making Nets Abstract and Structured, Advances in Petri Nets 85, LNCS 222, Springer-Verlag, 181–202 (1986).

    Google Scholar 

  6. P. Degano, R. De Nicola, U. Montanari: A New Operational Semantics for CCS based on Condition/Event Systems”, nota interna B4-42, Dept. of Computer Science, Univ. Pisa (1986).

    Google Scholar 

  7. P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Nota Interna B4-21, Istituto di Elibaratione dell 'Informazione, C.N.R, Pisa (1987).

    Google Scholar 

  8. R.J. van Glabbeek, F.W. Vaandrager: Petri Net Models for Algebraic Theories of Concurrency, in: proceedings PARLE, Vol. II, LNCS 259, Springer-Verlag (1987).

    Google Scholar 

  9. U. Goltz, A. Mycroft: On the Relationship of CCS and Petri Nets, in: proceedings ICALP 84, LNCS 172, Springer-Verlag (1984).

    Google Scholar 

  10. U. Goltz, W. Reisig: ”The Non-sequential Behaviour of Petri Nets, in: Information and Control, Vol. 57, Nos. 2–3, (1983).

    Google Scholar 

  11. J. Grabowski: On Partial Languages, Fundamenta Informaticae IV.2, 427–498 (1981).

    Google Scholar 

  12. M. Hennessy: Axiomatising Finite Concurrent Processes, University of Sussex, Computer Science, Report No. 4/84 (1987).

    Google Scholar 

  13. V.E. Kotov: An Algebra for Parallelism based on Petri Nets, in: proceedings MFCS 78, LNCS 64, Springer-Verlag, 39–54 (1978).

    Google Scholar 

  14. R. Milner: Lectures on a Calculus for Communicating Systems, in: Seminar on Concurrency, Carnegie-Mellon Univ., Pittsburgh 1984, LNCS 197, Springer-Verlag (1985).

    Google Scholar 

  15. E.-R. Olderog: Operational Petri Net Semantics for CCSP, in: Advances in Petri Nets 1987, LNCS 266, Springer-Verlag (1987).

    Google Scholar 

  16. D. Park: Concurrency and Automata on Infinite Sequences, in: proceedings 5th GI Conf. on Theoretical Computer Science, LNCS 104, Springer-Verlag (1981).

    Google Scholar 

  17. C.A. Petri: Non-Sequential Processes, Internal Report 74-07, GMD, Institut für Informationssystem-forschung (1977).

    Google Scholar 

  18. W. Reisig: Petri Nets, EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).

    Google Scholar 

  19. D. Taubner: Theoretical CSP and Formal Languages, report TUM-18706, TU München, Institut für Informatik (1987)

    Google Scholar 

  20. D. Taubner: A Step Failures Consistent Transition of Regular TCSP to Finite and Safe Petri Nets, manuscript (1987)

    Google Scholar 

  21. G. Winskel: Event Structure Semantics for CCS and Related Languages, in: proceedings ICALP 82, LNCS 224, Springer-Verlag (1982).

    Google Scholar 

  22. G. Winskel: A New Definition of Morphism on Petri Nets, in: proceedings 1st STACS, LNCS 166, Springer-Verlag (1984)

    Google Scholar 

  23. G. Winskel: Event Structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, Springer-Verlag (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD-F1P, Postfach 1240, D-5205, St. Augustin 1

    Ursula Goltz

Authors
  1. Ursula Goltz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goltz, U. (1988). On representing CCS programs by finite petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017157

Download citation

  • DOI: https://doi.org/10.1007/BFb0017157

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation