On parameterization of higher-order processes

References

• R.M. Amadio, L. Leth, and B. Thomsen, From a concurrent lambda-calculus to the pi-calculus, in Proceedings of the 10th International Symposium Fundamentals of Computation Theory (FCT1995), H. Reichel, ed., LNCS, Vol. 965, Springer, Dresden, Germany, 1995, pp. 106–115.
   Google Scholar
• M. Bundgaard, J.C. Godskesen, and T. Hildebrandt, Encoding the pi-calculus in higher-order calculi, Tech. Rep. TR-2008-106, IT University of Copenhagen, 2008.
   Google Scholar
• M. Bundgaard, T. Hildebrandt, and J.C. Godskesen, A CPS encoding of name-passing in higher-order mobile embedded resources, Theoret. Comput. Sci. 356 (2006), pp. 422–439. doi: 10.1016/j.tcs.2006.02.006
   Web of Science ®Google Scholar
• M. Bundgaard, J.C. Godskesen, B. Haagensen, and H. Hüttel, Decidable Fragments of a Higher Order Calculus with Locations, in Proceedings of the 15th Workshop on Expressiveness in Concurrency (EXPRESS 2008), T.T. Hildebrandt and D. Gorla, eds., Electronic Notes in Theoretical Computer Science, Vol. 242(1), Elsevier, Toronto, Canada, 2008, pp. 113–138.
   Google Scholar
• Z. Cao, More on Bisimulations for Higher Order π-Calculus, in Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures (FOSSACS2006), L. Aceto and A. Ingólfsdóttir, eds., LNCS, Vol. 3921, Springer, Vienna, Austria, 2006, pp. 63–78.
   Google Scholar
• L. Cardelli and A.D. Gordon, Mobile ambients, Theoret. Comput. Sci. 240 (2000), pp. 177–213. doi: 10.1016/S0304-3975(99)00231-5
   Web of Science ®Google Scholar
• R. De Nicola, U. Montanari, and F. Vaandrager, Back and forth bisimulations, in Proceedings of Theories of Concurrency: Unification and Extension (CONCUR 1990), J.C.M. Baeten and J. Willem Klop, eds., LNCS, Vol. 458, Springer, Toronto, Canada, 1990, pp. 152–165.
   Google Scholar
• C.D. Giusto, J.A. Pérez, and G. Zavattaro, On the Expressiveness of Forwarding in Higher-Order Communication, in Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (ICTAC 2009), M. Leucker and C. Morgan, eds., Vol. LNCS 5684, Springer, Kuala Lumpur, Malaysia, 2009, pp. 155–169.
   Google Scholar
• D. Gorla, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, in Proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008), F. van Breugel and M. Chechik, eds., LNCS, Vol. 5201, Springer, Toronto, Canada, 2008, pp. 492–507.
   Google Scholar
• D. Gorla, On the relative expressive power of calculi for mobility, Electron. Notes Theoret. Comput. Sci. 249 (2009), pp. 269–286. doi: 10.1016/j.entcs.2009.07.094
   Google Scholar
• M. Hennessy, A distributed Pi-Calculus, Cambridge University Press, New York, NY, 2007, pp. I–XVI, 1–259.
   Google Scholar
• K. Honda and M. Tokoro, An Object Calculus for Asynchronous Communication, in Proceedings of the European Conference on Object-Oriented Programming (ECOOP 1991), P. America, ed., Vol. 512, Springer, Geneva, 1991, pp. 133–147.
   Google Scholar
• A. Jeffrey, J. Rathke, and D. Sangiorgi, Contextual equivalence for higher-order pi-calculus revisited, Logical Methods Comput. Sci. 1(1:4) (2005).
   Google Scholar
• U.D. Lago, S. Martini, and D. Sangiorgi, Light logics and higher-order processes, in Proceedings of Workshop on Expressiveness in Concurrency 2010 (EXPRESS2010), S.B. Fröschle and F.D. Valencia, eds., Vol. 41 EPTCS, Paris, 2010, pp. 46–60.
   Google Scholar
• I. Lanese, J. Perez, D. Sangiorgi, and A. Schmitt, On the Expressiveness and Decidability of Higher-Order Process Calculi, in Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), journal version in [17], IEEE Computer Society, 2008, Pittsburgh, PA, pp. 145–155.
   Google Scholar
• I. Lanese, J.A. Pérez, D. Sangiorgi, and A. Schmitt, On the expressiveness of polyadic and synchronous communication in higher-order process calculi, in Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2010), S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P.G. Spirakis, eds., LNCS, Springer, Bordeaux, France, 2010, pp. 442–453.
   Google Scholar
• I. Lanese, J.A. Pérez, D. Sangiorgi, and A. Schmitt, On the expressiveness and decidability of higher-order process calculi, Inf. Comput. 209(2) (2011), pp. 198–226. doi: 10.1016/j.ic.2010.10.001
   Web of Science ®Google Scholar
• I. Lanese, M. Lienhardt, C.A. Mezzina, A. Schmitt, and J.B. Stefani, Concurrent flexible reversibility, in Proceedings of the 22nd European Symposium on Programming (ESOP 2013), M. Felleisen and P. Gardner, eds., LNCS, Vol. 7792, Springer, Rome, 2013, pp. 370–390.
   Google Scholar
• S. Lenglet, A. Schmitt, and J.B. Stefani, Normal Bisimulations in Calculi with Passivation, in Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009), L. de Alfaro, ed., LNCS, Vol. 5504, Springer, York, UK, 2009, pp. 257–271.
   Google Scholar
• S. Lenglet, A. Schmitt, and J.-B. Stefani, Characterizing contextual equivalence in calculi with passivation, Inf. Comput. 209 (2011), pp. 1390–1433. doi: 10.1016/j.ic.2011.08.002
   Web of Science ®Google Scholar
• R. Meyer, V. Khomenko, and T. Strazny, A practical approach to verification of mobile systems using net unfoldings, in Proceedings of the 29th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (ATPN 2008), K.M. van Hee and R. Valk, eds., LNCS, Vol. 5062, Springer Berlin Heidelberg, Xi'an, China, 2008, pp. 327–347.
   Google Scholar
• R. Milner, Communication and Concurrency, Prentice-Hall, New York, NY, 1989, pp. I–XI, 1–260.
   Google Scholar
• R. Milner, Functions as processes, Math. Struct. Comput. Sci. 2(2) (1992), pp. 119–141. doi: 10.1017/S0960129500001407
   Google Scholar
• R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes (parts i and ii), Inf. Comput. 100(1) (1992), pp. 1–40. doi: 10.1016/0890-5401(92)90008-4
   Web of Science ®Google Scholar
• C. Palamidessi, Comparing the expressive power of the synchronous and the asynchronous pi-calculus, Math. Struct. Comput. Sci. 13 (2003), pp. 685–719. doi: 10.1017/S0960129503004043
   Google Scholar
• L. Parrow, Expressiveness of process algebras, Electron. Notes Theoret. Comput. Sci. 209 (2008), pp. 173–186. doi: 10.1016/j.entcs.2008.04.011
   Google Scholar
• J.A. Perez, Higher-order concurrency: Expressiveness and decidability results, Ph.D. thesis, Department of Computer Science, University of Bologna, 2010.
   Google Scholar
• D. Sangiorgi, Expressing mobility in process algebras: First-order and higher-order paradigms, PhD thesis, University of Edinburgh, 1992.
   Google Scholar
• D. Sangiorgi, From π-calculus to higher-order π-calculus – and back, in Proceedings of Theory and Practice of Software Development (TAPSOFT '93), M.-C. Gaudel and J.-P. Jouannaud, eds., LNCS, Vol. 668, Springer, Orsay, France, 1992, pp. 151–166.
   Google Scholar
• D. Sangiorgi, Bisimulation for higher-order process calculi, Inf. Comput. 131(2) (1996), pp. 141–178. doi: 10.1006/inco.1996.0096
   Web of Science ®Google Scholar
• D. Sangiorgi, Pi-calculus, internal mobility and agent-passing calculi, Theoret. Comput. Sci. 167(1–2) (1996), pp. 235–274. doi: 10.1016/0304-3975(96)00075-8
   Web of Science ®Google Scholar
• D. Sangiorgi, On the bisimulation proof method, Math. Struct. Comput. Sci. 8(6) (1998), pp. 447–479. doi: 10.1017/S0960129598002527
   Google Scholar
• D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, ACM Trans. Program. Languages Syst. 33(1) (2011), p. 5. doi: 10.1145/1889997.1890002
   Web of Science ®Google Scholar
• D. Sangiorgi and R. Milner, The problem of weak bisimulation up-to, in Proceedings of the 3rd International Conference on Concurrency (CONCUR 1992), R. Cleaveland, ed., LNCS, Vol. 630, Springer, New York, NY, 1992, pp. 32–46.
   Google Scholar
• D. Sangiorgi and D. Walker, The Pi-calculus: A Theory of Mobile Processes, Cambridge University Press, New York, NY, 2001, pp. I–XII, 1–580.
   Google Scholar
• B. Thomsen, Calculi for higher-order communicating systems, PhD thesis, Department of Computing, Imperial College, 1990.
   Google Scholar
• B. Thomsen, Plain CHOCS, a second generation calculus for higher-order processes, Acta Inform. 30(1) (1993), pp. 1–59. doi: 10.1007/BF01200262
   Web of Science ®Google Scholar
• J.L. Vivas, Dynamic binding of names in calculi for mobile processes, Ph.D. thesis, KTH-Royal Institute of Technology, 2001.
   Google Scholar
• J.L. Vivas and M. Dam, From higher-order Pi-calculus to Pi-calculus in the presence of static operators, in Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 1998), D. Sangiorgi and R. de Simone, eds., LNCS, Vol. 1466, Springer Verlag, Nice, France, 1998, pp. 115–130.
   Google Scholar
• J.L. Vivas and N. Yoshida, Dynamic channel screening in the higher-order pi-calculus, in Proceedings of Foundations of Wide Area Network Computing (F-WAN, ICALP 2002 Satellite Workshop), Electronic Notes in Theoretical Computer Science, Vol. 66(3), Elsevier, Málaga, Spain, 2002, pp. 170–184. doi:10.1016/S1571-0661(04)80421-3.
   Google Scholar
• X. Xu, Expressing first-order π-calculus in higher-order calculus of communicating systems, J. Comput. Sci. Technol. 24(1) (2009), pp. 122–137. doi: 10.1007/s11390-009-9210-y
   Web of Science ®Google Scholar
• X. Xu, On bisimulation theory in linear higher-order pi-calculus, Trans. Petri Nets Other Models Concurrency III 5800 (2009), pp. 244–274. doi: 10.1007/978-3-642-04856-2_10
   Google Scholar
• X. Xu, Distinguishing and relating higher-order and first-order processes by expressiveness, Acta Inform. 49(7–8) (2012), pp. 445–484. doi: 10.1007/s00236-012-0168-9
   Web of Science ®Google Scholar
• X. Xu, Q. Yin, and H. Long, On the computation power of name parameterization in higher-order processes, in Proceedings of the 8th Interaction and Concurrency Experience (ICE 2015), S. Knight, I. Lanese, A. Lluch-Lafuente, and H. Torres Vieira, eds., EPTCS, Grenoble, France, Vol. 189, 2015, pp. 114–127.
   Google Scholar
• Q. Yin and H. Long, Process passing calculus, revisited, J. Shanghai Jiaotong Univ. (Sci.) 18 (2013), pp. 29–36. doi: 10.1007/s12204-013-1365-6
   Google Scholar