Basic Observables for Processes

Information and Computation

Volumn 149, Issue 1, 1999, Pages 77-98

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

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

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

References (30)

1. Abramsky, S. (1990), The lazy lambda calculus, in "Research Topics in Functional Programming" (David Turner, Ed.), Addison-Wesley, Reading, MA.
2. Arun-Kumar, S., and Hennessy, M. (1992), An efficiency preorder for processes, Acta Inform. 29(8), 737-760.
3. Boudol, G., Castellani, I., Hennessy, M., and Kiehn, A. (1993), Observing localities, Theoret. Comput. Sci. 114, 31-61.
4. Brinksma, E., Rensink, A., and Vogler, W. (1995), Fair testing, "Proceedings of CONCUR'95" (I. Lee and S. A. Smolka, Eds.), Lecture Notes in Computer Science, Vol. 962, pp. 313-327, Springer-Verlag, Berlin/New York.
5. Brinksma, E., Rensink, A., and Vogler, W. (1996), Applications of fair testing, in "Formal Description Techniques IX, Theory, Applications and Tools" (R. Gotzhein and J. Bredereke, Eds.), IFIP, Chapman & Hall, London/New York.
6. Brookes, S. D., Hoare, C. A. R., and Roscoe, A. W. (1984), A theory of communicating sequential processes, J. Assoc. Comput. Mach. 31(3), 560-599.
7. Castellani, I., and Hennessy, M. (1989), Distributed bisimulations, J. Assoc. Comput. Mach. 10, 887-911.
8. De Nicola, R. (1987), Extensional equivalences for transition systems, Acta Inform. 24, 211-237.
9. De Nicola, R., and Hennessy, M. (1984), Testing equivalence for processes, Theoret. Comput. Sci. 34, 83-133.
10. De Nicola, R., and Hennessy, M. (1987), CCS without τ's, "Proceedings of TAPSOFT'87" (H. Ehrig et al., Eds.), Lecture Notes in Computer Science, Vol. 249, pp. 138-152, Springer-Verlag, Berlin/New York.
11. Ferreira, W. (1996), "Semantic Theories for Concurrent ML," Ph.D. Thesis, University of Sussex.
12. Fournet, C., Gonthier, G., Lévy, J.-L., Maranget, L., and Rémy, D. (1966), A calculus of mobile agents, "Proceedings of CONCUR'96" (U. Montanari and V. Sassone, Eds.), Lecture Notes in Computer Science, Vol. 1119, pp. 406-421, Springer-Verlag, Berlin/New York.
13. Hennessy, M. (1988), "Algebraic Theory of Processes," MIT Press, Cambridge, MA .
14. Hennessy, M. (1989), Observing processes, in "Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" (J. de Bakker et al., Eds.), Lecture Notes in Computer Science, Vol. 354, Springer-Verlag, Berlin/New York.
15. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall, Englewood Cliffs, NJ.
16. Laneve, C. (1996), "May and Must Testing in the Join-Calculus," Technical Report UBLCS-96-4, Università di Bologna, Dept. of Computer Science, Bologna.
17. Main, M. G. (1987), Trace, failure and testing equivalences for communicating processes, Int. J. Parallel Progr. 16(5), 383-400.
18. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
19. Milner, R., and Sangiorgi, D. (1992), Barbed bisimulation, "Proceedings of ICALP'92" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin/New York.
20. Morris, J.-H. (1968), "Lambda Calculus Models of Programming Languages," Ph.D. Thesis, MIT, Cambridge, MA.
21. Natarajan, V., and Cleaveland, R. (1995), Divergence and fair testing, "Proceedings of ICALP'95" (Z. F́'uĺ'op and F. Gécseg, Eds.), Lecture Notes in Computer Science, Vol. 944, pp. 648-659, Springer-Verlag, Berlin/New York.
22. Natarajan, V., and Cleaveland, R. (1995), An algebraic theory of process efficiency, "Proceedings of LICS'96" (Los Alamitos, California), pp. 63-72, IEEE Comput. Soc. Press, New York.
23. Nicollin, X., and Sifakis, J. (1991), An overview and synthesis on timed process algebras, "Proceedings of CAV'91" (K. G. Larsen and A. Shou, Eds.), Lecture Notes in Computer Science, Vol. 575, pp. 376-398, Springer-Verlag, Berlin/New York.
24. Olderog, E.-R. (1991), "Nets, Terms and Formulas," Cambridge University Press, Cambridge, UK.
25. Olderog, E.-R., and Hoare, C. A. R. (1986), Specification-oriented semantics for communicating processes, Acta Inform. 23, 9-66.
26. Ong, C.-H.L. (1995), Correspondence between operational and denotational semantics: the full abstraction problem for PCF, "Handbook of Logic in Computer Science" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 4, Oxford Science, Oxford.
27. Reppy, J. H. (1993), Concurrent ML: Design, application and semantics, "Proceedings of Functional Programming, Concurrency, Simulation and Automata Reasoning" (P. E. Lauer, Ed.), Lecture Notes in Computer Science, Vol. 693, pp. 165-198, Springer-Verlag, Berlin/New York.
28. Vogler, W. (1989), Failures semantics and deadlocking of modular Petri nets, Acta Inform. 26, 333-348.
29. Wang, Y. (1990), Real-time behaviour of asynchronous agents, "Proceedings of CONCUR'90" (J. C. M. Baeten and J. W. Klop, Eds.), Lecture Notes in Computer Science, Vol. 458, pp. 502-520, Springer-Verlag, Berlin/New York.
30. Wang, Y. (1991), CCS + Time = an interleaving model for real time systems, "Proceedings of ICALP'91" (J. Leach Albert et al., Eds.), Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, Berlin/New York.