Concurrent constraint programming with process mobility

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 463-477

  Gilbert, David ^a   Palamidessi, Catuscia ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT CONSTRAINT PROGRAMMING; HIERARCHICAL NETWORK; LABELED TRANSITION SYSTEMS; OPERATIONAL SEMANTICS; PROCESS MIGRATION; PROCESS MOBILITY; SYNCHRONOUS COMMUNICATIONS;

COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING;

SEMANTICS;

EID: 80054935541     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_31     Document Type: Conference Paper

References (18)

1. Luca Aceto, Bard Bloom, and Frits Vaandrager. Turning SOS rules into equations. Information and Computation, 111(1):1-52, 1994.
2. Karen L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Thirteenth Annual IEEE Symposium on Logic in Computer Scienc e, pages 153-164, 1998.
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.
4. Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232-268, 1995.
5. Chiara Bod ei, Pierpaolo Degano, and Corrado Priami. Names of the calculus agents handled locally. Theoretical Computer Science.
6. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. TCS, 114(1):31-61, June 1993.
7. L. Cardelli. Mobile computation. In J. Vitek and C. Tschudin, editors, Mo-bile Object Systems: Towards the Programmable Internet, LNCS 1222, pages 3-6. Springer-Verlag, 1997.
8. Luca Cardelli. A Language with Distributed Scope. Computing Systems, 8(1):27-59, Winter 1995.
9. R. De Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245-267, 1985.
10. C. Fournet,G. Gonthier,JJ. Levy,L. Maranget,D. Remy A Calculus of Mobile Agents In U. Montanari and V. Sassone, editors, Proc. CONCUR'97, LNCS 1119 406-421, Pisa, Italy August 1996. Springer-Verlag.
11. Jan Friso Groote and Frit s Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260, 1992.
12. R. Milner, J. Parrow, and D Walker. A Calculus of Mob ile Processes. Information and Control, 100:1-77, 1992.
13. Jean-Hugues R-ety. Distributed concurrent constraint programming. Fundamenta Informaticae, 34(3):323-346, 1998.
14. Davide Sangiorgi. ExpressingMobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, Edinburgh Uni-versity, 1993.
15. Davide Sangiorgi. Calculus, Internal Mobility and Agent-Passing Calculi. TCS, 167(1,2):235-274, 1996.
16. Vijay Saraswat, Martin Rinard, and Prakash Panangaden. Semantic Foundations of Concurrent Constraint Programming. In POPL 91, pages 333-352. ACM Press, 1991.
17. Bent Thomsen. Plain CHOCS. A second generation calculus for higher order processes. Acta Informatica, 30(1):1-59, 1993.
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.