Can Actors and pi-Agents Live Together?

The syntax and semantics of actors and ?-agents is first defined separately, using a uniform, “unbiased” approach. New coordination primitives are then added to the union of the two calculi which allow actors and ?-agents to cooperate.

[1]  Roberto Bruni,et al.  Zero-safe nets, or transition synchronization made simple , 1997, EXPRESS.

[2]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[3]  José Meseguer,et al.  Mapping tile logic into rewriting logic , 1997, WADT.

[4]  Carl Hewitt,et al.  Laws for Communicating Parallel Processes , 1977, IFIP Congress.

[5]  Carolyn L. Talcott,et al.  Composable Semantic Models for Actor Theories , 1997, High. Order Symb. Comput..

[6]  C. Hewitt,et al.  Comments on C. Hewitt, viewing control structures as patterns of passing messages, Artificial Intelligence 8 (1977) 323¿364 , 1978 .

[7]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[8]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  William D. Clinger,et al.  Foundations of Actor Semantics , 1981 .

[11]  Carolyn L. Talcott,et al.  An actor rewriting theory , 1996, WRLA.

[12]  Francesca Rossi,et al.  Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract) , 1996, COORDINATION.

[13]  Carolyn L. Talcott,et al.  Interaction Semantics for Components of Distributed Systems , 1997 .

[14]  Gul A. Agha,et al.  Concurrent object-oriented programming , 1993, CACM.

[15]  Gian Luigi Ferrari,et al.  Tiles for concurrent and located calculi? , 1999, EXPRESS.

[16]  Carolyn L. Talcott,et al.  A Semantically Sound Actor Tranlsation , 1997, ICALP.

[17]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[18]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[19]  Carolyn L. Talcott,et al.  A foundation for actor computation , 1997, Journal of Functional Programming.

[20]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[21]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[22]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[23]  Fabio Gadducci,et al.  A 2-Categorical Presentation of Term Graph Rewriting , 1997, Category Theory and Computer Science.

[24]  Gul Agha,et al.  Abstracting Interaction Patterns: A Programming Paradigm for Open Distributed Systems , 1997 .

[25]  Gian Luigi Ferrari,et al.  A Tile-Based Coordination View of Asynchronous pi-Calculus , 1997, MFCS.

[26]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[27]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[28]  Fabio Gadducci,et al.  Tiles, rewriting rules and CCS , 1996, WRLA.

[29]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[30]  Matthew Hennessy,et al.  Observing Localities , 1993, Theor. Comput. Sci..

[31]  Fabio Gadducci,et al.  On The Algebraic Approach To Concurrent Term Rewriting , 1996 .