TY - GEN
T1 - Concurrent constraint programming with process mobility
AU - Gilbert, David
AU - Palamidessi, Catuscia
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
PY - 2000/1/1
Y1 - 2000/1/1
N2 - We propose an extension of concurrent constraint program- ming 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 mi- gration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural def- inition 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 con- straint 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.
AB - We propose an extension of concurrent constraint program- ming 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 mi- gration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural def- inition 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 con- straint 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.
U2 - 10.1007/3-540-44957-4_31
DO - 10.1007/3-540-44957-4_31
M3 - Conference contribution
AN - SCOPUS:80054935541
T3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
SP - 463
EP - 477
BT - Computational Logic - CL 2000 - 1st International Conference, Proceedings
A2 - Lloyd, John
A2 - Dahl, Veronica
A2 - Furbach, Ulrich
A2 - Kerber, Manfred
A2 - Lau, Kung-Kiu
A2 - Palamidessi, Catuscia
A2 - Pereira, Luís Moniz
A2 - Sagiv, Yehoshua
A2 - Stuckey, Peter J.
PB - Springer Verlag
T2 - 1st International Conference on Computational Logic, CL 2000
Y2 - 24 July 2000 through 28 July 2000
ER -