Advertisement

Distributed implementation of CCS

  • Roberto Gorrieri
  • Ugo Montanari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 674)

Abstract

A distributed semantics for CCS is given by implementing Milner's Calculus of Communicating Systems onto a simpler calculus of Place/Transition Petri Nets. The net calculus, called SCONE+, is an extension of SCONE [GM90], which has the finer grained operation of local nondeterministic choice, with some operations for modelling restriction and relabelling. In this way, full CCS can be given a net implementation in a purely algebraic way. The complex CCS operation of global nondeterminism is implemented by means of a suitable mapping, which makes explicit the fact that certain CCS transitions are implemented as SCONE+ computations to be executed atomically. To this aim, CCS and SCONE+ are given an operational semantics in algebraic form. In this way, the mapping from CCS transitions to SCONE+ computations becomes simply an algebraic morphism, which can be interpreted as a denotational semantics for CCS having SCONE+ as interpretation domain. The semantics of CCS obtained by quotienting the CCS transition system w.r.t. the implementation mapping is equivalent to the concurrent semantics by “permutation of transitions”, as proposed in [BC90, FM90].

Keywords

Place/Transition Petri nets concurrent calculi net calculi operational semantics denotational semantics atomicity implementation morphism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB90]
    G. Berry, G. Boudol, “The Chemical Abstract Machine”, in Proc. 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, 81–94, January 1990.Google Scholar
  2. [BC89]
    G. Boudol, I. Castellani, “Permutation of Transitions: An Event Structure Semantics for CCS and SCCS”, in Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, Springer-Verlag, 411–437, 1989Google Scholar
  3. [BC90]
    G. Boudol, I. Castellani, “Three Equivalent Semantics for CCS”, in Proc. 18th Ecole de Printemps sur la Semantique de Parallelism, La Roche-Posay, LNCS 469, 96–141, 1990.Google Scholar
  4. [BD87]
    E. Best, R. Devillers, “Sequential and Concurrent Behaviour of Petri Net Theory”, Theoretical Computer Science 55 (1), 87–136, 1987.Google Scholar
  5. [BL86]
    J.P. Banâtre, D. Le Matayer, “A New Computational Model and its Discipline of Programming”, Tech-Rep. INRIA n. 566, 1986.Google Scholar
  6. [CFM90]
    A. Corradini, G.L. Ferrari, U. Montanari, “Transition Systems with Algebraic Structure as Models of Computation”, in Proc. 18th Ecole de Primtemps sur la Semantique de Parallelism, La Roche-Posay, LNCS 469, Springer-Verlag, 185–222, 1990.Google Scholar
  7. [CG89]
    N. Carriero, D. Gelerntner, “Linda in Context”, Communications of the ACM 32 (4), 444–458, 1989.Google Scholar
  8. [CM88]
    M. Chandy, J. Misra, Parallel Program Design, Addison-Wesley, 1988.Google Scholar
  9. [DDM85]
    P. Degano, R. De Nicola, U. Montanari, “Partial Ordering Derivations for CCS”, in Proc. FCT85, LNCS 199, 520–533, 1985.Google Scholar
  10. [DDM88]
    P. Degano, R. De Nicola, U. Montanari, “A Distributed Operational Semantics for CCS based on Condition/Event Systems”, Acta Informatica, 26, 59–91, 1988.Google Scholar
  11. [DDM89]
    P. Degano, R. De Nicola, U. Montanari, “Partial Ordering Description of Nondeterministic Concurrent Systems”, in Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, Springer-Verlag, 438–466, 1989Google Scholar
  12. [DDM90]
    P. Degano, R. De Nicola, U. Montanari, “Partial Ordering Semantics for CCS”, Theoretical Computer Science 75, 223–262, 1990.Google Scholar
  13. [DMM89]
    P. Degano, J. Meseguer, U. Montanari, “Axiomatizing Net Computations and Processes”, in Proc. 4th Annual Symp. on Logic in Computer Science LICS, Asilomar, CA, IEEE Computer Society Press, 175–185, 1989.Google Scholar
  14. [FM90]
    G.L. Ferrari, U. Montanari, “Towards a Unification of Models for Concurrency”, in Proc. Coll. on Trees in Algebra and Programming (CAAP'90), LNCS 431, 162–176, 1990.Google Scholar
  15. [Gol88a]
    U. Goltz, Über die Darstellung von CCS-Programmen durch Petrinetze, Ph.D. Thesis, RWTH Aachen, 1988.Google Scholar
  16. [Gol88b]
    U. Goltz, “On Representing CCS Programs by Finite Petri Nets”, Proc. MFCS'88, LNCS 324, 339–350, 1988.Google Scholar
  17. [GM90]
    R. Gorrieri, U. Montanari, “SCONE: A Simple Calculus of Nets”, in Proc. CONCUR'90 Conference, Amsterdam, LNCS 458, 2–30, 1990.Google Scholar
  18. [GR83]
    U. Goltz, W. Reisig, “The Non-sequential Behaviour of Petri Nets”, Information and Computation 57, 125–147, 1983.Google Scholar
  19. [JM90]
    R. Janicki, T. Müldner, “Transformations of Sequential Specificationsinto Concurrent Specifications by Synchronization Guards”, Theoretical Computer Science 77, 97–129, 1990.Google Scholar
  20. [Mes90]
    J. Meseguer, “Rewriting as a Unified Model of Concurrency”, in Proc. CONCUR'90 Conference, Amsterdam, LNCS 458, 384–400, 1990.Google Scholar
  21. [Mil89]
    R. Milner, Communication and Concurrency, Prentice Hall, 1989.Google Scholar
  22. [MM88]
    J. Meseguer, U. Montanari, “Petri Nets are Monoids: A New Algebraic Foundation for Net Theory”, in Proc. 3rd Annual Symp. on Logic in Computer Science LICS, Edinburgh, IEEE Computer Society Press, 155–164, 1988.Google Scholar
  23. [MM90]
    J. Meseguer, U. Montanari, “Petri Nets are Monoids”, Information and Computation 88 (2), 105–155, 1990.Google Scholar
  24. [MSS90]
    V. Manca, A. Salibra, G. Scollo, “Equational Type Logic”, Theoretical Computer Science 77, 1–29, 1990.Google Scholar
  25. [MY89]
    U. Montanari, D. Yankelevich, “An Algebraic View of Interleaving and Distributed Operational Semantics for CCS”, Proc. 3rd Conf. on Category Theory in Comp. Scie., LNCS 389, 5–20, 1989.Google Scholar
  26. [Old87]
    E.-R. Olderog, “Operational Petri Net Semantics for CCSP”, in Advances in Petri Nets 1987, LNCS 266, Springer-Verlag, 196–223, 1987.Google Scholar
  27. [Old89]
    E.-R. Olderog, “Strong Bisimilarity on Nets”, in Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, Springer-Verlag, 549–573, 1989.Google Scholar
  28. [Pet62]
    C.A. Petri, “Kommunikation mit Automaten”, Schriften des Institutes für Instrumentelle Mathematik, Bonn, 1962.Google Scholar
  29. [Plo81]
    G. Plotkin, “A Structural Approach to Operational Semantics”, Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, 1981.Google Scholar
  30. [Pro90]
    P.W.Prószynski, “The Core Concurrency”, Proc. of ICCI'90, LNCS 468, 1990.Google Scholar
  31. [Tau89]
    D. Taubner, Finite Representation of CCS and TCSP Programs by Automata and Petri Nets, LNCS 369, 1989.Google Scholar
  32. [Win82]
    G. Winskel, “Event Structures for CCS and Related Languages”, in Proc. 9th ICALP, LNCS 140, Springer-Verlag, 561–576, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Roberto Gorrieri
    • 1
  • Ugo Montanari
    • 2
  1. 1.Dipartimento di MatematicaUniversità di BolognaBolognaItaly
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations