skip to main content
research-article
Open Access

On the Interactive Power of Higher-order Processes Extended with Parameterization

Published:01 March 2021Publication History
Skip Abstract Section

Abstract

Abstract

This paper investigates the interactive power of the higher-order pi-calculus extended with parameterization. We study two kinds of parameterization: name parameterization and process parameterization. We show that each of these kinds of parameterization results in an interactively complete model, in the sense that they can express the elementary interactive model (named C) with built-in recursive functions.

References

  1. [AZ84] Astesiano EZucca EParametric channels via label expressions in CCSTheor Comput Sci198433456477421910.1016/0304-3975(84)90102-6Google ScholarGoogle ScholarCross RefCross Ref
  2. [Bar84] Barendregt HPThe lambda calculus–its syntax and semantics1984AmsterdamNorth-Holland0551.03007Google ScholarGoogle Scholar
  3. [BBL+17] Biernacka M, Biernacki D, Lenglet S, Polesiuk P, Pous D, Schmitt A (2017) Fully abstract encodings of λ-calculus in HOcore through abstract machines. In: 32nd Annual ACM/IEEE symposium on logic in computer science, LICS 2017, Reykjavik, Iceland, June 20–23, 2017, pp 1–12Google ScholarGoogle Scholar
  4. [BGHH08] BundgaardM, Godskesen JC, Haagensen B, Huttel H (2008) Decidable fragments of a higher order calculus with locations. In: Proceedings of 15th international workshop on expressiveness in concurrencyGoogle ScholarGoogle Scholar
  5. [Bor98] Boreale MOn the expressiveness of internal mobility in name-passing calculiTheor Comput Sci19981952205226160931510.1016/S0304-3975(97)00220-XGoogle ScholarGoogle ScholarDigital LibraryDigital Library
  6. [Cut80] Cutland NComputability: an introduction to recursive function theory1980CambridgeCambridge University Press0448.03029Google ScholarGoogle ScholarCross RefCross Ref
  7. [Fu16] Fu YTheory of interactionTheor Comput Sci2016611149343350610.1016/j.tcs.2015.07.043Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [FL10] Fu YLu HOn the expressiveness of interactionTheor Comput Sci201041113871451264282510.1016/j.tcs.2009.11.011Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [Gor08] Gorla D (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), volume 5201 of LNCS. Springer, pp 492–507Google ScholarGoogle Scholar
  10. [GN16] Gorla D, Nestman U (2016) Full abstraction for expressiveness: history, myths and facts. Math Struct Comput Sci 26(4):639-654Google ScholarGoogle Scholar
  11. [GPZ09] Giusto CD, Pérez JA, Zavattaro G (2009) On the expressiveness of forwarding in higher-order communication. In: Proceedings of the 6th international colloquium on theoretical aspects of computing (ICTAC '09 ), volume LNCS 5684, pp 155–169Google ScholarGoogle Scholar
  12. [GSV04] Giambiagi P, Schneider G, Valencia F (2004) On the expressiveness of infinite behavior and name scoping in process calculi. In: Proceedings of FOSSACS 2004, volume 2987 of LNCS, pp 226–240Google ScholarGoogle Scholar
  13. [HLS02] Hirschkoff D, Lozes É, Sangiorgi D (2002) Separability, expressiveness, and decidability in the ambient logic. In Proceedings 17th annual IEEE symposium on logic in computer science. IEEE, pp 423–432Google ScholarGoogle Scholar
  14. [LPSS08] Lanese I, Perez JA, Sangiorgi D, Schmitt A (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. Journal version in [LPSS11]Google ScholarGoogle Scholar
  15. [LPSS10] Lanese I, Pérez JA, Sangiorgi D, Schmitt A (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, pp 442–453Google ScholarGoogle Scholar
  16. [LPSS11] Lanese IPérez JASangiorgi DSchmitt AOn the expressiveness and decidability of higher-order process calculiInf Comput20112092198226279002610.1016/j.ic.2010.10.001Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [Mil89] Milner RCommunication concurrency1989New YorkPrentice Hall0683.68008Google ScholarGoogle Scholar
  18. [MPW92] Milner RParrow JWalker DA calculus of mobile processes (parts i and ii)Inf Comput1992100117710.1016/0890-5401(92)90008-4Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [MS04] Merro MSangiorgi DOn asynchrony in name-passing calculiMath Struct Comput Sci200414715767209400210.1017/S0960129504004323Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. [Nes00] Nestmann UWhat is a good encoding of guarded choices?Inf Comput200056287319175056710.1006/inco.1999.2822Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. [NP96] Nestmann U, Pierce B (1996) Decoding choice encodings. In: Proceedings of CONCUR 1996, volume 1119 of LNCS. Springer, pp 179–194Google ScholarGoogle Scholar
  22. [Pal03] Palamidessi CComparing the expressive power of the synchronous and the asynchronous pi-calculusMath Struct Comput Sci20031368571910.1017/S0960129503004043Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [PSVV06] Palamidessi C, Saraswat V, Valencia FD, Victor B (2003) On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In: Proceedings of the 21st annual ieee symposium on logic in computer science (LICS'06), IEEE Computer Society, pp 59–68Google ScholarGoogle Scholar
  24. [PvG15] Peters K, van Glabbeek RJ (2015) Analysing and comparing encodability criteria for process calculi. Arch Formal ProofsGoogle ScholarGoogle Scholar
  25. [San92] Sangiorgi D (1992) Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis, University of EdinburghGoogle ScholarGoogle Scholar
  26. [San96] Sangiorgi DBisimulation for higher-order process calculiInf Comput19961312141178142859210.1006/inco.1996.0096Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [SW01] Sangiorgi DWalker DThe pi-calculus: a theory of mobile processes2001CambridgeCambridge Universtity Press0981.68116Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [Tho89] Thomsen B (1989) A calculus of higher order communication systems. In: Proceedings of POPL'89, Austin, Texas, United States, pp 143–154Google ScholarGoogle Scholar
  29. [Tho93] Thomsen BPlain CHOCS, a second generation calculus for higher-order processesActa Inf1993301159121237510.1007/BF01200262Google ScholarGoogle Scholar
  30. [vG18] van Glabbeek R (2018) A theory of encodings and expressiveness (extended abstract). In: Foundations of software science and computation structures— 21st international conference, FOSSACS 2018, pp 183–202Google ScholarGoogle Scholar
  31. [vGW89] van Glabbeek R,WeijlandW(1989) Branching time and abstraction in bisimulation semantics. In: Information processing'89. North-Holland, pp 613–618Google ScholarGoogle Scholar
  32. [Xu12] Xu XDistinguishing and relating higher-order and first-order processes by expressivenessActa Inf2012497–8445484299393710.1007/s00236-012-0168-9Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [XYL13] Xu X, Yin Q, Long H (2013) On the expressiveness of parameterization in process-passing. In: Proceedings of the 10th international workshop on web services and formal methods, volume 8739 of LNCS. Springer, pp 147–167Google ScholarGoogle Scholar
  34. [XYL15] Xu X, Yin Q, Long H (2015) On the computation power of name parameterization in higher-order processes. In: Proceedings 8th interaction and concurrency experience, ICE 2015, Grenoble, France, 4–5th June 2015, pp 114–127Google ScholarGoogle Scholar

Index Terms

  1. On the Interactive Power of Higher-order Processes Extended with Parameterization
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Formal Aspects of Computing
          Formal Aspects of Computing  Volume 33, Issue 2
          Mar 2021
          144 pages
          ISSN:0934-5043
          EISSN:1433-299X
          Issue’s Table of Contents

          © British Computer Society 2020

          Publisher

          Springer-Verlag

          Berlin, Heidelberg

          Publication History

          • Published: 1 March 2021
          • Accepted: 7 November 2020
          • Received: 27 August 2019
          Published in fac Volume 33, Issue 2

          Qualifiers

          • research-article
        • Article Metrics

          • Downloads (Last 12 months)19
          • Downloads (Last 6 weeks)2

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader