Trace and testing equivalence on asynchronous processes

Information and Computation

Volumn 172, Issue 2, 2002, Pages 139-164

  Boreale, Michele ^a   De Nicola, Rocco ^a   Pugliese, Rosario ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Asynchronous communications; Process algebras; Semantics

Indexed keywords

ALGEBRA; NETWORK PROTOCOLS; SEMANTICS; THEOREM PROVING;

ASYNCHRONOUS PROCESSES;

ASYNCHRONOUS TRANSFER MODE;

EID: 0037192364     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3080     Document Type: Article

References (36)

1. Amadio, R. M., Castellani, I., and Sangiorgi, D. (1998), On bisimulations for the asynchronous π-calculus, Theoret. Comput. Sci. 195, 291-324.
2. Abadi, M., and Gordon, A. D. (1999), A calculus for cryptographic protocols: The spi calculus, Inform. and Comput. 148, 1-70.
3. Agha, G. A., Mason, I. A., Smith, S. F., and Talcott, C. L. (1997), A foundation for actor computation, J. Funct. Programming 7, 1-72.
4. Bergstra, J., and Klop, J. W. (1984), Process algebra for synchronous communication, Inform. and Control 60, 109-137.
5. de Boer, F. S., Klop, J. W., and Palamidessi, C. (1992), Asynchronous communication in process algebra, in "Proc. of LICS'92," pp. 137-147, IEEE Comput. Soc., Los Alamitos, CA.
6. de Boer, F. S., Kok, J. N., Palamidessi, C., and Rutten, J. J. M. M. (1991), The failure of failures in a paradigm for asynchronous communication, in "Proc. of CONCUR'91" (J. C. M. Baeten and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 111-126, Springer-Verlag, Berlin.
7. Boreale, M., and De Nicola, R. (1995), Testing equivalence for mobile systems, Inform. and Comput. 120, 279-303.
8. Boreale, M., De Nicola, R., and Pugliese, R. (1998), Asynchronous observations of processes, in "Proc. of Foundations of Software Science and Computation Ssructures (FoSSaCS'98)" (M. Nivat, Ed.), Lecture Notes in Computer Science, Vol. 1378, pp. 95-109, Springer-Verlag, Berlin.
9. Boreale, M., De Nicola, R., and Pugliese, R. (1999), A theory of "May" testing for asynchronous languages, in "Proc. of Foundations of Software Science and Computation Ssructures (FoSSaCS'99)" (W. Thomas, Ed.), Lecture Notes in Computer Science, Vol. 1578, pp. 165-179, Springer-Verlag, Berlin.
10. Boreale, M., Fournet, C., and Laneve, C. (1998), Bisimulations in the join calculus, in "Proc. of PROCOMET'98" (D. Gries and W. De Roever, Eds.), Chapman & Hall, London.
11. Boudol, G. (1992), "Asynchrony in the π-calculus (Note)," Rapport de Recherche 1702, INRIA Sophia-Antipolis.
12. Busi, N., Gorrieri, R., and Zavattaro, G.-L. (1998), A process algebraic view of Linda coordination primitives, Theoret. Comput. Sci. 192, 167-199.
13. Castellani, I., and Hennesy, M. (1998), Testing theories for asynchronous languages, in "Proc. of FSTTCS" (V. Arvind and R. Ramanujam, Eds.), Lecture Notes in Computer Science, Vol. 1530, pp. 90-101, Springer-Verlag, Berlin.
14. De Nicola, R., and Hennessy, M. C. B. (1984), Testing equivalence for processes, Theoret. Comput. Sci. 34, 83-133.
15. De Nicola, R., and Pugliese, R. (2000), Linda based applicative and imperative process algebras, Theoret. Comput. Sci. 238, 389-437.
16. De Nicola, R., and Segala, R. (1995), A process algebraic view of I/O automata, Theoret. Comput. Sci. 138, 391-423.
17. Fournet, C., and Gonthier, G. (1996), The reflexive chemical abstract machine and the join calculus, in "Proc. of the ACM Symp. on Principles of Programming Languages," pp. 372-385, Assoc. Comput. Mach., New York.
18. Fournet, C., and Gonthier, G. (1998), A hierarchy of equivalences for asynchronous calculi, in "Proc. of ICALP'98" (k:G. Larsen, S. Skyum, and G. Winskel, Eds.), Lecture Notes in Computer Science, Vol. 1443, pp. 844-855, Springer-Verlag, Berlin.
19. Gelernter, D. (1985), Generative communication in Linda, ACM Trans. Programming Lang. Systems 7, 80-112.
20. Hansen, M., Huttel, H., and Kleist, J. (1995), Bisimulations for asynchronous mobile processes, in "Proc. of the Tiblisi Symposium on Language, Logic, and Computation." Also available as Research Paper HCRC/RP-72, Human Communication Research Centre, University of Edimburgh.
21. Hennessy, M. C. B. (1988), "Algebraic Theory of Processes," MIT Press, Cambridge, MA.
22. Honda, K., and Tokoro, M. (1991), An object calculus for asynchronous communication, in "Proc. of ECOOP'91" (P. America, Ed.), Lecture Notes in Computer Science, Vol. 512, pp. 133-147, Springer-Verlag, Berlin.
23. Honda, K., and Tokoro, M. (1991), On asynchronous communication semantics, in "Object-Based Concurrent Computing" (M. Tokoro, O. Nierstratz, and P. Wegner, Eds.), Lecture Notes in Computer Science, Vol. 612, pp. 21-51, Springer-Verlag, Berlin.
24. Jonsson, B. (1985), A model and a proof system for asynchronous networks, in "Proc. of the 4th ACM Symposium on Principles of Distributed Computing," pp. 49-58, Assoc. Comput. Mach., New York.
25. Jifeng, H., Josephs, M. B., and Hoare, C. A. R. (1990), A theory of synchrony and asynchrony, in "Proc. of the IFIP Working Conf. on Programming Concepts and Methods," pp. 446-465.
26. Lynch, N. A., and Stark, E. W. (1989), A proof of the Kahn principle for input/output automata, Inform. and Comput. 82, 81-92.
27. Lamport, L. (1994), The temporal logic of actions, ACM transactions on Programming Languages and Systems 16, 872-923.
28. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, New York.
29. Milner, R. (1991), "The Polyadic π-calculus: A Tutorial," Technical Report, LFCS Report ECS-LFCS0-91-180, University of Edinburgh.
30. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes (Part I and II), Inform. and Comput. 100, 1-77.
31. Montanari, U., and Pistore, M. (1999), Finite state verification for the asynchronous π-calculus, in "Proc. of TACAS'99" (R. Cleaveland, Ed.), Lecture Notes in Computer Science, Vol. 1579, pp. 255-269, Springer-Verlag, Berlin.
32. Pnueli, A. (1977), The temporal logic of programs, in "Proc. of the 18th IEEE Symposium on Foundations of Computer Science," pp. 46-57, IEEE Comput. Soc., Los Alamitos, CA.
33. Pugliese, R. (1995), A process calculus with asynchronous communications, in "Proc. of the 5th Italian Conference on Theoretical Computer Science" (A. De Santis, Ed.), pp. 295-310, World Scientific, Singapore.
34. Rathke, J. (1998), Resource based models for asynchrony, in "Proc. of Foundations of Software Science and Computation Ssructures (FoSSaCS'98)' (M. Nivat, Ed.), Lecture Notes in Computer Science, Vol. 1378, pp. 273-287, Springer-Verlag, Berlin.
35. Selinger, P. (1997), First-order axioms for asynchrony, in "Proc. of CONCUR'97" (A. Mazurkiewicz and J. Winkowski, Eds.), Lecture Notes in Computer Science, Vol. 1243, pp. 376-390, Springer-Verlag, Berlin.
36. Tretmans, J. (1992), "A Formal Approach to Conformance Testing," Ph.D. thesis, University of Twente.