References

  1. F. Bonchi, D. Petrisan, D. Pous & J. Rot (2015): Lax Bialgebras and Up-To Techniques for Weak Bisimulations. In: Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015), Leibniz International Proceedings in Informatics (LIPICS) 42, pp. 240–253, doi:10.4230/LIPIcs.CONCUR.2015.240.
  2. M. Bundgaard, T. Hildebrandt & J. C. Godskesen (2006): A CPS Encoding of Name-passing in Higher-order Mobile Embedded Resources. Theoretical Computer Science 356(3), pp. 422–439, doi:10.1016/j.tcs.2006.02.006.
  3. U. H. Engberg & M. Nielsen (1986): A Calculus of Communicating Systems with Label Passing. Technical Report DAIMI PB-208. Computer Science Department, University of Aarhus. Available at http://www.daimi.au.dk/PB/208/.
  4. U. H. Engberg & M. Nielsen (2000): A Calculus of Communicating Systems with Label Passing - Ten Years After. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner. MIT Press Cambridge, pp. 599–622.
  5. Yuxi Fu (2005): On Quasi Open Bisimulation. Theoretical Computer Science 338(1-3), pp. 96–126, doi:10.1016/j.tcs.2004.10.041.
  6. Yuxi Fu (2015): Theory of interaction. Theoretical Computer Science, doi:10.1016/j.tcs.2015.07.043.
  7. Yuxi Fu & Hao Lu (2010): On the Expressiveness of Interaction. Theoretical Computer Science 411, pp. 1387–1451, doi:10.1016/j.tcs.2009.11.011.
  8. D. Gorla (2008): Towards a Unified Approach to Encodability and Separation Results for Process Calculi. In: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008), LNCS 5201. Springer Verlag, pp. 492–507, doi:10.1007/978-3-540-85361-9_38.
  9. D. Gorla & U. Nestmann (2016): Full Abstraction for Expressiveness: History, Myths and Facts. Mathematical Structures in Computer Scinece 26, pp. 639–654, doi:10.1017/S0960129514000279.
  10. Daniele Gorla (2009): On the Relative Expressive Power of Calculi for Mobility. Electronic Notes in Theoretical Computer Science 249, pp. 269–286, doi:10.1016/j.entcs.2009.07.094.
  11. D. Kouzapas, J. A. Pérez & Nobuko Yoshida (2016): On the Relative Expressiveness of Higher-Order Session Processes. In: Proceedings of the 25th European Symposium on Programming (ESOP 2016), LNCS, pp. 446–475, doi:10.1007/978-3-662-49498-1_18.
  12. I. Lanese, J. A. Pérez, D. Sangiorgi & A. Schmitt (2010): 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), LNCS. Springer Verlag, pp. 442–453, doi:10.1007/978-3-642-14162-1_37.
  13. I. Lanese, J.A. Pérez, D. Sangiorgi & A. Schmitt (2008): 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). IEEE Computer Society, pp. 145–155, doi:10.1109/LICS.2008.8. Journal version in LPSS10a.
  14. S. Lenglet, A. Schmitt & J.-B. Stefani (2009): Normal Bisimulations in Calculi with Passivation. In: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009), LNCS 5504. Springer Verlag, pp. 257–271, doi:10.1007/978-3-642-00596-1_19.
  15. S. Lenglet, A. Schmitt & J.-B. Stefani (2011): Characterizing Contextual Equivalence in Calculi with Passivation. Information and Computation 209, pp. 1390–1433, doi:10.1016/j.ic.2011.08.002.
  16. R. Milner (1989): Communication and Concurrency. Prentice Hall.
  17. R. Milner, J. Parrow & D. Walker (1992): A Calculus of Mobile Processes (Parts I and II). Information and Computation 100(1), pp. 1–77, doi:10.1016/0890-5401(92)90008-4, 10.1016/0890-5401(92)90009-5.
  18. J. Parrow (2016): General Conditions for Full Abstraction. Mathematical Structures in Computer Science 26, pp. 655–657, doi:10.1017/s0960129514000280.
  19. D. Sangiorgi (1992): Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. Phd thesis. University of Edinburgh.
  20. D. Sangiorgi (1996): Bisimulation for Higher-order Process Calculi. Information and Computation 131(2), pp. 141–178, doi:10.1006/inco.1996.0096.
  21. D. Sangiorgi (1998): On the Bisimulation Proof Method. Mathematical Structures in Computer Science 8(6), pp. 447–479, doi:10.1017/S0960129598002527.
  22. D. Sangiorgi & D. Walker (2001): The Pi-calculus: a Theory of Mobile Processes. Cambridge Universtity Press.
  23. B. Thomsen (1990): Calculi for Higher Order Communicating Systems. Phd thesis. Department of Computing, Imperial College.
  24. B. Thomsen (1993): Plain CHOCS, a Second Generation Calculus for Higher-Order Processes. Acta Informatica 30(1), pp. 1–59, doi:10.1007/BF01200262.
  25. Xian Xu (2012): Distinguishing and Relating Higher-order and First-order Processes by Expressiveness. Acta Informatica 49(7-8), pp. 445–484, doi:10.1007/s00236-012-0168-9.
  26. Xian Xu (2013): On Context Bisimulation for Parameterized Higher-order Processes. In: Proceedings of the 6th Interaction and Concurrency Experience (ICE 2013), EPTCS 131, pp. 37–51, doi:10.4204/EPTCS.131.5.
  27. Xian Xu (2016): Higher-order Processes with Parameterization over Names and Processes (with appendices). Available at http://basics.sjtu.edu.cn/~xuxian/express2016withappendices.pdf.
  28. Xian Xu, Qiang Yin & Huan Long (2015): On the Computation Power of Name Parameterization in Higher-order Processes. In: Proceedings of 8th Interaction and Concurrency Experience (ICE 2015), EPTCS 189, pp. 114–127, doi:10.4204/EPTCS.189.10.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org