Sémantique des processus communicants

André Arnold

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1981)

  • Volume: 15, Issue: 2, page 103-139
  • ISSN: 0988-3754

How to cite

top

Arnold, André. "Sémantique des processus communicants." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 15.2 (1981): 103-139. <http://eudml.org/doc/92137>.

@article{Arnold1981,
author = {Arnold, André},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {processes; operational semantics; denotational semantics},
language = {fre},
number = {2},
pages = {103-139},
publisher = {EDP-Sciences},
title = {Sémantique des processus communicants},
url = {http://eudml.org/doc/92137},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Arnold, André
TI - Sémantique des processus communicants
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 2
SP - 103
EP - 139
LA - fre
KW - processes; operational semantics; denotational semantics
UR - http://eudml.org/doc/92137
ER -

References

top
  1. 1. A. ARNOLD et M. NIVAT, Non Deterministic Recursive Program Schemes, in Fundamentals of Computation Theory, Poznan, 1977, M. KARPINSKI, éd., Lecture Notes in Computer Science, n° 56, Springer-Verlag, 1977, p. 12-21. Zbl0361.68020MR502120
  2. 2. A. ARNOLD et M. NIVAT, The Metric Space of Infinite Trees. Algebraic and Topological Properties, Rapport I.R.I.A.-Laboria, n° 323, 1978. 
  3. 3. L. BOASSON et M. NIVAT, Adherences of Languages, J. Comput. Sys. Sci. vol. 20, 1980, p. 285-309. Zbl0471.68052MR584863
  4. 4. S. EILENBERG et D. MONTGOMERY, Fixed Point Theorems for Muhi-Valued Transformations, Amer. J. Math., vol. 68, 1946, p. 214-222. Zbl0060.40203MR16676
  5. 5. G. KAHN, The Semantics of a Simple Language for Parallel Processing, Proc. I.F.I.P. Congress, 1974. Zbl0299.68007
  6. 6. R. M. KELLER, Denotational Models for Parallel Programs with Indeterminate Operators, in [11], p. 337-363. Zbl0373.68030MR537913
  7. 7. R. MILNER, Processus: a Mathematical Model of Computing Agents, in Proc. Logic Colloquium, Bristol, North-Holland Pub. Co., 1973, p. 157-173. Zbl0316.68017MR416095
  8. 8. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 11, 1977, p. 311-327. Zbl0371.68025MR468353
  9. 9. G. D. PLOTKIN, A Powerdomain Construction, S.I.A.M. J. Comp., vol. 5, 1976, p. 452-486. Zbl0355.68015MR445891
  10. 10. E. WIEDMER, Exaktes Rechnen mit reellen Zahlen und anderen unendlichen objekten, Doctoral Dissertation, E.T.H., Zurich, 1977. MR474764
  11. 11. Formal Descriptions of Programming Concepts E. J. NEUHOLD, éd., North-Holland Pub. Co., 1978. Zbl0367.00022MR537899

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.