On the relationship of CCS and petri nets

  • Ursula Goltz
  • Alan Mycroft
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


We give a partial order semantics to (pure) CCS via a translation into Petri nets and prove, that the interleaved behaviour of the resulting nets is equivalent to Milner's semantics. We show that a large class of CCS programs can be represented by finite nets and that this is impossible for the whole CCS.


Derivation Relation Communication Possibility Partial Order Semantic Synchronisation Tree Interleave Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /Ab/.
    Abramsky, S. Eliminating local non-determinism: a new semantics for CCS. Report 290, Computer systems laboratory, Queen Mary College, London, 1981.Google Scholar
  2. /Ba/.
    de Bakker, et al. Linear time and branching time semantics for recursion with merge. LNCS 154: Proceedings 10th ICALP, Barcelona, 1983.Google Scholar
  3. /Br/.
    Brauer, W. (ed) Net theory and applications. LNCS 84: Proceedings of the advanced course on net theory and applications, Hamburg, 1980.Google Scholar
  4. /Ci1/.
    de Cindio, et al. Superposed automata nets. IF 52: Selected papers from the 1st and 2nd european workshop on applications and theory of Petri nets, 1982.Google Scholar
  5. /Ci2/.
    de Cindio, et al. Milner's CCS and Petri nets. IF 66: Selected papers from the 3rd european workshop of applications and theory of Petri nets, 1983.Google Scholar
  6. /GM1/.
    Goltz, U., Mycroft, A. On the relationship of CCS and Petri nets. Research report, Inst. för informationsbehandling, Chalmers TH, Göteborg, 1984.Google Scholar
  7. /GM2/.
    Goltz, U., Mycroft, A. Net behaviour representations and equivalence notions. Submitted to 4th european workshop on applications and theory of Petri nets, 1984.Google Scholar
  8. /GS/.
    Genrich, H.J., Stankiewicz-Wiechno, E. A dictionary of some basic notions of net theory. In /Br/.Google Scholar
  9. /Mi/.
    Milner, R. A calculus of communicating systems. LNCS 92, 1980.Google Scholar
  10. /NPW/.
    Nielsen, M., Plotkin, G.D., Winskel, G. Petri nets, event structures and domains. Theoretical Computer Science 13(1) 1981.Google Scholar
  11. /Re1/.
    Reisig, W. Petrinetze — eine einführung. Springer-Verlag, 1982. (To appear in english.)Google Scholar
  12. /Re2/.
    Reisig, W. Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. LNCS: Proceedings 11th ICALP, Antwerp, 1984. (This volume.)Google Scholar
  13. /Wi1/.
    Winskel, G. Event structure semantics for CCS and related languages. DAIMI report PB-159, Århus University. Shorter version in LNCS 140: Proceedings 9th ICALP, 1982.Google Scholar
  14. /Wi2/.
    Winskel, G. A new definition of morphism on Petri nets. LNCS: Proceedings 1st symposium on theoretical aspects of computer science, Paris, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ursula Goltz
    • 1
  • Alan Mycroft
    • 2
  1. 1.Lehrstuhl für Informatik IIRWTH AachenAachenWest-Germany
  2. 2.Institutionen för Informationsbehandling Chalmers Tekniska HögskolaGöteborgSweden

Personalised recommendations