Permutation of transitions: An event structure semantics for CCS and SCCS

  • Gérard Boudol
  • Ilaria Castellani
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 354)


We apply Berry & Lévy's notion of equivalence by permutations to CCS and Meije/SCCS, thus obtaining a pomset transition semantics for these calculi. We show that this provides an operational counterpart for an event structure semantics for CCS and SCCS similar to the one given by Winskel.


process algebras pomset-labelled transition systems event structures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Berry, J.-J. Lévy, Minimal and Optimal Computations of Recursive Programs, J. of ACM 26 (1979) 148–175.CrossRefGoogle Scholar
  2. [2]
    E. Best, R. Devillers, Interleaving and Partial Orders in Concurrency: A Formal Comparison, in Formal Description of Programming Concepts III, North-Holland (1987) 299–321.Google Scholar
  3. [3]
    G. Boudol, Computational Semantics of Term Rewriting Systems, in Algebraic Methods in Semantics (M. Nivat, J.C. Reynolds, Eds), Cambridge University Press (1985) 169–236.Google Scholar
  4. [4]
    G. Boudol, Notes on Algebraic Calculi of Processes, in Logics and Models of Concurrent Systems (K. Apt, Ed.) NATO ASI Series F13 (1985) 261–303.Google Scholar
  5. [5]
    G. Boudol, Communication is an Abstraction, Actes du Second Colloque C3 (1987) 45–63, and INRIA Res. Rep. 636.Google Scholar
  6. [6]
    G. Boudol, I. Castellani, On the Semantics of Concurrency: Partial Orders and Transition Systems, TAPSOFT 87, Lecture Notes in Comput. Sci. 249 (1987) 123–137.Google Scholar
  7. [7]
    G. Boudol, I. Castellani, Concurrency and Atomicity, Theoretical Comput. Sci. 59 (1988) 1–60.CrossRefGoogle Scholar
  8. [8]
    I. Castellani, M. Hennessy, Distributed Bisimulations, Comput. Sci. Rep. 5–87, University of Sussex (1987).Google Scholar
  9. [9]
    I. Castellani, Bisimulations for Concurrency, Ph. D. Thesis, University of Edinburgh (1988).Google Scholar
  10. [10]
    G. Costa, C. Stirling, Weak and Strong Fairness in CCS, Information and Computation 73 (1987) 207–244.CrossRefGoogle Scholar
  11. [11]
    P. Degano, R. De Nicola, U. Montanari, Partial Ordering Derivations for CCS, FCT 85, Lecture Notes in Comput. Sci. 199 (1985) 520–533.Google Scholar
  12. [12]
    J.-Y. Girard, Linear Logic, Theoretical Comput. Sci. 50 (1987) 1–102.CrossRefGoogle Scholar
  13. [13]
    R. van Glabbeek, F. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, Proceedings PARLE Conference, Eindhoven, Lecture Notes in Comput. Sci. 259 (1987) 224–242.Google Scholar
  14. [14]
    G. Heut, J.-J. Lévy, Call-by-need Computations in Non-ambiguous Linear Term Rewriting Systems, IRIA-LABORIA Report 359 (1979).Google Scholar
  15. [15]
    J.-J. Lévy, Optimal Reductions in the Lambda Calculus, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, Eds), Academic Press (1980) 159–191.Google Scholar
  16. [16]
    A. Mazurkiewicz, Concurrent Program Schemes and their Interpretations, Aarhus Workshop on Verification of Parallel Programs, Daimi PB-78, Aarhus University (1977).Google Scholar
  17. [17]
    R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comput. Sci. 92 (1980) reprinted in Report ECS-LFCS-86-7, Edinburgh University.Google Scholar
  18. [18]
    R. Milner, Calculi for Synchrony and Asynchrony, Theoret. Comput. Sci. 25 (1983) 267–310.CrossRefGoogle Scholar
  19. [19]
    R. Milner, Process Constructors and Interpretations, IFIP 86 (1986) 507–514.Google Scholar
  20. [20]
    M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Stuctures and Domains, Theoret. Comput. Sci. 13 (1981) 85–108.CrossRefGoogle Scholar
  21. [21]
    V. R. Pratt, Modelling Concurrency with Partial Orders, Intern. J. of Parallel Programming 15 (1986) 33–71.CrossRefGoogle Scholar
  22. [22]
    G. Winskel, Event Structure Semantics for CCS and Related Languages, Daimi PB-159, Aarhus University (1983) s.a. 9th ICALP, Lecture Notes in Comput. Sci. 140 (1982) 561–576.Google Scholar
  23. [23]
    G. Winskel, Event Structures, Advances in Petri Nets 86, Lecture Notes in Comput. Sci. 255 (1987) 325–392.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Gérard Boudol
    • 1
  • Ilaria Castellani
    • 1
  1. 1.INRIA Sophia-AntipolisValbonneFrance

Personalised recommendations