Bonsangue M. M., Arbab F., de Bakker J. W., Rutten J. J. M. M., Scutell A., Zavattaro G. (2000); A Transition System Semantics for the Control-Driven Coordination Language MANIFOLD. Theor. Comp. Sci. 240, 3-47.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....for the components indeed behave and communicate suciently consistent. Paradigm s STD basis together with its clean operational semantics make formal reasoning about the programs and their interaction relatively straightforward, a goal also underlying motivating the operational semantics of [5] for Manifold. The paper has the following structure. After Section 1, Section 2 presents Paradigm based on STDs, and introduces the various notions by means of a small example a producer consumer variant. The operational semantics is discussed in Section 3, exploiting the running on example. It ....

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240:3-47, 2000.

....for the components indeed behave and communicate suciently consistent. Paradigm s STD basis together with its clean operational semantics make formal reasoning about the programs and their interaction relatively straightforward, a goal also underlying motivating the operational semantics of [5] for Manifold. The paper has the following structure. After Section 1, Section 2 presents Paradigm based on STDs, and introduces the various notions by means of a small example a producer consumer variant. The operational semantics is discussed in Section 3, exploiting the running on example. It ....

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240:3-47, 2000.

No context found.

Bonsangue M. M., Arbab F., de Bakker J. W., Rutten J. J. M. M., Scutell A., Zavattaro G. (2000); A Transition System Semantics for the Control-Driven Coordination Language MANIFOLD. Theor. Comp. Sci. 240, 3-47.

....the burden. We abstract away from the ability of workers to continue with internal actions on their own; thus our model falls short of capturing everything about IWIM or any speci c implementation of the IWIM idea, such as is to be found in the formal speci cation of the MANIFOLD language [4,10]. In Section 4 we indicate brie y how our elementary IWIM systems model can be extended to model processes that are able to display both worker and manager traits, and we discuss how recon gurations can be implemented asynchronously. We raise the issue of the algebraic combination of these IWIM ....

Bonsangue M. M., Arbab F., de Bakker J. W., Rutten J. J. M. M., Scutella, Zavattaro G. \A Transition System Semantics for the Control-Driven Coordination Language MANIFOLD." Theor. Comp. Sci. 240, 3-47, 2000. 14

....of view of coordination. Dataflow models, Kahn networks [12] and Petri nets can be viewed as specialized channel based models that incorporate certain basic constructs for primitive coordination. IWIM [1, 13] is an example of a more elaborate coordination model based on channels, and Manifold [2, 8] is an incarnation of IWIM as a real coordination programming language that supports dynamic reconfiguration of Kahn network topologies. A common strand running through these models is a notion that is called exogenous coordination in IWIM [3] This is the concept of coordination from outside ....

....of channels that can be used in Pew makes it easy to construct other coordination models. For instance, we consider how Manifold and a Linda like shared tuple space model can be modeled in Pew in the following two subsections. 14.1 Manifold The constructs in the coordination language Manifold [1, 8] can be described in Pew in a straight forward manner. A port in Manifold is simply a synchronous channel. Following the Manifold s rules of access, the source ends of input ports and the sink ends of output ports are publicized for access from the outside of their owner processes, while their ....

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the control-driven coordination language manifold. Theoretical Computer Science, 240:3-47, 2000.

....# Query the set of all closed external expressions, and by Stat the set of statements, with its typical element S , which describe the behavior of objects. 3. A transition system semantics We now define a formal operational semantics for programs in the coordination language ##. Following [8] we proceed in two steps: first we define a labeled local transition system for the description of the behavior of an object in isolation, and then we define an unlabeled global transition system which describes the behavior of a dynamic network of objects. In the local transition system, the ....

....to the creator object. The communication mechanism of the ## language is inspired by that of the # calculus [22] uses primitives for process interaction similar to those of CSP [17] and it is implemented using a notion of channel similar to that used by the coordination language Manifold [5, 8]. The # calculus is a 6. Conclusion and related work 13 process calculus for communicating and mobile systems which abstract from the notion of state by considering atoms as symbols, whereas the atomic constituents of the ## language are interpreted as state transformers. The communication ....

[Article contains additional citation context not shown here]

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella', and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. In Theoretical Computer Science 240:1, 2000.

....Thus, there exists a second class of coordination models and languages, which is control driven and state transitions are triggered by raising events and observing their presence. A prominent member of this family (and a pioneer model in the area of control driven coordination) is MANIFOLD ([5, 9, 18]) which will be the primary focus of this paper. Contrary to the case of the data driven family where coordinators directly handle and examine data values, here processes are treated as black boxes; data handled within a process is of no concern to the environment of the process. Processes ....

M. M. Bonsangue, F. Arbab, J. W. de Bakker, J. J. M. M. Rutten, A. Scutella and G. Zavattaro, "A Transition System Semantics for the Control-Driven Coordination Language MANIFOLD", Theoretical Computer Science 240 (1), 2000, pp. 3-47.

....of events, a coordinator may change the actual structure of the system by creating or removing workers, coordinators, and streams, or by changing the endings of the available streams reconnecting them to other ports. A complete presentation of the operational semantics of Manifold can be found in [5]. Here, we simply consider the description of the coordinators (and not the workers) The following language L 3 is essentially a simplification of the syntax of the Manifold language as presented in [5] T : Q k p=1 [p; U ] U : e; p) V j (e ; p ) V j (e ; p) V j (e; p ) V j U U V : ....

....other ports. A complete presentation of the operational semantics of Manifold can be found in [5] Here, we simply consider the description of the coordinators (and not the workers) The following language L 3 is essentially a simplification of the syntax of the Manifold language as presented in [5] T : Q k p=1 [p; U ] U : e; p) V j (e ; p ) V j (e ; p) V j (e; p ) V j U U V : end j U j raise(e) V j post(e) V where p 2 PName and e 2 EName denote process names and event names, respectively. A Manifold system T is the parallel composition of n components hp; U i where p is the ....

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutell`a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240(1): 3-47, 2000.

....of events, a coordinator may change the actual structure of the system by creating or removing workers, coordinators, and streams, or by changing the endings of the available streams reconnecting them to other ports. A complete presentation of the operational semantics of Manifold can be found in [5]. Here, we simply consider the description of the coordinators (and not the workers) The following language L 3 is essentially a simplification of the 42 syntax of the Manifold language as presented in [5] T : Q k p=1 [p; U ] U : e; p) V j (e ; p ) V j (e ; p) V j (e; p ) V j U U V ....

....ports. A complete presentation of the operational semantics of Manifold can be found in [5] Here, we simply consider the description of the coordinators (and not the workers) The following language L 3 is essentially a simplification of the 42 syntax of the Manifold language as presented in [5] T : Q k p=1 [p; U ] U : e; p) V j (e ; p ) V j (e ; p) V j (e; p ) V j U U V : end j U j raise(e) V j post(e) V where p 2 PName and e 2 EName denote process names and event names, respectively. A Manifold system T is the parallel composition of n components hp; U i where p is ....

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutell`a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240(1), July 2000, to appear.

....component is connected to a given set of sources and or sinks of some channels. This defines the initial connection topology of a system. In this section we introduce a formal model of the observable behavior of a component in terms of a transition system that abstracts away its internal behavior [8]. The internal behavior itself may be implemented in different programming languages. For the rest of this paper, let Chan be a set of channel identities with typical elements c; c 0 ; and let Chan be the set fc j c 2 Chang. For a channel c 2 Chan , we denote by c its source end and ....

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutell'a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Theoretical Computer Science, 240(1), July 2000.

....a new instance of value a in the local dataspace, del(a:s) broadcasts the message a :s indicating the request for deletion of one instance of value a, get(a) consumes a local occurrence of value a. The put and del actions associate to data the sorts used during their broadcast. Following [3, 7], we model broadcasting of messages using queues of pending messages. A queue q is a partially commuting string defined as a congruence class of finite strings in the monoid ( Sigma ; Delta; modulo the least congruence such that, for all x :s; y :t 2 Sigma , x :s Delta y :t = y :t ....

....of the system to the environment, which has to determine which branch will be chosen. 4. 3 A control oriented language We conclude this section by modeling a language inspired to the event mechanism of the control oriented language Manifold [4] of which the operational semantics is given in [3]. Let Evn be a set of events and Pid be a set of process identifiers. We define the syntax of our control oriented coordination language as follows: G : ep S j G G ep : e; p) j (e ; p ) j (e ; p) j (e; p ) S : end j G j raise(e) S j post(e) S where e 2 Evn and p 2 Pid . A system ....

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutell'a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. To appear in Theoretical Computer Science, 1999.

