Skip to main content
SpringerLink
Log in

Concurrent Constraint Programming with Process Mobility

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Included in the following conference series:

Abstract

We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics.

To this purpose, we first investigate a “pure” paradigm for process migration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural definition of the semantics of migration; namely, we want to describe the behaviour of the system, during the transmission of a process, in terms of the behaviour of the components. We achieve this goal by using a labeled transition system where the effects of sending a process, and requesting a process, are modeled by symmetric rules (similar to handshaking-rules for synchronous communication) between the two partner nodes in the network.

Next, we extend our paradigm with the primitives of concurrent constraint programming, and we show how to enrich the semantics to cope with the notions of environment and constraint store.

Finally, we show how the operational semantics can be used to define an interpreter for the basic calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Luca Aceto, Bard Bloom, and Frits Vaandrager. Turning SOS rules into equations. Information and Computation, 111(1):1–52, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. Karen L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Thirteenth Annual IEEE Symposium on Logic in Computer Science, pages 153–164, 1998.

    Google Scholar 

  3. K. Bharat and L. Cardelli. Migratory applications. In J. Vitek and C. Tschudin, editors, Mobile Object Systems: Towards the Programmable Internet, LNCS 1222, pages 131–148. Springer-Verlag, 1997.

    Google Scholar 

  4. Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. Chiara Bodei, Pierpaolo Degano, and Corrado Priami. Names of the π-calculus agents handled locally. Theoretical Computer Science.

    Google Scholar 

  6. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. TCS, 114(1):31–61, June 1993.

    Google Scholar 

  7. L. Cardelli. Mobile computation. In J. Vitek and C. Tschudin, editors, Mobile Object Systems: Towards the Programmable Internet, LNCS 1222, pages 3–6. Springer-Verlag, 1997.

    Google Scholar 

  8. Luca Cardelli. A Language with Distributed Scope. Computing Systems, 8(1):27–59, Winter 1995.

    Google Scholar 

  9. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245–267, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  10. C. Fournet, G. Gonthier, JJ. Levy, L. Maranget, and D. Remy. A Calculus of Mobile Agents. In U. Montanari and V. Sassone, editors, Proc. CONCUR’97, LNCS 1119, pages 406–421, Pisa, Italy, August 1996. Springer-Verlag.

    Google Scholar 

  11. Jan Friso Groote and Frits Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Milner, J. Parrow, and D Walker. A Calculus of Mobile Processes. Information and Control, 100:1–77, 1992.

    MATH  MathSciNet  Google Scholar 

  13. Jean-Hugues Réty. Distributed concurrent constraint programming. Fundamenta Informaticae, 34(3):323–346, 1998.

    MATH  MathSciNet  Google Scholar 

  14. Davide Sangiorgi. ExpressingMobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, Edinburgh University, 1993.

    Google Scholar 

  15. Davide Sangiorgi. π-Calculus, Internal Mobility and Agent-Passing Calculi. TCS, 167(1,2):235–274, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  16. Vijay Saraswat, Martin Rinard, and Prakash Panangaden. Semantic Foundations of Concurrent Constraint Programming. In POPL 91, pages 333–352. ACM Press, 1991.

    Google Scholar 

  17. Bent Thomsen. Plain CHOCS. A second generation calculus for higher order processes. Acta Informatica, 30(1):1–59, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. Peter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, and Ralf Scheidhauer. Mobile objects in distributed Oz. ACM Transactions on Programming Languages and Systems, 19(5):804–851, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, City University, UK

    David Gilbert

  2. Department of Computer Science and Engineering, Penn State University, USA

    Catuscia Palamidessi

Authors
  1. David Gilbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catuscia Palamidessi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gilbert, D., Palamidessi, C. (2000). Concurrent Constraint Programming with Process Mobility. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation