On the expressiveness and decidability of higher-order process calculi

Information and Computation

Volumn 209, Issue 2, 2011, Pages 198-226

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

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^c INRIA RHÔNE ALPES   (France)

Author keywords

Bisimulation; Expressiveness; Higher order communication; Process calculi

Indexed keywords

ASYNCHRONOUS VERSION; BISIMILARITY; BISIMULATIONS; COMPLETE AXIOMATIZATIONS; CORE CALCULUS; EXPRESSIVENESS; HIGHER ORDER; HIGHER-ORDER PROCESS; PARALLEL COMPOSITION; PROCESS CALCULI; PROCESS OUTPUT; TERMINATION PROBLEMS;

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; PATHOLOGY;

COMMUNICATION;

EID: 78651340367     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.10.001     Document Type: Article

References (50)

1. B. Thomsen A calculus of higher order communicating systems Proceedings of POPL'89 1989 ACM Press 143 154
2. B. Thomsen Plain CHOCS: a second generation calculus for higher order processes Acta Inform. 30 1 1993 1 59
3. D. Sangiorgi, Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms, Ph.D. thesis CST-99-93, University of Edinburgh, Department of Computer Science, 1992.
4. B. Thomsen, Calculi for Higher Order Communicating Systems, Ph.D. thesis, Imperial College, 1990.
5. X. Xu, On the Bisimulation Theory and Axiomatization of Higher-order Process Calculi, Ph.D. thesis, Shanghai Jiao Tong University, 2007.
6. D. Sangiorgi, and D. Walker The π-Calculus: A Theory of Mobile Processes 2001 Cambridge University Press
7. I. Phillips, and M.G. Vigliotti Symmetric electoral systems for ambient calculi Inform. Comput. 206 1 2008 34 72
8. D. Gorla On the relative expressive power of calculi for mobility Electr. Notes Theor. Comput. Sci. 249 2009 269 286
9. M. Minsky Computation: Finite and Infinite Machines 1967 Prentice-Hall
10. A. Jeffrey, and J. Rathke Contextual equivalence for higher-order pi-calculus revisited Log. Methods Comput. Sci. 1 1 2005 1 22
11. Z. Cao, More on bisimulations for higher order pi-calculus, in: Proceedings of FoSSaCS'06, LNCS, vol. 3921, Springer, 2006, pp. 63-78.
12. D. Sangiorgi The lazy lambda calculus in a concurrency scenario Inform. Comput. 111 1 1994 120 153
13. P. Jančar Undecidability of bisimilarity for Petri nets and some related problems Theor. Comput. Sci. 148 2 1995 281 301
14. P. Schnoebelen, Bisimulation and other undecidable equivalences for lossy channel systems, in: Proceedings of TACS'01, LNCS, vol. 2215, Springer, 2001, pp. 385-399.
15. A. Dovier, C. Piazza, and A. Policriti An efficient algorithm for computing bisimulation equivalence Theor. Comput. Sci. 311 1-3 2004 221 256
16. R. Milner, and F. Moller Unique decomposition of processes Theor. Comput. Sci. 107 2 1993 357 363
17. D. Hirschkoff, and D. Pous A distribution law for CCS and a new congruence result for the π-calculus Log. Methods Comput. Sci. 4 2 2008
18. E.L. Post A variant of a recursively unsolvable problem Bull. Am. Math. Soc. 52 1946 264 268
19. M. Sipser Introduction to the Theory of Computation 2005 PWS Publishing Company
20. D. Sangiorgi Bisimulation for higher-order process calculi Inform. Comput. 131 2 1996 141 178
21. D. Sangiorgi π-Calculus, internal mobility and agent-passing calculi Theor. Comput. Sci. 167 2 1996 235 274
22. D. Sangiorgi, N. Kobayashi, and E. Sumii Environmental bisimulations for higher-order languages Proceedings of LICS'07 2007 IEEE Computer Society 293 302
23. R. Milner Communication and Concurrency, International Series in Computer Science 1989 Prentice-Hall
24. D.J. Howe Proving congruence of bisimulation in functional programming languages Inform. Comput. 124 2 1996 103 112
25. M. Baldamus, T. Frauenstein, Congruence Proofs for Weak Bisimulation Equivalences on Higher Order Process Calculi, Technical Report, Berlin University of Technology, 1995.
26. M. Bundgaard, J.C. Godskesen, T. Hildebrandt, Bisimulation Congruences for Homer - A Calculus of Higher Order Mobile Embedded Resources, Technical Report TR-2004-52, IT University of Copenhagen, 2004.
27. J.C. Godskesen, T.T. Hildebrandt, Extending howe's method to early bisimulations for typed mobile embedded resources with local names, in: Proceedings of FSTTCS, Lecture Notes in Computer Science, vol. 3821, Springer, 2005, pp. 140-151.
28. S. Lenglet, A. Schmitt, J.B. Stefani, Normal bisimulations in calculi with passivation, in: Proceedings of FOSSACS, Lecture Notes in Computer Science, vol. 5504, Springer, 2009, pp. 257-271.
29. S. Lenglet, A. Schmitt, J.B. Stefani, Howe's method for calculi with passivation, in: Proceedings of CONCUR, Lecture Notes in Computer Science, vol. 5710, Springer, 2009, pp. 448-462.
30. K. Honda, and N. Yoshida On reduction-based process semantics Theor. Comput. Sci. 151 2 1995 437 486
31. R. Milner, D. Sangiorgi, Barbed bisimulation, in: Proceedings of 19th ICALP, LNCS, vol. 623, Springer-Verlag, 1992, pp. 685-695.
32. R.M. Amadio, I. Castellani, and D. Sangiorgi On bisimulations for the asynchronous pi-calculus Theor. Comput. Sci. 195 2 1998 291 324
33. F. Moller, Axioms for Concurrency, Ph.D. thesis CST-59-89, University of Edinburgh, Department of Computer Science, 1989.
34. N.G. De Bruijn Lambda calculus notation with nameless dummies: A tool for automatic formula manipulation, with application to the Church-Rosser theorem Indagat. Math. 34 1972 381 392
35. A. Kučera, and P. Jančar Equivalence-checking on infinite-state systems: techniques and results TPLP 6 3 2006 227 264
36. S. Christensen, Y. Hirshfeld, and F. Moller Decidable subsets of CCS Comput. J. 37 4 1994 233 242
37. V. Koutavas, M. Hennessy, First-order Reasoning for Higher-order Concurrency, Technical Report, Trinity College Dublin, February 2010.
38. J.L. Vivas, M. Dam, From higher-order pi-calculus to pi-calculus in the presence of static operators, in: Proceedings of CONCUR, Lecture Notes in Computer Science, vol. 1466, Springer, 1998, pp. 115-130.
39. M. Bundgaard, J.C. Godskesen, T. Hildebrandt, On Encoding the Pi-calculus in Higher-order Calculi, Technical Report TR-2008-106, IT University of Copenhagen, 2008.
40. M. Bundgaard, J.C. Godskesen, B. Haagensen, and H. Hüttel Decidable fragments of a higher order calculus with locations Electr. Notes Theor. Comput. Sci. 242 1 2009 113 138
41. J.C. Shepherdson, and H.E. Sturgis Computability of recursive functions J. ACM 10 2 1963 217 255
42. N. Busi, M. Gabbrielli, G. Zavattaro, Replication vs. recursive definitions in channel based calculi, in: Proceedings of ICALP, LNCS, vol. 2719, Springer, 2003, pp. 133-144.
43. N. Busi, M. Gabbrielli, and G. Zavattaro On the expressive power of recursion, replication and iteration in process calculi Math. Struct. Comput. Sci. 19 6 2009 1191 1222
44. N. Busi, and G. Zavattaro On the expressive power of movement and restriction in pure mobile ambients Theor. Comput. Sci. 322 3 2004 477 515
45. M. Nielsen, C. Palamidessi, and F.D. Valencia On the expressive power of temporal concurrent constraint programming languages Proceedings of PPDP 2002 ACM 156 167
46. W. Charatonik, J.M. Talbot, The decidability of model checking mobile ambients, in: Proceedings of CSL, LNCS, vol. 2142, Springer, 2001, pp. 339-354.
47. J.A. Pérez, Higher-Order Concurrency: Expressiveness and Decidability Results, Ph.D. thesis, University of Bologna, 2010.
48. C. Di Giusto, J.A. Pérez, G. Zavattaro, On the expressiveness of forwarding in higher-order communication, in: Proceedings of ICTAC, Lecture Notes in Computer Science, vol. 5684, Springer, 2009, pp. 155-169.
49. I. Lanese, J.A. Pérez, D. Sangiorgi, A. Schmitt, On the expressiveness of polyadic and synchronous communication in higher-order process calculi, in: Proceedings of ICALP'10, Lecture Notes in Computer Science, vol. 6199, Springer, 2010, pp. 442-453.
50. A. Schmitt, J.B. Stefani, The kell calculus: a family of higher-order distributed process calculi, in: Global Computing, Lecture Notes in Computer Science, vol. 3267, Springer, 2005, pp. 146-178.