Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages

Ph. Darondeau

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

  • Volume: 20, Issue: 3, page 291-318
  • ISSN: 0988-3754

How to cite

top

Darondeau, Ph.. "Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.3 (1986): 291-318. <http://eudml.org/doc/92261>.

@article{Darondeau1986,
author = {Darondeau, Ph.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {separability; classes of infinitary languages; calculus of communicating systems},
language = {fre},
number = {3},
pages = {291-318},
publisher = {EDP-Sciences},
title = {Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages},
url = {http://eudml.org/doc/92261},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Darondeau, Ph.
TI - Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 3
SP - 291
EP - 318
LA - fre
KW - separability; classes of infinitary languages; calculus of communicating systems
UR - http://eudml.org/doc/92261
ER -

References

top
  1. 1. L. BOASSON et M. NIVAT, Adherences of Languages, Comp. Syst. Sc., vol. 20, 1980, p. 285-309. Zbl0471.68052MR584863
  2. 2. Ph. DARONDEAU, About Fair Asynchrony, T.C.S., vol. 37, 1985, p. 305-336. Zbl0607.68016MR824477
  3. 3. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. Zbl0317.94045MR530382
  4. 4. I. GUESSARIAN, Algebraic Semantics, Springer-Verlag, LNCS, 99, 1981. Zbl0474.68010MR617908
  5. 5. M. HENNESSY et R. DE NICOLA, Testing Equivalences for Processes, Theor. Comp. Sc., vol. 34, 1984, p. 83-134. Zbl0985.68518MR774041
  6. 6. M. HENNESSY, Synchronous and Asynchronous Experiments on Processes, Inform. Contr., vol. 59, 1983, p. 36-83. Zbl0544.68028MR760155
  7. 7. M. HENNESSY, Modelling Finite Delay Operators, University of Edinburgh, Dept of Computer Science, Internal Report CSR 153-183, 1983. 
  8. 8. M. HENNESSY, An Algebraic Theory of Fair Asynchronous Communicating Processes, ICALP 85, Springer-Verlag LNCS 194, ed. W. Brauer, 1985. Zbl0566.68022MR819261
  9. 9. T. KIMURA, An Algebraic System for Process Structuring and Interprocess Communication, proc. 8th Ann. ACM Symposium on Theory of Computing, 1976, p. 92-100. Zbl0365.68066MR433948
  10. 10. R. MILNER, Fully Abstract Models of Typed Lambda-Calculi, Theor. Comp. Sc., vol. 4, 1977, p. 1-23. Zbl0386.03006MR498061
  11. 11. R. MILNER, A Calculus of Communicating Systems, Springer-Verlag LNCS, 92, 1980. Zbl0452.68027MR590046
  12. 12. H. ROGERS, Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967. Zbl0183.01401MR224462
  13. 13. A. C. SHAW, Software Descriptions with Flow Expressions, IEEE Trans. Soft. Engineer., vol. 3, 1978, p. 242-254. Zbl0381.68035
  14. 14. J. E. STOY, Denotational Semantics, M.I.T. Press, 1977. MR488969

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.