skip to main content
10.1145/1066677.1066778acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

MoCha-pi, an exogenous coordination calculus based on mobile channels

Authors Info & Claims
Published:13 March 2005Publication History

ABSTRACT

In this paper we present MoCha-π, an exogenous coordination calculus that is based on mobile channels. A mobile channel is a coordination primitive that allows anonymous point-to-point communication between processes. Our calculus is an extension of the well-known π-calculus. The novelty of MoCha-π is that its channels are a special kind of process that allow other processes to communicate with each other and impose exogenous coordination through user defined channel types. Also new, is the fact that in our calculus channels are viewed as resources. Processes must compete with each other in order to gain access to a particular channel. This makes the calculus more in line with existing systems. An immediate application of this calculus is the modeling of the MoCha middleware, a distributed system that coordinates components using mobile channels.

References

  1. F. Arbab, Reo: A channel-based coordination model for component composition, Mathematical Structures in Computer Science, Vol. 14, No. 3, pp. 329--366, June 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Cardelli and A. D. Gordon. Mobile ambients, Theoretical Computer Science, 240(1):177--213, June 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Carriero, D. Gelernter. How to Write Parallel Programs: a First Course, MIT press, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. De Nicola, G. L. Ferrari, and R. Pugliese, KLAIM: A kernel language for agents interaction and mobility, IEEE Transactions on Software Engineering, 24(5), pages 315--330, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. L. Ferrari, R. Pugliese and E. Tuosto, Foundational Calculi for Network Aware Programming, Technical Report, Universita' di Firenze, c/o Dipartimento di Sistemi ed Informatica, 2000.Google ScholarGoogle Scholar
  6. J. V. Guillen-Scholten, F. Arbab, F. S. de Boer, M. M. Bonsangue, "A Channel-based Coordination Model for Components". Electr. Notes Theor. Comput. Sci. 68(3), Elsevier Science, 2003.Google ScholarGoogle Scholar
  7. J. V. Guillen-Scholten and F. Arbab, MoCha, easyMoCha and chocoMoCha Manual vl.0, CWI Technical Report, Amsterdam, 2004.Google ScholarGoogle Scholar
  8. M. Hennessy and J. Riely, Resource Access Control in Systems of Mobile Agents, HLCL '98: High-Level Concurrent Languages (Nice, France, September 12, 1998), U. Nestmann and B. C. Pierce, Eds. ENTCS 16.3, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  9. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, London, UK, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sun Microsystems, Java Remote Method Invocation-Distributed Computing for Java, white paper available at java.sun.com/rmi, 2004.Google ScholarGoogle Scholar
  11. R. Milner, Communicating and Mobile Systems: The Pi-Calculus, Cambridge University Press, May 20, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Parrow. An Introduction to the pi-Calculus. In Handbook of Process Algebra, ed. Bergstra, Ponse, Smolka, pages 479--543, Elsevier 2001.Google ScholarGoogle Scholar
  13. P. Wojciechowski, and P. Sewell, Nomadic Pict: Language and Infrastructure Design for Mobile Agents, First International Symposium on Agent Systems and Applications (ASA'99)/(MA'99), Palm Springs, CA, USA, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. MoCha-pi, an exogenous coordination calculus based on mobile channels

      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
      • Published in

        cover image ACM Conferences
        SAC '05: Proceedings of the 2005 ACM symposium on Applied computing
        March 2005
        1814 pages
        ISBN:1581139640
        DOI:10.1145/1066677

        Copyright © 2005 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 March 2005

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader