Bisimulation Can't Be Traced

Journal of the ACM (JACM)

Volumn 42, Issue 1, 1995, Pages 232-268

  Bloom, Bard ^a   Istrail, Sorin ^b   Meyer, Albert R ^c  

^a Department of Obstetrics Gynecology   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

bisimulation; CCS; process algebra; structural operational semantics

Indexed keywords

BISIMULATION; CONCURRENT PROGRAMMING STRUCTURES; PROGRAMMING LANGUAGE SEMANTICS; STRUCTURAL OPERATIONAL SEMANTICS;

ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; FORMAL LOGIC; MATHEMATICAL MODELS;

COMPUTER SIMULATION;

EID: 0029229420     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/200836.200876     Document Type: Article

References (46)

1. ABRAMSKY, S. 1987. Observation equivalence as a testing equivalence. Theoret. Comput. Sci. 53, 2/3, 225-241.
2. ABRAMSKY, S. 1989. Tutorial on concurrency. Slides of an invited lecture given at the 16th Annual ACM Symposium on Principles of Programming Languages, (Austin, Tex., Jan. 11-13).
3. ABRAMSKY, S. 1991. A domain equation for bisimulation. Inf. Comput. 92, 161-218. ABRAMSKY, S., AND VICKERS, S. 1989. Observational logic and process semantics. In preparation.
4. AUSTRY, D., AND BOUDOL, G. 1984. Algèbre de processus et synchronisation. Theoret. Comput. Sci. 30, 1, 91-131.
5. BAETEN, J. C. M. 1990. Applications of process algebra. In Cambridge Tracts in Theoretical Computer Science, vol. 17. Cambridge University Press, New York, NY.
6. BAETEN, J. C. M., AND VAN GLABBEEK, R. 1987. Another look at abstraction in process algebra. In Automata, Languages, and Programming: 14th International Colloqium, T. Ottmann, ed. Lecture Notes in Computer Science, vol. 267. Springer-Verlag, New York. July.
7. BAETEN, J. C. M., AND WEIJLAND, W. P. 1990. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press.
8. BARENDREGT, H. P. 1981/1984. The Lambda Calculus: Its Syntax and Semantics. In Studies in Logic, vol. 103. North-Holland, Amsterdam, The Netherlands.
9. BERGSTRA, J. A. AND KLOP, J. W. 1984. Process algebra for synchronous communication. Inf. Comput. 60, 1-3, 109-137.
10. BERGSTRA, J. A., AND KLOP, J. W. 1985. Algebra of communicating processes with abstraction. Theoret. Comput. Sci. 37, 1, 77-121.
11. BLOOM, B. 1987. Computational complexity of bisimulation in SCCS. Unpublished.
12. BLOOM, B. 1988. Can LCF be topped?: Flat lattice models of the simply typed ?-calculus. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science. Computer Society Press, pp. 282-295.
13. BLOOM, B. 1984. Ready simulation, bisimulation, and the semantics of CCS-like languages. Ph.D dissertation. Massachusetts Institute of Technology, Cambridge, Mass., Aug.
14. BLOOM, B. 1993. Structural operational semantics for weak bisimulations. Technical Report TR 93-1373, Cornell Univ., Ithaca, N.Y. (Aug.) (Theoret. Comput. Sci., to appear).
15. BLOOM, B., ISTRAIL, S., AND MEYER, A. R. 1988. Bisimulation can't be traced (preliminary report). In Conference Record of the 15th Annual ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan 13-15) ACM, New York, pp. 229-239. (Also appears as MIT Tech. Memo MIT/LCS/TM-345. MIT, Cambridge, Mass.)
16. BLOOM, B., ISTRAIL, S., AND MEYER, A. R. 1990. Bisimulation can't be traced. Tech. Rep. TR 90-1150. Cornell Univ., Ithaca, N.Y., (Aug.).
17. BLOOM, B., AND MEYER, A. R. 1992. Experimenting with process equivalence. Theoret. Comput. Sci. 102, 1 (Nov.), 223-237.
18. BLOOM, B., AND PAIGE, R. 1992. Computing ready simulations efficiently. In Proceedings of the North American Process Algebra Workshop '92. Workshops in Computer Science, Springer-Verlag, New York, pp. 119-134.
19. BROOKES, S. 1983. A semantics and proof system for communicating processes. Tech. Rep. CMU-CS-83-134. Carnegie-Mellon University, Pittsburgh, Pa.
20. BROOKES, S. D., HOARE, C. A. R., AND ROSCOE, A. W. 1984. A theory of communicating sequential processes. J. ACM 31, 3 (July), 560-599.
21. CASTELLANO, L., MICHELIS, G. D., AND POMELLO, L. 1987. Concurrency vs interleaving: An instructive example. Bull. Europ. Ass. Theoret. Comput. Sci. 31 (Feb.) 12-15.
22. DE NICOLA, R., AND HENNESSY, M. C. B. 1984. Testing equivalences for processes. Theoret. Comput. Sci. 34, 2/3, 83-133.
23. DE SIMONE, R. 1985. Higher-level synchronising devices in MEIJE-SCCS. Theoret. Comput. Sci. 37, 3, 245-267.
24. GROOTE, J. F., AND VAANDRAGER, F. 1989. Structured operational semantics and bisimulation as a congruence (extended abstract). In Automata, Languages and Programming: 16th International Colloquium, G. Ausiello, M. Dezani-Ciancaglini, and S. R. D. Rocca, eds. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, New York, pp. 423-438.
25. HENNESSY, M. AND MILNER, R. 1985. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 1 (Jan.), 137-161.
26. HOARE, C. A. R. 1978. Communicating sequential processes. Commun. ACM, 21, 8 (Aug.), 666-677.
27. HOARE, C. A. R. 1985. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall.
28. LARSEN, K., AND SKOU, A. 1988. Bisimulation through probabilistic testing (preliminary report). Tech. Rep. R 88-16. Institut for Elektroniske Systemer, Aalborg Universitetscenter, Aalborg, Denmark, June.
29. LARSEN, K. G., AND SKOU, A. 1991. Bisimulation through probabilistic testing. Inf. Comput. 94, 1 (Sept.), 1-28.
30. MEYER, A. R. 1988. Semantical paradigms: Notes for an invited lecture, with two appendices by Stavros Cosmadakis. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, Computer Society Press, Washington, D.C., pp. 236-253.
31. MILNER, R. A Calculus of Communicating Systems. In Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York.
32. MILNER, 1981. A modal characterisation of observable machine-behaviour. In CAAP '81: Trees in Algebra and Programming, 6th Colloquium, E. Astesiano and C. Böhm, eds. Lecture Notes in Computer Science, vol. 112. Springer-Verlag, New York, pp. 25-34.
33. MILNER, R. 1983. Calculi for synchrony and asynchrony. Theoret. Comput. Sci., 25, 3, 267-310.
34. MILNER, R. 1984. Lectures on a calculus for communicating systems. In Seminar on Concurrency: CMU, July 9-11, 1984, S. D. Brookes, A. W. Roscoe, and G. Winskel, eds. Lecture Notes in Computer Science, vol. 197. Springer-Verlag, New York, pp. 197-220.
35. MILNER, R. 1989. Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, New York.
36. MILNER, R. 1990. Functions as processes. In Automata, Languages and Programming: 17th International Colloqium, M. Paterson, ed., Lecture Notes in Computer Science, vol. 443. Springer-Verlag, New York, pp. 167-180.
37. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes I and II. Inf. Comput. 100, 1-40 and 41-77.
38. OLDEROG, E.-R., AND HOARE, C. A. R. 1986. Specification-oriented semantics for communicating processes. Acta Inf. 23, 1, 9-66.
39. PARROW, J. 1987. Verifying a CSMA/CD-protocol with CCS. Tech. Rep. ECS-LFCS-87-18, Laboratory for Foundations of Computer Science. University of Edinburgh, Scotland, Jan.
40. PLOTKIN, G. D. 1977. LCF considered as a programming language. Theoret. Comput. Sci. 5, 3, 223-255.
41. PLOTKIN, G. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19. Computer Science Department, Aarhus Univ., Denmark.
42. PLOTKIN, G., AND PRATT, V. 1988. Teams can see pomsets. Manuscript available as pub/pp.tex by anonymous FTP from Boole.Stanford.EDU, Oct.
43. PNUELI, A. 1985. Linear and branching structures in the semantics and logics of reactive systems. In Automata, Languages and Programming: 12th Colloquium, W. Brauer, ed. Lecture Notes in Computer Science, vol. 194. Springer-Verlag, New York, pp. 15-32.
44. ULIDOWSKI, I. 1992. Equivalences on observable processes. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science IEEE, New York, pp. 148-161.
45. VAN GLABBEEK, R. 1993. The linear time-branching time spectrum II: The semantics of sequential processes with silent moves. In Proceedings of CONCUR '93. E. Best, ed. Lecture Notes in Computer Science, vol. 715. Springer-Verlag, New York, pp. 66-81 (paper also available by anonymous ftp from Boole.stanford.edu.).
46. WEBER, S., BLOOM, B., AND BROWN, G. 1992. Compiling joy to silicon: A verified silicon compilation scheme. In Proceedings of the Advanced Research in VLSI and Parallel Systems Conference, T. Knight and J. Savage, eds. p. 79-98.