Time-Aware Coordination in ReSpecT

Tuple centres allow for dynamic programming of the coordination media: coordination laws are expressed and enforced as the behaviour specification of tuple centres, and can change over time. Since time is essential in a large number of coordination problems and patterns (involving timeouts, obligations, commitments), coordination laws should be expressive enough to capture and govern time-related issues. Along this line, in this paper we discuss how tuple centres and the ReSpecT language for programming logic tuple centres can be extended to catch with time, and to support the definition and enforcement of time-aware coordination policies. Some examples are provided to demonstrate the expressiveness of the ReSpecT language to model timed coordination primitives and laws.

[1]  Andrea Omicini,et al.  From tuple spaces to tuple centres , 2001, Sci. Comput. Program..

[2]  Tobin J. Lehman,et al.  T Spaces , 1998, IBM Syst. J..

[3]  Maurizio Gabbrielli,et al.  A Timed Linda Language and its Denotational Semantics , 2004, Fundam. Informaticae.

[4]  Jean-Marie Jacquet,et al.  On Timed Coordination Languages , 2000, COORDINATION.

[5]  Alessandro Ricci,et al.  A timed extension of ReSpecT , 2005, SAC '05.

[6]  Andrea Omicini,et al.  On the expressive power of a language for programming coordination media , 1998, SAC '98.

[7]  Franco Zambonelli,et al.  Coordination for Internet Application Development , 1999, Autonomous Agents and Multi-Agent Systems.

[8]  Nicolas Halbwachs,et al.  LUSTRE: a declarative language for real-time programming , 1987, POPL '87.

[9]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[10]  Andrea Omicini,et al.  Coordination artifacts: environment-based coordination for intelligent agents , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[11]  Andrea Omicini,et al.  Coordination as a Service: Ontological and Formal Foundation , 2003, Electron. Notes Theor. Comput. Sci..

[12]  Andrea Omicini,et al.  Extending ReSpecT for Multiple Coordination Flows , 2002, PDPTA.

[13]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

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

[15]  Alessandro Ricci,et al.  Instructions-based semantics of agent mediated interaction , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[16]  Chris Hankin,et al.  Coordinatio Languages and Models , 2002, Lecture Notes in Computer Science.

[17]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[18]  Andrea Omicini,et al.  Programmable Coordination Media , 1997, COORDINATION.

[19]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..