Bisimulation for Higher-Order Process Calculi

Information and Computation

Volumn 131, Issue 2, 1996, Pages 141-178

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (26)

1. Abramsky, S. (1989), The lazy lambda calculus, in "Research Topics in Functional Programming" (D. Turner, Ed.), pp. 65-116, Addison-Wesley, Reading, MA.
2. Amadio, R., and Dam, M. (1995), Reasoning about higher-order processes, in "Proceedings of TAPSOFT' 95" (P. Mosses, et al., Eds.), Lecture Notes in Computer Science, Vol. 915, pp. 202-216, Springer-Verlag, Berin/New York.
3. [AGR88] Astesiano, E., Giovini, A., and Reggio, G. (1988), Generalized bisimulation in relational specifications, in "STACS '88," Lecture Notes in Computer Science, Vol. 294, pp. 207-226, Springer-Verlag.
4. Astesiano, E., Giovini, A., and Reggio, G. (1992), Observational structures and their logic, Theoret. Comput. Sci. 96, 249-283.
5. Amadio, R. (1993), On the reduction of CHOCS bisimulation to π-calculus bisimulation, in "Proceedings of CONCUR '93" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 112-126, Springer-Verlag.
6. Boudol, G., Castellani, I., Hennessy, M., and Kiehn, A. (1994), A theory of processes with localities, Formal Aspects Comput. 6, 165-200.
7. Boudol, G. (1989), Towards a lambda calculus for concurrent and communicating systems, in "TAPSOFT '89", Lecture Notes in Computer Science, Vol. 351, pp. 149-161.
8. Castellani, I., and Hennesey, M. (1989), Distributed bisimulation, J. Assoc. Comput. Mach. 10(4), 887-911.
9. van Glabbeek, R. J., and Weijland, W. P. (1989), Branching time and abstraction in bisimulation semantics, in "Information Processing '89" (G. X. Ritter, Ed.), pp. 613-618, Elsevier Science.
10. Hennessy, M. (1993), A fully abstract denotational model for higher-order processes, in "Proceedings 8th LICS Conference", IEEE Computer Society Press, pp. 397-408.
11. Hansen, M., and Kleist, J. (1994), "Process Calculi with Asynchronous Communication," Master thesis, Aalborg University (supervisor Hans Hüttel).
12. Milner, R. (1980), A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag.
13. Milner, R. (1993), "The Polyadic π-calculus: A Tutorial," Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., Oct. 1991. Also in "Logic and Algebra of Specification" (F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds.), Springer-Verlag, Berlin/New York.
14. Milner, J., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, (Parts I and II), Inform. Comput. 100, 1-77.
15. Milner, R., and Sangiorgi, D. (1992), Barbed bisimulation, in "19th ICALP" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, pp. 685-695, Springer-Verlag.
16. Park, D. M. (1981), Concurrency on automata and infinite sequences, in "Conference on Theoretical Computer Science" (P. Deussen, Ed.), Lecture Notes in Computer Science, Vol. 104, Springer-Verlag.
17. Pitts, A. M., and Ross, J. R. X. (1996), Process calculus based upon evaluation to committed forms, in "Proceedings of CONCUR '96", Lecture Notes in Computer Science, pp. 18-33, Springer-Verlag.
18. Parrow, J., and Sangiorgi, D. (1995), Algebraic theories for name-passing calculi, Inform. Comput. 120(2), 174-197.
19. Sangiorgi, D. (1992), "Expressing Mobility in Process Algebras: First-Order and Higer-Order Paradigms," Ph.D. thesis CST-99-93, Dept. of Computer Science, University of Edinburgh.
20. Sangiorgi, D. (1996), π-calculus, internal mobility and agent-passing calculli, Theoret. Comput. Sci. 167(2), 235-274.
21. Sangiorgi, D. (1996), A theory of bisimulation for the π-calculus, Acta Inform. 33, 69-97; An extract appeared in Proc. CONCUR '93, Lecture Notes in Computer Science 715, Springer-Verlag.
22. Sangiorgi, D. (1996), A theory of bisimulation for the π-calculus, Acta Inform. 33, 69-97; An extract appeared in Proc. CONCUR '93, Lecture Notes in Computer Science 715, Springer-Verlag.
23. Sewell, P. M. (1995), "The Algebra of Finite State Processes," Ph.D. thesis CST-118-95, Dept. of Computer Science, University of Edinburg.
24. Thomsen, B. (1990), "Calculli for Higher Order Communicating Systems," Ph.D. thesis, Dept. of Computer, Imperial College.
25. Thomsen, B. (1993), Plain CHOCS, a second generation calculus for higher-order processes, Acta Inform. 30, 1-59.
26. Weijland, W. P. (1989), "Synchrony and Asynchrony in Process Algebra," Ph.D. thesis, University of Amsterdam.