.... activities [CH96] Basically, coordination is achieved either by generative communication via a shared data space (e.g. Linda [GC92] and Gamma [BM93] or by dynamically evolving the interconnections among the processes as a consequence of observations of their state changes (e.g. Manifold [BABRSZ98]) A recent survey [PA98] lists at least 30 di#erent coordination languages and models. This amount of di#erent proposals requires also the definition of criteria for their comparison and classification. This paper represents a first step towards the analysis of such this possible criteria. In ....

....in [CGZ96] for the Gamma calculus: we first present the semantics of programs and then we describe how programs interact with the shared data space at the coordination level. This approach has been recently used also in the definition of a formal semantics for the coordination language Manifold [BABRSZ98]. 2.1 The Language Gamma Let Reaction, ranged over by R, R i , and Action, ranged over by A, A i , be two sets of reactions and actions, respectively. Let #, ranged over by P , Q, be the set of Gamma programs defined by the following abstract syntax: P rograms# P : R, A) ....

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella, G. Zavattaro. A transition system semantics for a control-driven coordination language. Forthcoming.

....the same sort. Thus, two messages with different sorts (e.g. broadcast by different processes) may be received by another process in any order, while two messages with the same sort (e.g. broadcast by the same process) are received by any process in the same order as they were produced. Following [4], we model broadcasting using queues of pending messages. They are congruence classes of finite strings in the monoid ( Sigma ; Delta; modulo the least congruence such that, for all oe 1 ; oe 2 2 Sigma oe 1 Delta oe 2 = oe 2 Delta oe 1 if oe 1 6. oe 2 : We denote by DQ the set of all ....

M. Bonsangue, F. Arbab, J. de Bakker, J. Rutten, A. Scutell'a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Technical Report, CWI, Amsterdam, 1998.

....of SPLICE using transition systems in the style of Plotkin [20] for the shared data space model and the distributed data space model. Both transition systems are defined independently from the host languages in which computations take place. We have used an approach similar to the one adopted in [4] and different from the the syntax based approach in [14] The advantage is that SPLICE primitives can be embedded in several programming languages, possibly members of different classes of programming paradigms. The configuration of both transition systems represent a set of several concurrently ....

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, and A. Scutell'a. A transition system semantics for a control-driven coordination language. In preparation.

.... activities [CH96] Basically, coordination is achieved either by generative communication via a shared data space (e.g. Linda [GC92] and Gamma [BM93] or by dinamically evolving the interconnections among the processes as a consequence of observations of their state changes (e.g. Manifold [ABBRSZ98]) A recent survey [PA98] lists at least 30 different coordination languages and models. This amount of different proposals requires also the definition of criteria for their comparison and classification. This paper represents a first step towards the analysis of such this possible criteria. In ....

....in [CGZ96] for the Gamma calculus: we first present the semantics of programs and then we describe how programs interact with the shared data space at the coordination level. This approach has been recently used also in the definition of a formal semantics for the coordination language Manifold [ABBRSZ98]. 2.1 The Language Gamma Let Reaction, ranged over by R, R i , and Action, ranged over by A, A i , be two countable sets of reactions and actions, respectively. Let Gamma, ranged over by P , Q, be the set of Gamma programs defined by the following abstract syntax: Programs ....

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutell`a, G. Zavattaro. A transition system semantics for a control-driven coordination language. Forthcoming.

....on the communication protocol used) The actions rd , del , and get are blocking, meaning that they are executed only if the required data is present in the local dataspace. The actions put and wrt do not depend on the actual contents of the local dataspace and can be always executed. Following [5, 7], we model broadcasting of messages using queues of pending messages. A queue q of pending messages is a partially commuting string defined as a congruence class of finite strings in the monoid ( Sigma ; Delta; modulo the least congruence such that, for all x ; y 2 Msg and s ; t 2 Sorts , ....

....of the system to the environment, which has to determine which branch will be chosen. 4. 3 A control oriented language We conclude this section by modeling a language inspired to the event mechanism of the control oriented language Manifold [3] of which the operational semantics is given in [5]. Let Evn be a set of events and Pid be a set of process identifiers. We define the syntax of our control oriented coordination language as follows: G : ep S j G G ep : e; p) j (e ; p ) j (e ; p) j (e; p ) S : end j G j raise(e) S j post(e) S where e 2 Evn and p 2 Pid . A system ....

[Article contains additional citation context not shown here]

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutell'a, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. Technical Report, CWI, Amsterdam, 1998.

No context found.

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutell`a, G. Zavattaro, A transition system semantics for the control-driven coordination language MANIFOLD, Technical Report SEN-R9829, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1998.

No context found.

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutell`a, G. Zavattaro, A transition system semantics for the control-driven coordination language MANIFOLD, Technical Report SEN-R9829, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1998.

No context found.

F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the control-driven coordination language Manifold. Theoretical Computer Science, 2000. To appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC