On Calculi for Context-Aware Coordination

Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multi-agent systems, are examples of domains exhibiting a continuously changing system configuration. In these settings, the context where computation occurs is not only dynamically changing, but also affecting the components’ behavior in a fundamental way, by enabling or inhibiting some of their actions.

[1]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[2]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[3]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[4]  Amy L. Murphy,et al.  LIME: a middleware for physical and logical mobility , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[5]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[6]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[7]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[8]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences: A 2-categorical Approach , 2002, EXPRESS.

[9]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[10]  Antony I. T. Rowstron,et al.  State- and Event-Based Reactive Programming in Shared Dataspaces , 2002, COORDINATION.

[11]  Amy L. Murphy,et al.  Coordination and Mobility , 2001, Coordination of Internet Agents: Models, Technologies, and Applications.

[12]  Franco Zambonelli,et al.  Coordination of Internet Agents: Models, Technologies, and Applications , 2014, Coordination of Internet Agents: Models, Technologies, and Applications.

[13]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[14]  Amy L. Murphy,et al.  LIME: A Coordination Middleware Supporting Mobility of Hosts and Agents , 2003 .

[15]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

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