Please use this identifier to cite or link to this item:
|Title:||Concurrent constraint programming with process mobility|
|Citation:||Proceedings of the First International Conference on Computational Logic (CL2000), London, 24-28 July 2000, pp. 463-477.|
|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. 1|
|Appears in Collections:||Computer Science|
Dept of Computer Science Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.