no. 3
Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
RAIRO. Informatique théorique et applications, Tome 20 (1986) no. 3, pp. 291-318 
@article{ITA_1986__20_3_291_0,
     author = {Darondeau, Ph.},
     title = {Une critique de la notion de test de processus fond\'ee sur la non s\'eparabilit\'e de certaines classes de langages},
     journal = {RAIRO. Informatique th\'eorique et applications},
     pages = {291--318},
     year = {1986},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {3},
     mrnumber = {894716},
     zbl = {0617.68071},
     language = {fr},
     url = {https://www.numdam.org/item/ITA_1986__20_3_291_0/}
}
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. Informatique théorique et applications
PY  - 1986
SP  - 291
EP  - 318
VL  - 20
IS  - 3
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - https://www.numdam.org/item/ITA_1986__20_3_291_0/
LA  - fr
ID  - ITA_1986__20_3_291_0
ER  - 
%0 Journal Article
%A Darondeau, Ph.
%T Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
%J RAIRO. Informatique théorique et applications
%D 1986
%P 291-318
%V 20
%N 3
%I AFCET - Gauthier-Villars
%C Paris
%U https://www.numdam.org/item/ITA_1986__20_3_291_0/
%G fr
%F ITA_1986__20_3_291_0
Darondeau, Ph. Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages. RAIRO. Informatique théorique et applications, Tome 20 (1986) no. 3, pp. 291-318. https://www.numdam.org/item/ITA_1986__20_3_291_0/

1. L. Boasson et M. Nivat, Adherences of Languages, Comp. Syst. Sc., vol. 20, 1980, p. 285-309. | Zbl | MR

2. Ph. Darondeau, About Fair Asynchrony, T.C.S., vol. 37, 1985, p. 305-336. | Zbl | MR

3. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974. | Zbl | MR

4. I. Guessarian, Algebraic Semantics, Springer-Verlag, LNCS, 99, 1981. | Zbl | MR

5. M. Hennessy et R. De Nicola, Testing Equivalences for Processes, Theor. Comp. Sc., vol. 34, 1984, p. 83-134. | Zbl | MR

6. M. Hennessy, Synchronous and Asynchronous Experiments on Processes, Inform. Contr., vol. 59, 1983, p. 36-83. | Zbl | MR

7. M. Hennessy, Modelling Finite Delay Operators, University of Edinburgh, Dept of Computer Science, Internal Report CSR 153-183, 1983.

8. M. Hennessy, An Algebraic Theory of Fair Asynchronous Communicating Processes, ICALP 85, Springer-Verlag LNCS 194, ed. W. Brauer, 1985. | Zbl | MR

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. | Zbl | MR

10. R. Milner, Fully Abstract Models of Typed Lambda-Calculi, Theor. Comp. Sc., vol. 4, 1977, p. 1-23. | Zbl | MR

11. R. Milner, A Calculus of Communicating Systems, Springer-Verlag LNCS, 92, 1980. | Zbl | MR

12. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967. | Zbl | MR

13. A. C. Shaw, Software Descriptions with Flow Expressions, IEEE Trans. Soft. Engineer., vol. 3, 1978, p. 242-254. | Zbl

14. J. E. Stoy, Denotational Semantics, M.I.T. Press, 1977. | MR