Relational semantics of strongly communicating sequential processes

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


A strongly communicating sequential process is one that cannot execute for ever without communicating with its environment. The behaviour of parallel programs formed by simple networks of such processes can sometimes be described by binary relations, that are computed from the processes. Those relations yield rules that show how to find a non-deterministic sequential program "equivalent" to the original parallel program. Two examples illustrate the results presented.


Sequential Process Relational Semantic Parallel Program Proof System Elementary Step 
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. [AFR79]
    K.R. Apt, N. Francez and W.P. de Roever, "Semantics for concurrently communicating finite sequential processes, based on predicate transformers". Univ. of Utrecht Progress Report, 1979.Google Scholar
  2. [AFR80]
    K.R. Apt, N. Francez and W.P. de Roever, "A proof system for communicating sequential processes". TOPLAS 2,3, July 1980, pp. 359–385.Google Scholar
  3. [CoC80]
    P. Cousot and R. Cousot, "Constructing program invariance proof methods". International Workshop on Program Construction, Ed. INRIA, September 1980.Google Scholar
  4. [Dij76]
    E.W. Dijkstra, "A Discipline of Programming". Prentice Hall, 1976.Google Scholar
  5. [Dij77]
    E.W. Dijkstra, "A correctness proof for communicating processes — a small exercise". EWD-607, 1977.Google Scholar
  6. [FHLR79]
    N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever, "Semantics of nondeterminism, concurrency and communication". JCSS 19,3, December 1979, pp. 290–308.Google Scholar
  7. [Gue80]
    P. Guerreiro, "A relational model for non-deterministic programs and predicate transformers", in Fourth International Symposium on Programming, Lecture Notes in Computer Science 83. Springer 1980, pp. 136–146.Google Scholar
  8. [Hoa69]
    C.A.R. Hoare, "An axiomatic basis for computer programming". CACM 12, 10 October 1969, pp. 576–580, 583.Google Scholar
  9. [Hoa78]
    C.A.R. Hoare, "Communicating sequential processes". CACM 21, 8, August 1978, pp. 666–677.Google Scholar
  10. [Hoa79]
    C.A.R. Hoare, "A model for communicating sequential processes". Oxford Univ. Comp. Lab., July 1979.Google Scholar
  11. [LaS76]
    A. van Lamsweerde and M. Sintzoff, "Formal derivation of strongly correct parallel programs". MBLE Research Lab. Report R 338, October 1976, also Acta Informatica 12, fasc. 1, 1979, pp. 1–31.Google Scholar
  12. [Maz74]
    A. Mazurkiewicz, "Proving properties of processes". Algorytmy, XI, no 19, 1974, pp. 5–22.Google Scholar
  13. [MiM79]
    G. Milne and R. Milner, "Concurrent processes and their syntax". JACM, 26, 2, April 1979, pp. 302–321.Google Scholar
  14. [OwG76]
    S. Owicki and D. Gries, "Verifying properties of parallel programs: an axiomatic approach". CACM 19, 5, May 1976, pp. 279–285.Google Scholar
  15. [Roe76]
    W.P. de Roever, "Dijkstra's predicate transformer, non-determinism, recursion and termination", in Math. Found. of Comp. Sci., Lecture Notes in Computer Science 45. Springer, 1976, pp. 472–481.Google Scholar
  16. [Sif79a]
    J. Sifakis, "Le contrôle des systèmes asynchrones: concepts, propriétés, analyse statique". Thèse d'Etat, Univ. of Grenoble, June 1979.Google Scholar
  17. [Sif79b]
    J. Sifakis. "A unified approach for studying the properties of transition systems", RR 179, IMAG, Grenoble, December 1979 (to appear in TCS).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Pedro Guerreiro
    • 1
    • 2
  1. 1.the New University of LisbonPortugal
  2. 2.IMAGGRENOBLE CedexFrance

Personalised recommendations