Towards specification and proof of asynchronous systems

  • B. Gamatie
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)


A communication based language is presented. It allows to specify asynchronous systems of processes. Together with this language, we define an equivalence relation which is a congruence, merging both notions of complexity of accepted languages and of nondeterminism. This equivalence is generated by a preorder relation which allows to provide the processes set with a fully defined (and convergent) minimal element. It is also characterized by an axiom set that we prove to be sound and complete.


Asynchronous systems nondeterminism process interface equivalence and congruence of processes least process 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AUS84.
    AUSTRY D., BOUDOL G. — Algèbre de processus et synchronisation TCS 30,1 (pp. 91–131)-1984-Google Scholar
  2. ARN82.
    ARNOLD A., NIVAT M. — Comportement de processus Colloque AFCET: les mathematiques de l'informatique-1982-Google Scholar
  3. BRO83.
    BROOKES S. D. — A model for communicating sequential processe Phd thesis Oxford University-1983-Google Scholar
  4. DAR82.
    DARONDEAU Ph. — An enlarged definition and complete axiomatization of observational congruence of finite processes LNCS 137-1982-Google Scholar
  5. DAR83.
    DARONDEAU Ph., KOTT L. — On the observational semantics of fair asynchro Proc ICALP 83, LNCS 154-1983-Google Scholar
  6. GAM84.
    GAMATIE B.-Systèmes de processus communicants et interprétation parallèle de languages fonctionnels IR no 320 INRIA-1984-Google Scholar
  7. GAM85.
    GAMATIE B.-Observational congruence of nondeterministic and communicating finite processes in asynchronous systems IR. no 254 IRISA-1985-Google Scholar
  8. GAM85'.
    GAMATIE B. — Towards specicication and proof of asynchronous systems IR. IRISA-1985-Google Scholar
  9. KAH77.
    KAHN G., MC QUEEN D.B. — Coroutines and networks of parallel processes Gilchrist B. (Ed.) Information processing Amsterdam-1977-Google Scholar
  10. KLE71.
    KLEENE S.C. —Introduction to metamathematics (Ed.) De Bruijn N.G., De Groot J., Zaanen A.C.-1971-Google Scholar
  11. HOA78.
    HOARE C.A.R. —Communicating sequential processes CACM 21, vol 8-1978-Google Scholar
  12. HOA81.
    HOARE C.A.R., BROOKES S.D., ROSCOE A.W. — A theory of communicating processes PRG-16 Oxford University-1981-Google Scholar
  13. HEN85.
    HENNESSY M., MILNER R. — Algebraic laws for nondeterminism and concurrency JACM 32, 1-1985-Google Scholar
  14. HEN85.
    HENNESSY M., DE NICOLA R. — Testing equivalence for processes Proc ICALP 83, LNCS 154-1983-Google Scholar
  15. MIL80.
    MILNER R. — A calculus of communicating systems LNCS 92-1980-Google Scholar
  16. PLO81.
    PLOTKIN G. — A structural approach to operational semantics DAIMI FN-19 Comp. Sc. Dept. Aarhus University-1981-Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • B. Gamatie
    • 1
  1. 1.IRISA/INRIA Campus de beaulieuRennes CedexFCE

Personalised recommendations