article

On the expressive power of polyadic synchronisation in π-calculus

Authors:

Marco Carbone and

Sergio MaffeisAuthors Info & Claims

Nordic Journal of Computing, Volume 10, Issue 2

Pages 70 - 98

Published: 01 May 2003 Publication History

Abstract

We extend the π-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of π-calculus, we suggest that it permits divergence-free encodings of distributed calculi, and we show that a limited form of polyadic synchronisation can be encoded weakly in π-calculus. After showing that matching cannot be derived in π-calculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation of a language increases its expressive power by means of a separation result in the style of Palamidessi's result for mixed choice.

References

[1]

ABADI, M. AND GORDON, A. D. 1998. A Calculus for Cryptographic Protocols: The Spi Calculus. Research Report 149, Digital Equipment Corporation Systems Research Center.]]

[2]

AMADIO, R., BOUDOL, G., AND LOUSSHAINE, C. 1999. The Receptive Distributed pi-Calculus. In Proceedings of the 5th ECOOP Workshop on Mobile Object Systems (MOS'99). Lisbon, Portugal.]]

[3]

BOUDOL, G. 1992. Asynchrony and the π-Calculus. Rapporte de Recherche 1702, INRIA Sofia-Antipolis.]]

[4]

BOUDOL, G. AND CASTELLANI, I. 1988. Concurrency and Atomicity. Theoretical Computer Science 59, 1-2 (July), 25-84.]]

Digital Library

[5]

CARBONE, M., COCCIA, M., FERRARI, G., AND MAFFEIS, S. 2001. Process Algebra-Guided Design of Java Mobile Network Applications. Extended Abstract in Inf. Proc. of FMTJP'01.]]

[6]

CARBONE, M. AND MAFFEIS, S. 2002. On the Expressive Power of Polyadic Synchronisation in π-calculus. In EXPRESS'02, Volume 68.2 of ENTCS. Elsevier Science Publishers.]]

[7]

CARDELLI, L. AND GORDON, A. D. 2000. Mobile Ambients. Theoretical Computer Science 240, 1, 177-213.]]

Digital Library

[8]

CHANG, E. J. H. AND ROBERTS, R. 1979. An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes. Communications of the ACM 22, 5 (May), 281-283.]]

Digital Library

[9]

CHOTHIA, T. AND STARK, I. 2001. A Distributed π-Calculus with Local Areas of Communication. In Proceedings of HLCL'00, Volume 41.2 of ENTCS. Elsevier Science Publishers.]]

[10]

DE BOER, F. S. AND PALAMIDESSI, C. 1994. Embedding as a Tool for Language Comparison. Information and Computation 108. 1 (Jan.), 128-157.]]

[11]

FERRARI, G. 1997. Atomicity and Concurrency Control in Process Calculi. FUNDINF: Fundamenta Informaticae 29, 4, 341-368.]]

Digital Library

[12]

FOURNET, C. 1998. The Join-Calculus: a Calculus for Distributed Mobile Programming. Ph.D. thesis, Ecole Polytechnique.]]

[13]

FOURNET, C. AND GONTHIER, G. 1996. The Reflexive CHAM and the Join-Calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, 372-385.]]

[14]

FRONTANA, J. L. VIVAS. 2001. Dynamic Binding of Names in Calculi for Mobile Processes. Ph.D. thesis, Department of Microelectronics and Information Technology.]]

[15]

HENNESSY, M. AND RIELY, J. 1998. Resource Access Control in Systems of Mobile Agents. In Proceedings of HLCL '98, Volume 16.3 of ENTCS. Elsevier Science Publishers, 3-17.]]

[16]

HONDA, K. AND TOKORO, M. 1991. An Object Calculus for Asynchronous Communication. In Proceedings of ECOOP, Volume 512 of LNCS. Springer-Verlag, 133-147.]]

[17]

MERRO, M. AND SANGIORGI, D. 1998. On Asynchrony in Name-Passing Calculi, Volume 1443 of LNCS. Springer-Verlag, 856-867.]]

[18]

MILNER, R. 1991. Reduction and Transition Semantics for the π-Calculus with Multi-Names. Unpublished manuscript RM18.]]

[19]

MILNER, R., PARROW, J., AND WALKER, D. 1992. A Calculus of Mobile Processes, I and II. Information and Computation 100, 1 (Sept.), 1-40, 41-77.]]

Digital Library

[20]

NESTMANN, U. 1998. On the Expressive Power of Joint Input. In EXPRESS'98: Expressiveness in Concurrency (Nice, France, September 7, 1998), Volume 16.2 of ENTCS. Elsevier Science Publishers.]]

[21]

NESTMANN, U. 2000. What Is a Good Encoding of Guarded Choice? Information and Computation 156, 287-319.]]

Digital Library

[22]

NESTMANN, U. AND PIERCE, B. C. 2000. Decoding Choice Encodings. Journal of Information and Computation 163, 1-59.]]

Digital Library

[23]

PALAMIDESSI, C. 1997. Comparing the Expressive Power of the Synchronous and the Asynchronous π-Calculus. In Conference record of POPL'97. ACM Press, New York, NY, USA, 256-265.]]

[24]

PALAMIDESSI, C. 2002. Comparing the Expressive Power of the Synchronous and Asynchronous π-calculi: Mathematical Structures in Computer Science. To appear. (Extended version of Palamidessi {1997}), 1-35.]]

[25]

SANGIORGI, D. AND MILNER, R. 1992. Techniques of Weak Bisimulation up to. Revised version of an article appeared in the Proc. CONCUR'92, Volume 630 of LNCS.]]

[26]

SANGIORGI, D. AND WALKER, D. 2001. The π-calculus: a Theory of Mobile Processes. Cambridge University Press.]]

[27]

SEWELL, P., WOJCIECHOWSKI, P., AND PIERCE, B. C. 1999. Location Independence for Mobile Agents: A Two-Level Architecture. In Proceedings of ICCL'98, Volume 1686 of LNCS. Springer-Verlag, 1-31.]]

[28]

VASCONCELOS, V. T. 1994. A Process-Calculus Approach to Typed Concurrent Objects. PhD thesis, Keio University.]]

[29]

VASCONCELOS, V. T. AND TOKORO, M. 1993. A Typing System for a Calculus of Objects. In Object Technologies for Advanced Software, Volume 742 of LNCS. Springer-Verlag, 460-474.]]

Cited By

Abadi MBlanchet BFournet C(2017)The Applied Pi CalculusJournal of the ACM10.1145/312758665:1(1-41)Online publication date: 26-Oct-2017
https://dl.acm.org/doi/10.1145/3127586
Bengtson JParrow JWeber T(2016)Psi-Calculi in IsabelleJournal of Automated Reasoning10.1007/s10817-015-9336-256:1(1-47)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/s10817-015-9336-2
Borgstrom JGutkovas RRodhe IVictor B(2015)The Psi-Calculi WorkbenchACM Transactions on Embedded Computing Systems10.1145/268257014:1(1-25)Online publication date: 21-Jan-2015
https://dl.acm.org/doi/10.1145/2682570
Show More Cited By

Index Terms

On the expressive power of polyadic synchronisation in π-calculus
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
    2. General programming languages
      1. Language types
        Concurrent programming languages
        Distributed programming languages
        Parallel programming languages
2. Theory of computation
  1. Formal languages and automata theory
  2. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Proof search specifications of bisimulation and modal logics for the π-calculus

We specify the operational semantics and bisimulation relations for the finite φ-calculus within a logic that contains the ∇ quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ...
Read More
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

We thoroughly study the behavioural theory of epi, a -calculus extended with polyadic synchronisation. We show that the natural contextual equivalence, barbed congruence, coincides with early bisimilarity, which is thus its co-inductive ...
Read More
A Proof Search Specification of the π-Calculus

We present a meta-logic that contains a new quantifier @? (for encoding ''generic judgments'') and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Nordic Journal of Computing

Nordic Journal of Computing Volume 10, Issue 2

Summer 2003

115 pages

ISSN:1236-6064

Issue’s Table of Contents

Publisher

Publishing Association Nordic Journal of Computing

Finland

Publication History

Published: 01 May 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Abadi MBlanchet BFournet C(2017)The Applied Pi CalculusJournal of the ACM10.1145/312758665:1(1-41)Online publication date: 26-Oct-2017
https://dl.acm.org/doi/10.1145/3127586
Bengtson JParrow JWeber T(2016)Psi-Calculi in IsabelleJournal of Automated Reasoning10.1007/s10817-015-9336-256:1(1-47)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/s10817-015-9336-2
Borgstrom JGutkovas RRodhe IVictor B(2015)The Psi-Calculi WorkbenchACM Transactions on Embedded Computing Systems10.1145/268257014:1(1-25)Online publication date: 21-Jan-2015
https://dl.acm.org/doi/10.1145/2682570
Peters KNestmann UGoltz U(2013)On distributability in process calculiProceedings of the 22nd European conference on Programming Languages and Systems10.1007/978-3-642-37036-6_18(310-329)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37036-6_18
Borgström JGutkovas RParrow JVictor BPohjola J(2013)A Sorted Semantic Framework for Applied Process Calculi Extended Abstract8th International Symposium on Trustworthy Global Computing - Volume 835810.1007/978-3-319-05119-2_7(103-118)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-319-05119-2_7
Pugliese RTiezzi F(2012)A calculus for orchestration of web servicesJournal of Applied Logic10.1016/j.jal.2011.11.00210:1(2-31)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.jal.2011.11.002
Peters KNestmann U(2012)Is it a "good" encoding of mixed choice?Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures10.1007/978-3-642-28729-9_14(210-224)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28729-9_14
Hüttel H(2011)Typed Ψ-calculiProceedings of the 22nd international conference on Concurrency theory10.5555/2040235.2040259(265-279)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2040235.2040259
Martinho JRavara A(2011)Encoding Cryptographic Primitives in a Calculus with Polyadic SynchronisationJournal of Automated Reasoning10.1007/s10817-010-9189-746:3-4(293-323)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1007/s10817-010-9189-7
John MLhoussaine CNiehren JUhrmacher A(2010)The attributed pi-calculus with prioritiesTransactions on Computational Systems Biology XII10.5555/2172311.2172313(13-76)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/2172311.2172313
Show More Cited By

View Options

View options

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents