On the expressiveness and decidability of higher-order process calculi

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 145-155

  Lanese, Ivan ^a   Pérez, Jorge A ^a   Sangiorgi, Davide ^a   Schmitt, Alan ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; MATHEMATICAL TECHNIQUES; PATHOLOGY;

BISIMILARITY;

COMPUTABILITY AND DECIDABILITY;

EID: 51549111645     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.8     Document Type: Conference Paper

References (25)

1. Z. Cao. More on bisimulations for higher order pi-calculus. In Proc. of FoSSaCS'06, volume 3921 of LNCS, pages 63-78. Springer, 2006.
2. S. Christensen, Y. Hirshfeld, and F. Moller. Decidable subsets of CCS. Comput. J., 37(4):233-242, 1994.
3. A. Dovier, C. Piazza, and A. Policriti. An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci., 311(1-3):221-256, 2004.
4. D. Hirschkoff and D. Pous. A distribution law for CCS and a new congruence result for the pi-calculus. In Proc. of FoS-SaCS'07, volume 4423 of LNCS, pages 228-242. Springer, 2007.
5. K. Honda and N. Yoshida. On reduction-based process semantics. Theor. Comput. Sci., 151(2):437-486, 1995.
6. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Inf. Comput., 124(2):103-112, 1996.
7. P. Jančar. Undecidability of bisimilarity for Petri nets and some related problems. Theor. Comput. Sci., 148(2):281-301, 1995.
8. A. Jeffrey and J. Rathke. Contextual equivalence for higherorder pi-calculus revisited. Log. Meth. Comput. Sci., 1(1):1-22, 2005.
9. A. Kučera and P. Jančar. Equivalence-checking on infinitestate systems: Techniques and results. TPLP, 6(3):227-264, 2006.
10. I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi (Extended Version), 2008. http://www.cs.unibo.it/̃perez/hocore.
11. R. Milner and F. Moller. Unique decomposition of processes. Theor. Comput. Sci., 107(2):357-363, 1993.
12. M. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
13. I. Phillips and M. G. Vigliotti. Symmetric electoral systems for ambient calculi. Inf. Comput., 206(1):34-72, 2008.
14. E. L. Post. A variant of a recursively unsolvable problem. Bull. of the Am. Math. Soc, 52:264-268, 1946.
15. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Edinburgh Univ., Dept. of Comp. Sci., 1992.
16. D. Sangiorgi. The lazy lambda calculus in a concurrency scenario. Inf. Comput., 111(1):120-153, 1994.
17. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Inf. Comput., 131(2):141-178, 1996.
18. D. Sangiorgi, N. Kobayashi, and E. Sumii. Environmental bisimulations for higher-order languages. In Proc. of LICS'07, pages 293-302. IEEE Computer Society, 2007.
19. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
20. P. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proc. of TACS'01, volume 2215 of LNCS, pages 385-399. Springer, 2001.
21. M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 2005.
22. B. Thomsen. A calculus of higher order communicating systems. In Proc. of POPL'89, pages 143-154. ACM Press, 1989.
23. B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Imperial College, 1990.
24. B. Thomsen. Plain CHOCS: A second generation calculus for higher order processes. Acta Inf., 30(1):1-59, 1993.
25. X. Xu. On the Bisimulation Theory and Axiomatization of Higher-order Process Calculi. PhD thesis, Shanghai Jiao Tong University, 2007.