Jean-Marc Andreoli, Paolo Ciancarini, and Remo Pareschi. Interaction Abstract Machines. In G. A. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object Oriented Programming, pages 257--280. MIT Press, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of Gamma is the assumption that global termination is observable, i.e. that it is possible to detect a global state of the multiset where no reaction rules are applicable. At this point, the current active rules are cancelled, and may be sequentially replaced by another set of rules. Finally, LO[4] is a model based on broadcasting, rather than on shared dataspace. Each agent has its own multiset of resources, and data output by an agent is broadcast to all other living agents (excluding the sender) each receiver gets a separate copy of the resource, which it can use independently. ....

Jean-Marc Andreoli, Paolo Ciancarini, and Remo Pareschi. Interaction Abstract Machines. In Research directions in Concurrent Object-Oriented Programming, MIT Press, 1993.

....power, which is weaker than that of a language like LO [8] Yet, we believe that the expressive power of Moses is su#ciently rich to be useful, as the examples in this paper hopefully demonstrate. A possible metaphor for the target application of much of the current coordination research, such as [4,1,2], is a symphonic orchestra [9,19] in which all players work together to perform a musical piece. In other words, there is a specific task to be performed via the interaction of autonomous, possibly heterogeneous, components; this interaction is to be defined by means of a single coordination ....

J.-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction abstract machines. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 257--280. 1993.

.... the Chemical Abstract Machine [9] Actors [2, 48] production systems [14] group communication of the broadcasting and multicasting kind [11] and constraint based programming [45] which have been variously interpreted in terms of a Linear Logic operational semantics based on proof search, as in [7, 5, 12, 35, 46]. This flowering of developments has been backed by theoretical contributions concerning those aspects of Linear Logic which are essential to proof search. In particular, there have been several investigations of the crucial problem of permutations of inference figures during proof construction ....

J-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction abstract machines. In G. Agha, A. Yonezawa, and P. Wegner, editors, Research Directions in Concurrent Object Oriented Programming, pages 257--280. MIT Press, Cambridge, Ma, U.S.A., 1993.

....because of its emphasis on coordination constructs. Indeed, Strand is offered as a coordination language and, like Linda, has been used to augment imperative sequential languages such as C and Fortran, yielding Strand C and Strand Fortran. The metaphor of Interaction Abstract Machines (IAMs)[23] and its underlying formal computational model, Linear Objects[24] present a paradigm for abstract modeling of concurrent agent oriented computation. The operational semantics of the agents and their interactions is given in terms of the proof theory of Linear Logic. The notion of ....

J. Andreoli, P. Ciancarini, and R. Pareschi, "Interaction Abstract Machines," in Trends in Object-Based Concurrent Computing, pp. 257--280, MIT Press, 1993.

....computation languages. There have been relatively few attempts to study coordination as a stand alone programming # Corresponding author. E mail: marcello cs.leidenuniv.nl 1. Introduction 2 paradigm, with its own self contained programming language; Gamma [29] and Interaction Abstract Machines [2] are some such examples, and MANIFOLD, the subject of study in this paper, is another. Coordination models and languages can be classified as either data oriented or control oriented [9] For instance, Linda [28] uses a data oriented coordination model, whereas MANIFOLD is a controloriented ....

Andreoli, J.-M., Ciancarini, P., and Pareschi, R. Interaction Abstract Machines. In Trends in Object-Based Concurrent Computing. MIT Press, 1993, pp. 257--280.

....because of its emphasis on coordination constructs. Indeed, Strand is offered as a coordination language and, like Linda, has been used to augment imperative sequential languages such as C and Fortran, yielding Strand C and Strand Fortran. The metaphor of Interaction Abstract Machines (IAMs)[44] and its underlying formal computational model, Linear Objects[45] present a paradigm for abstract modeling of concurrent agent oriented computation. The operational semantics of the agents and their interactions is given in terms of the proof theory of Linear Logic. The notion of ....

J. Andreoli, P. Ciancarini, and R. Pareschi, "Interaction Abstract Machines," in Trends in ObjectBased Concurrent Computing, pp. 257--280, MIT Press, 1993.

....t means, for a given agent ff, to send t to all other agents fi; it corresponds to the insertion of an atom t into each open node of the proof. Some of these aspects will be represented in a graphical manner in this work, when we base our analysis on the Interaction Abstract Machine metaphor ([9]) The broadcasting mechanism takes LO away from its logical basis, so that linear logic is no more a suitable semantics for LO. For each goal formula G, the jjGjj set of its components (read par components) is inductively defined as follows: 11 Definition 3.2 Each component of G is a ....

.... of proof (set of components) polynomial division progression rule polynomial Gamma ae method ffi Gamma Gamma ae The systems obtained by the interactions of autonomous and heterogeneous agents have their interpretation in the metaphor of the Interaction Abstract Machine (IAM) Introduced in [9], the main characteristic of the IAM is that of enabling interactions among independent subsystems, in order to capture the global behaviour of the system by the analysis of the single autonomous components. Similarly to the Chemical Abstract Machine metaphor [18] a IAM describes the components ....

[Article contains additional citation context not shown here]

J.M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In Research Direction in Concurrent Object Oriented Programming, 1993. 30

....property is recovered. We eschew further discussion here. Finally, we intend to further develop the concept of interaction within the MONSTR framework, the aim being to explore relationships between MONSTR and other computational approaches based on the notions of linearity and interaction (Andreoli et al. 1993, Darlington et al. 1993, Kobayashi and Yonezawa 1993, Tse 1994) Acknowledgements The work reported here was done while the first author was on leave at the Computer Science Department of the University of Cyprus. The hospitality of that department, and the financial support of the Royal ....

Andreoli, J-M., Ciancarini, P. and Pareschi, R. (1993) Interaction abstract machines, in Research Directions in Concurrent Object Oriented Programming, MIT Press, Cambridge, MA, pp. 257--80.

....which is weaker than that of a language like LO [8] Yet, we believe that the expressive power of Moses is sufficiently rich to be useful, as the examples in this paper hopefully demonstrate. A possible metaphor for the target application of much of the current coordination research, such as [4,1,2], is a symphonic orchestra [9,19] in which all players work together to perform a musical piece. In other words, there is a specific task to be performed via the interaction of autonomous, possibly heterogeneous, components; this interaction is to be defined by means of a single coordination ....

J.-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction abstract machines. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 257--280. 1993.

.... based on this concept initiated the research area of coordination [8] Today, the interaction between active entities is typically investigated based on the notion of coordination, and by introducing a variety of non conventional computing models, like for example the very influential work in [3]. Object Orientation has been well established as an approach to the design and implementation of large application systems. The central notions exploited by object oriented programming are objects, classes, and inheritance as means to structure applications and libraries of reusable software ....

J. M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In Research Directions in Concurrent Object--Oriented Programming [2], pages 257--280.

....pragmatic and traditional interface to the user. 1 Introduction In the area for parallel computing, the aspect of coordination becomes more and more important. This importance has recently been reflected with the development of coordination models and corresponding coordination languages like [Gel89, FA90, JAP93, BH94, JPB90] Although these models deserve a lot of attention from a theoretical point of view, their implementation bears to some performance problems. On the other hand, PVM is an efficient system which allows to program distributed applications using the standard message passing paradigm. Unfortunately PVM ....

P. Ciancarini J.M. Andreoli and R. Pareschi. Interaction Abstract Machines. In P. Wegner G. Agha and A. Yonezawa, editors, Reserach Directions in Concurrent Object Oriented Programming. MIT Press, Cambridge Mass., 1993.

....concurrently operating active entities. Concurrent programming languages based on the concept of generative communication [12] initiated the research area of coordination [14] Today, the interaction between active entities in open systems is typically investigated based on this notion [4, 7]. Coordination as the key concept for modelling concurrent systems involves managing the communication which is necessary due to the distributed nature of a system, the expression of parallel and distributed algorithms, as well as all aspects of the composition of concurrent systems. We ....

J. M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In Agha et al. [3], pages 257--280.

....as the linguistic embodiment of a coordination model [2] to express and describe the relationships between the active entities running in parallel. This research has led to the development of several coordination models and corresponding coordination languages like Linda [3] Linear Objects [4], or Gamma [5] A coordination language like COLA [6] focuses on the coordination of highly asynchronous concurrent processes running in a (massively) parallel environment. The COLA computation space consists of a large collection of fine grained processes communicating using the asynchronous ....

J.M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In P. Wegner G. Agha and A. Yonezawa, editors, Reserach Directions in Concurrent Object Oriented Programming. MIT Press, Cambridge Mass., 1993.

No context found.

J-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction abstract machines. In G. Agha, A. Yonezawa, and P. Wegner, editors, Research Directions in Concurrent Object Oriented Programming, pages 257--280. MIT Press, Cambridge, Ma, U.S.A., 1993.

No context found.

J-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In G. Agha, A. Yonezawa, and P. Wegner, editors, Research Directions in Concurrent Object Oriented Programming, pages 257-280. MIT Press, Cambridge, Ma, U.S.A., 1993.

....A computation fails if it obtains a non empty goal that cannot be rewritten further. For instance, if we consider the logic program in example 2. 1 and the goal Sum( 1; 2] x) we can have the following successful computation: Sum( 1; 2] x) Sum1( 1; 2] 0; x) P lus(1; 0; k1) Sum1([2]; k1; x) Sum1( 2] 1; x) P lus(2; 1; k1 ; x) Sum1( 3; x) 2 obtaining the answer substitution fx 3g. Instead, the following computation fails: Sum( 1; 2] 4) Sum1( 1; 2] 0; 4) P lus(1; 0; k1) Sum1( 2] k1; 4) Sum1( 2] 1; 4) P lus(2; 1; k1 ; 4) Sum1( 3; 4) 6 ....

....fails if it obtains a non empty goal that cannot be rewritten further. For instance, if we consider the logic program in example 2. 1 and the goal Sum( 1; 2] x) we can have the following successful computation: Sum( 1; 2] x) Sum1( 1; 2] 0; x) P lus(1; 0; k1) Sum1( 2] k1; x) Sum1([2]; 1; x) P lus(2; 1; k1 ; x) Sum1( 3; x) 2 obtaining the answer substitution fx 3g. Instead, the following computation fails: Sum( 1; 2] 4) Sum1( 1; 2] 0; 4) P lus(1; 0; k1) Sum1( 2] k1; 4) Sum1( 2] 1; 4) P lus(2; 1; k1 ; 4) Sum1( 3; 4) 6 where the symbol 6 ....

[Article contains additional citation context not shown here]

J. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In G. Agha, P. Wegner, and A. Yonezawa, editors, Trends in Object-Based Concurrent Computing, pages 257-280. MIT Press, Cambridge, MA, 1993.

....communication primitives; ii) the problem of parallel searching for Linear Logic proofs. Keywords: True Concurrency, Concurrent Rewriting, Chemical Abstract Machines, Broadcasting, Linear Logic. 1 Introduction In this paper, we provide a true concurrency semantic characterization for LO [4, 3, 2], a language designed for programming reactive systems. LO is finding applications in such fields as parallel algorithms [3, 5] distributed simulations [2] and as a coordination language for extending the capabilities of object oriented languages [8] LO views the computation as performed by ....

....Machines, Broadcasting, Linear Logic. 1 Introduction In this paper, we provide a true concurrency semantic characterization for LO [4, 3, 2] a language designed for programming reactive systems. LO is finding applications in such fields as parallel algorithms [3, 5] distributed simulations [2] and as a coordination language for extending the capabilities of object oriented languages [8] LO views the computation as performed by concurrent agents that are themselves characterized by multiple concurrent internal threads of computation; agents can self replicate, and their primary form ....

J-M. Andreoli, P. Ciancarini, and R. Pareschi. Interaction abstract machines. In G. Agha, A. Yonezawa, and P. Wegner, editors, Research Directions in Concurrent Object Oriented Programming, pages 257--280. MIT Press, Cambridge, Ma, U.S.A., 1993.

....a predicate name. In a rule, a token consists of a tuple of variable names 3 prefixed with a predicate name. A rule of the form p(X) q(X,Y) r(Y) BODY 2 It is beyond of scope of this paper to describe the full functionality and semantics of the LO language; for more details see [1, 3, 4]. 3 Variables in rules start with an uppercase letter. 3 enables a state transition on agents which contain the trigger of the rule (in this case, two tokens of the form p(a) and q(a; b) in their state. When the transition is performed on such an agent, these two tokens are removed from ....

Andreoli, J-M., Ciancarini, P., Pareschi, R.: Interaction Abstract Machines. In: Agha, G.A., Yonezawa, A., Wegner, P. (eds.): Research Directions in Concurrent Object-Oriented Programming, 1992. Cambridge, MA: MIT Press, pp. 257--280

.... generally realized by data spaces (e.g. Swarm (Roman and Cunningham 1990) Linda (Carriero and Gelernter 1990) CHAM (Berry and Boudol 1990) Gamma (Ban tre and M tayer 1990) UNITY (Chandy and Misra 1988) and by models based on message passing, e.g. Actors (Agha 1986) The LO model (Andreoli et al. 1992) also combines both aspects: intra pool communication realizes a form of active reading, by applying rewrite rules to resources as they become available, while inter pool communication is based on actual delivery of new resources to an agent from the outside. Another feature of our proposed model ....

....integration of different styles of communication over a network. In the weak sense of making all messages potentially known to all the agents in the computation, this has usually been tackled by assuming a basic form of communication which is as little committing as possible, namely broadcasting (Andreoli et al. 1992) . Other forms of communication, such as multicasting, point topoint, or negotiations can then be easily implemented on top of this basic mechanism (Borghoff 1994) Agents select and, possibly, compete for messages which satisfy given properties. With some dissimilarities, the systemic concept of ....

J.-M. Andreoli, P. Ciancarini, and R. Pareschi. "Interaction Abstract Machines". In G. A. Agha, A. Yonezawa,and P. Wegner, editors, Research Directions in ConcurrentObject-Oriented Programming,pages 257--280. Cambridge, MA: MIT Press, 1992.

....is operationally defined by the application of multi set rewriting (reaction) rules. The CHAM was originally introduced for representing concurrent computations [3] In fact, the CHAM is also a simple coordination model to describe and control coordination and interaction among agents [2]. In our knowledge these notations do not support code mobility. A paper which analizes a number of formal models suitable for mobility is [10] The paper is organized as follows: Section 2 introduces PoliS; Section 3 studies how PoliS can be used to describe software architectures including ....

J. Andreoli, P. Ciancarini, and R. Pareschi. Interaction Abstract Machines. In G. Agha, P. Wegner, and A. Yonezawa, editors, Trends in ObjectBased Concurrent Computing, pages 257--280. MIT Press, Cambridge, MA, 1993.

....based on singleton object transactions, whereas in several cases we need to test, delete, or replace multisets of objects. 10 , Multiset rewriting is a powerful coordination paradigm which allows a natural definition of a logically distributed system as a set of coordinable, concurrent agents [Andreoli et al. 1993]. Instead of singletons including single object, multiset rewriting is based on the concept of multiset, namely a set whose elements can have multiple copies. In the basic multiset rewriting model, a number of rewriting rules are associated to a multiset. A rewriting rule is simply a pair of ....

....writing items in the object s tuple space; ffl writing items in other objects tuple spaces; i.e. sending a message) 11 ffl create a new object. In Shade coordinables are active objects; the coordination medium is a tuple space, whose properties are similar to Interaction Abstract Machines [Andreoli et al. 1993]. This means that the action of writing in other objects tuple spaces is performed by a special form of multicast. A message s address is a pattern; messages are delivered to each object whose name matches the given pattern. This way we can easily express with the same basic mechanism ....

Andreoli, J., P. Ciancarini, and R. Pareschi (1993), "Interaction Abstract Machines," In Trends in Object-Based Concurrent Computing, G. Agha, P. Wegner, and A. Yonezawa, Eds., MIT Press, Cambridge, MA, pp. 257--280.

No context found.

Jean-Marc Andreoli, Paolo Ciancarini, and Remo Pareschi. Interaction Abstract Machines. In G. A. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object Oriented Programming, pages 257--280. MIT Press, 1993.

No context found.

Andreoli, J.-M., Ciancarini, P., and Pareschi, R. 1993. \Interaction Abstract Machines ", In Research Directions in Concurrent Object Oriented Programming, G. Agha, P. Wegner, A. Yonezawa (eds.), MIT Press, pp.257-280.

No context found.

J. Andreoli, P. Ciancarini, and R. Pareschi, Interaction Abstract Machines. In Research Directions in Concurrent Object-Oriented Programming, Eds Agha, Wegner, Yonezawa, MIT Press, 1993.

No context found.

Andreoli, J.-M., Ciancarini, P., and Pareschi, R. 1993. \Interaction Abstract Machines ", In Research Directions in Concurrent Object Oriented Programming, G. Agha, P. Wegner, A. Yonezawa (eds.), MIT Press, pp.257-280.

First 50 documents

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