Coordination Models and Languages

We review work over the last thirty years on simple, formal models capturing the essence of (realistic) views of distributed coordination. We trace a path through work on concurrent constraint programming, its linear version, connections with the asynchronous pi-calculus, and, more recently, through the imperative resilient X10. As always, the virtue of clean and powerful abstractions is that they can ease design of real systems that address tricky technical concerns. We illustrate with the calculus for resilient X10, designing which forced us to a semantic principle, Happens Before Invariance, which is useful in practice.

[1]  Mor Harchol-Balter,et al.  Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.

[2]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[3]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[4]  Don Syme,et al.  The F# Asynchronous Programming Model , 2011, PADL.

[5]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[6]  Flemming Nielson,et al.  Broadcast, Denial-of-Service, and Secure Communication , 2013, IFM.

[7]  Christel Baier,et al.  Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[8]  Kim G. Larsen,et al.  Efficient On-the-Fly Algorithms for the Analysis of Timed Games , 2005, CONCUR.

[9]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[10]  Kim G. Larsen,et al.  Synthesis of Optimal Strategies Using HyTech , 2005, GDV@CAV.

[11]  Chris Hankin,et al.  A framework for security analysis of mobile wireless networks , 2006, Theor. Comput. Sci..

[12]  Todor Stefanov,et al.  On the hard-real-time scheduling of embedded streaming applications , 2012, Design Automation for Embedded Systems.

[13]  Farhad Arbab,et al.  Puff, The Magic Protocol , 2011, Formal Modeling: Actors, Open Systems, Biological Systems.

[14]  Arjan van der Schaft,et al.  An Introduction to Hybrid Dynamical Systems, Springer Lecture Notes in Control and Information Sciences 251 , 1999 .

[15]  H. Gantt.  Work, Wages, and Profits , 1973 .

[16]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[17]  Martin Odersky,et al.  FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction , 2012, LCPC.

[18]  Jun Sun,et al.  A Hybrid Model of Connectors in Cyber-Physical Systems , 2014, ICFEM.

[19]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[20]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[21]  Dave Clarke,et al.  Decomposing port automata , 2009, SAC '09.

[22]  Ajay D. Kshemkalyani,et al.  Clock synchronization for wireless sensor networks: a survey , 2005, Ad Hoc Networks.

[23]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[24]  C. R. Ramakrishnan,et al.  A process calculus for Mobile Ad Hoc Networks , 2010, Sci. Comput. Program..

[25]  Niraj K. Jha,et al.  Low power system scheduling and synthesis , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).