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 ) with built-in recursive functions.
- [AZ84] Parametric channels via label expressions in CCSTheor Comput Sci198433456477421910.1016/0304-3975(84)90102-6Google ScholarCross Ref
- [Bar84] The lambda calculus–its syntax and semantics1984AmsterdamNorth-Holland0551.03007Google Scholar
- [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 Scholar
- [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 Scholar
- [Bor98] On the expressiveness of internal mobility in name-passing calculiTheor Comput Sci19981952205226160931510.1016/S0304-3975(97)00220-XGoogle ScholarDigital Library
- [Cut80] Computability: an introduction to recursive function theory1980CambridgeCambridge University Press0448.03029Google ScholarCross Ref
- [Fu16] Theory of interactionTheor Comput Sci2016611149343350610.1016/j.tcs.2015.07.043Google ScholarDigital Library
- [FL10] On the expressiveness of interactionTheor Comput Sci201041113871451264282510.1016/j.tcs.2009.11.011Google ScholarDigital Library
- [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 Scholar
- [GN16] Gorla D, Nestman U (2016) Full abstraction for expressiveness: history, myths and facts. Math Struct Comput Sci 26(4):639-654Google Scholar
- [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 Scholar
- [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 Scholar
- [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 Scholar
- [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 Scholar
- [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 Scholar
- [LPSS11] On the expressiveness and decidability of higher-order process calculiInf Comput20112092198226279002610.1016/j.ic.2010.10.001Google ScholarDigital Library
- [Mil89] Communication concurrency1989New YorkPrentice Hall0683.68008Google Scholar
- [MPW92] A calculus of mobile processes (parts i and ii)Inf Comput1992100117710.1016/0890-5401(92)90008-4Google ScholarDigital Library
- [MS04] On asynchrony in name-passing calculiMath Struct Comput Sci200414715767209400210.1017/S0960129504004323Google ScholarDigital Library
- [Nes00] What is a good encoding of guarded choices?Inf Comput200056287319175056710.1006/inco.1999.2822Google ScholarDigital Library
- [NP96] Nestmann U, Pierce B (1996) Decoding choice encodings. In: Proceedings of CONCUR 1996, volume 1119 of LNCS. Springer, pp 179–194Google Scholar
- [Pal03] Comparing the expressive power of the synchronous and the asynchronous pi-calculusMath Struct Comput Sci20031368571910.1017/S0960129503004043Google ScholarDigital Library
- [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 Scholar
- [PvG15] Peters K, van Glabbeek RJ (2015) Analysing and comparing encodability criteria for process calculi. Arch Formal ProofsGoogle Scholar
- [San92] Sangiorgi D (1992) Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis, University of EdinburghGoogle Scholar
- [San96] Bisimulation for higher-order process calculiInf Comput19961312141178142859210.1006/inco.1996.0096Google ScholarDigital Library
- [SW01] The pi-calculus: a theory of mobile processes2001CambridgeCambridge Universtity Press0981.68116Google ScholarDigital Library
- [Tho89] Thomsen B (1989) A calculus of higher order communication systems. In: Proceedings of POPL'89, Austin, Texas, United States, pp 143–154Google Scholar
- [Tho93] Plain CHOCS, a second generation calculus for higher-order processesActa Inf1993301159121237510.1007/BF01200262Google Scholar
- [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 Scholar
- [vGW89] van Glabbeek R,WeijlandW(1989) Branching time and abstraction in bisimulation semantics. In: Information processing'89. North-Holland, pp 613–618Google Scholar
- [Xu12] Distinguishing and relating higher-order and first-order processes by expressivenessActa Inf2012497–8445484299393710.1007/s00236-012-0168-9Google ScholarDigital Library
- [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 Scholar
- [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 Scholar
Index Terms
On the Interactive Power of Higher-order Processes Extended with Parameterization
Recommendations
On parameterization of higher-order processes
Parameterization provides an effective way to improve on the expressiveness of process-passing. In this paper, we study two kinds of parameterization: name parameterization and process parameterization. Firstly, we show that process parameterization ...
Interactive TV narratives: Opportunities, progress, and challenges
This article is motivated by the question whether television should do more than simply offer interactive services alongside (and separately from) traditional linear programs, in the context of its dominance being seriously challenged and threatened by ...
Interactive television: new genres, new format, new content
IE '05: Proceedings of the second Australasian conference on Interactive entertainmentThe aim of this paper is to discuss some of the main issues associated with interactive genres, formats and content in the context of interactive television (ITV). First, a set of new forms or categorizations of ITV will be presented. Second, the suite ...
Comments