A proposal for operational semantics and equivalence of finite asynchronous processes

  • Luis Mejia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)


We propose an operational interpretation of behaviour of concurrent processes in which concurrency is not interpreted as interleaving of elementary actions. We consider only finite processes and describe them in a reduced version of Milner's CCS. Processes are agents having a number of communication capabilities enabling them to communicate. Communications are made via complementary capabilities when these are ready. We build computation traces wich reflect the dependence and independence relations between events. Traces allow us to define equivalent computations and thereby equivalent processes. We define the "capability structure" of processes and show that two processes are equivalent if and only if they have the same capability structure.


Operational Semantic Concurrent Process Communication Capability Capability Structure Order Isomorphism 
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. [1]
    — G. Berry, J.J. Levy. "Minimal and Optimal Computations of Recursive Programs". J.ACM 26, 1, (Jan 1979), 148–175.Google Scholar
  2. [2]
    -Ph. DARONDEAU. "Processus non Séquentiels et leurs Observations en Univers non Centralisé". International Symposium on Programming. Paris, April 1980, Lecture Notes in Computer Science 83.Google Scholar
  3. [3]
    -M. HENNESSY, R. MILNER. "On Observating non Determinism and Concurrency". 8-th ICALP Amsterdam. Lecture Notes in Computer Science. — 85.Google Scholar
  4. [4]
    -J. J. LEVY. "Réductions Correctes et Optimales dans le Lambda-Calcul". Thèse de Doctorat d'Etat. Université Paris-7. 1978.Google Scholar
  5. [5]
    -A. MAZURKIEWICZ. "Equational Semantics of Concurrent Systems". Ecole de Printemps d'Informatique. Réseaux de Petri et Parallélisme. Colleville-sur-Mer. Mai 1980.Google Scholar
  6. [6]
    -L. F. MEJIA. Thèse de 3ème cycle (To appear).Google Scholar
  7. [7]
    -R. MILNER. "A Calculus of Communicating Systems". Lecture Notes in Computer Science 92.Google Scholar
  8. [8]
    -M. NIELSEN, G. PLOTKIN, G. WINSKEL. "Petri Nets, Event Structures and Domains". Semantics of Concurrent Computation, Evian 1979, Lecture Notes in Computer Science 70.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Luis Mejia
    • 1
  1. 1.Ecole Nationale Supérieure des Mines de ParisCentre de Mathématiques AppliquéesVALBONNEFRANCE

Personalised recommendations