Compositionality of Safe Communication in Systems of Team Automata

We study guarantees for safe communication in systems of systems composed of reactive components that communicate through synchronised execution of common actions. Systems are modelled as (extended) team automata, in which, in principle, any number of component automata can participate in the execution of a communicating action, either as a sender or as a receiver. We extend team automata with synchronisation type specifications, which determine specific synchronisation policies fine-tuned for particular application domains. On the other hand, synchronisation type specifications generate communication requirements for receptiveness and responsiveness. We propose a new, liberal version of requirement satisfaction which allows teams to execute arbitrary intermediate actions before being ready for the required communication, which is important in practice. Then we turn to the composition of systems and show that composition behaves well with respect to synchronisation type specifications. As a central result, we investigate criteria that ensure the preservation of local communication properties when (extended) team automata are composed. This is particularly challenging in the context of weak requirement satisfaction.

[1]  Massimo Mecella,et al.  When are Two Web Services Compatible? , 2004, TES.

[2]  Walter Vogler,et al.  Richer interface automata with optimistic and pessimistic compatibility , 2014, Acta Informatica.

[3]  Ivana Černá,et al.  Component-interaction automata as a verification-oriented component-based system specification , 2005, SAVCBS '05.

[4]  Rolf Hennicker,et al.  On Weak Modal Compatibility, Refinement, and the MIO Workbench , 2010, TACAS.

[5]  Josep Carmona,et al.  Compatibility in a multi-component environment , 2013, Theor. Comput. Sci..

[6]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[7]  Michel Bidoit,et al.  Compatibility Properties of Synchronously and Asynchronously Communicating Components , 2018, Log. Methods Comput. Sci..

[8]  Clarence A. Ellis Team automata for groupware systems , 1997, GROUP '97.

[9]  Grzegorz Rozenberg,et al.  Synchronizations in Team Automata for Groupware Systems , 2003, Computer Supported Cooperative Work (CSCW).

[10]  Axel Legay,et al.  Timed service contract automata , 2019, Innovations in Systems and Software Engineering.

[11]  Maurice H. ter Beek,et al.  Team Automata@Work: On Safe Communication , 2020, COORDINATION.

[12]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[13]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[14]  Glynn Winskel,et al.  Synchronization Trees , 1984, Theor. Comput. Sci..

[15]  Elie Najm,et al.  Behavioural Contracts for a Sound Assembly of Components , 2003, FORTE.

[16]  Josep Carmona,et al.  Conditions for Compatibility of Components - The Case of Masters and Slaves , 2016, ISoLA.

[17]  Joseph Sifakis,et al.  A general framework for architecture composability , 2014, Formal Aspects of Computing.

[18]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[19]  Luca Padovani,et al.  A theory of contracts for Web services , 2007, TOPL.

[20]  Josep Carmona,et al.  Communication Requirements for Team Automata , 2017, COORDINATION.

[21]  Gregor Engels,et al.  Towards Team-Automata-Driven Object-Oriented Collaborative Work , 2002, Formal and Natural Computing.

[22]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[23]  Francisco Durán,et al.  A generic framework for n-protocol compatibility checking , 2012, Sci. Comput. Program..

[24]  Kim G. Larsen,et al.  Timed I/O automata: a complete specification theory for real-time systems , 2010, HSCC '10.

[25]  Alexander Knapp,et al.  Moving from interface theories to assembly theories , 2015, Acta Informatica.

[26]  Josep Carmona,et al.  Input/Output Compatibility of Reactive Systems , 2002, FMCAD.

[27]  Gian Luigi Ferrari,et al.  Automata for Specifying and Orchestrating Service Contracts , 2016, Log. Methods Comput. Sci..

[28]  Joseph Sifakis,et al.  Architecture Diagrams: A Graphical Language for Architecture Style Specification , 2016, ICE.

[29]  Massimo Bartoletti,et al.  Compliance in Behavioural Contracts: A Brief Survey , 2015, Programming Languages with Applications to Biology and Security.

[30]  Maurice H. ter Beek,et al.  Associativity of Infinite Synchronized Shuffles and Team Automata , 2009, Fundam. Informaticae.