Abstract
Some applications of higher-order processes require better control of communication capabilities than what is provided by the π-calculus primitives. In particular we have found the dynamic restriction operator of CHOCS, here called blocking, useful. We investigate the consequences of adding static operators such as blocking to the first-and higher-order π-calculus. In the presence of the blocking operator (and static operators in general) the higher-order reduction of Sangiorgi, used to demonstrate the reducibility of higher-order communication features to first-order ones, breaks down. We show, as our main result, that the higher-order reduction can be regained, using an approach by which higher-order communications are replaced, roughly, by the transmission and dynamic interpretation of syntax trees. However, the reduction is very indirect, and not usable in practice. This throws new light on the position that higher-order features in the π-calculus are superfluous and not needed in practice.
Supported by the Swedish National Board for Technical and Industrial Development (NUTEK) under grant no. 94-06164.
Supported by a Swedish Foundation for Strategic Research Junior Individual Grant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232–268, January 1995.
M. Dam. Proving trust in systems of second-order processes. In Proc. HICSS'31 IEEE Comp. Soc., VII:255–264, 1998. Available electronically at ftp://ftp.sics.se/pub/fdt/mfd/ptssop.ps.Z.
Robin Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, September 1992.
Robin Milner and Davide Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. of 19th International Colloquium on Automata, Languages and Programming (ICALP '92), volume 623 of lncs, pages 685–695. sv, 1992.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. pages 179–194. Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics, 1997.
D. Sangiorgi and R. Milner. The problem of “weak bisimulation up to”. Lecture Notes in Computer Science, 630:32–--, 1992.
Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, LFCS, University of Edinburgh, 1993.
Bent Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Imperial College, University of London, September 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vivas, JL., Dam, M. (1998). From higher-order π-calculus to π-calculus in the presence of static operators. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055619
Download citation
DOI: https://doi.org/10.1007/BFb0055619
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive