Automata for Specifying and Orchestrating Service Contracts

Basile, Davide; Degano, Pierpaolo; Ferrari, Gian Luigi

doi:10.2168/lmcs-12(4:6)2016

Cited by 24 publications

(15 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Component automata are LTSs with an additional distinction between input and output actions. 4 They form the basic building block of systems.…”

Section: Background and Extended Team Automatamentioning

confidence: 99%

“…Team automata [8,22] are a transition system model for systems of reactive components differentiating input (passive), output (active), and internal (privately active) actions, in the line of I/O automata [18,28], interface automata [19,20], component-interaction automata [13], modal I/O automata [26], and contract automata [3,4]. The distinguishing feature of team automata is their very loose nature of synchronisation according to which, in principle, any number of component automata can participate in the synchronised execution of a shared communicating action, either as a sender or as a receiver.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compositionality of Safe Communication in Systems of Team Automata

Beek

Hennicker

Kleijn

2020

Theoretical Aspects of Computing – ICTAC 2020

View full text Add to dashboard Cite

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. This apparently simple generalisation has a significant consequence: among the 'arbitrary other actions' there may be output or input actions open to the environment. This is a potentially dangerous situation, since in this case local communication properties can be violated after composition with other teams. This leads us to the third, perhaps most important, contribution of the current paper. We consider composition of systems and of teams. First, we show that composition behaves well with synchronisation types (Theorem 1). Then we investigate conditions under which communication properties are preserved by ETA composition. The principle idea is that for this it should be sufficient to consider interface actions and to check (global) compliance conditions for them. We formulate appropriate conditions, first for the case of (strong) receptiveness and responsiveness (Theorem 2) and then for the weak variant of the two, solving the problem sketched above (Theorem 3). An intuitive running example guides the reader through the paper. Outline After introducing extended team automata (ETA) in Section 2, we consider synchronisation type specifications and ETA determined by them in Section 3. (Weak) compliance of ETA with communication requirements and safe communication are treated in Section 4. In Section 5, we define the composition of systems and of teams, and we show that this works well with synchronisation type specifications. In Section 6, we provide our main compositionality results. Full proofs and some insightful counterexamples of the results presented in the latter two sections can be found in Appendices A and B. After discussing related work in Section 7, we conclude the paper in Section 8.

show abstract

“…Component automata are LTSs with an additional distinction between input and output actions. 4 They form the basic building block of systems.…”

Section: Background and Extended Team Automatamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Compositionality of Safe Communication in Systems of Team Automata

Beek

Hennicker

Kleijn

2020

Theoretical Aspects of Computing – ICTAC 2020

View full text Add to dashboard Cite

show abstract

“…An approach to the formal description of service contracts in terms of automata has been recently developed in [6]. The notion of contract automaton is related to that of contract as well as of session contract.…”

Section: Related and Future Workmentioning

confidence: 99%

“…The notion of contract automaton is related to that of contract as well as of session contract. Besides, the notion of contract agreement in [6] somewhat resembles that of compliance. In the framework of that paper, orchestrators are synthesised to enforce contract composition to adhere to the requirements for contract agreement.…”

Section: Related and Future Workmentioning

confidence: 99%

“…In the framework of that paper, orchestrators are synthesised to enforce contract composition to adhere to the requirements for contract agreement. Even if the authors of [6] work on the overall satisfaction in a multiparty composition of principals, it is definitely worthwhile, as a future investigation, to study the relation between the notion of orchestration, as developed in [19] and in the present paper, and the approach of [6], which in turn has been related in [7] to the model of choreography of communicating finite state machines (CFMS) [11]. For what concerns session contracts in particular, the investigation of the correspondence with the above mentioned formalisms could start from the result concerning the correspondence of binary session types with a particular two-communicating-machines subclass (see [15] for references).…”

Section: Related and Future Workmentioning

confidence: 99%

See 1 more Smart Citation

Orchestrated Session Compliance

Barbanera

Bakel

de’Liguoro

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We investigate the notion of orchestrated compliance for client/server interactions in the context of session contracts. Devising the notion of orchestrator in such a context makes it possible to have orchestrators with unbounded buffering capabilities and at the same time to guarantee any message from the client to be eventually delivered by the orchestrator to the server, while preventing the server from sending messages which are kept indefinitely inside the orchestrator. The compliance relation is shown to be decidable by means of 1) a procedure synthesising the orchestrators, if any, making a client compliant with a server, and 2) a procedure for deciding whether an orchestrator behaves in a proper way as mentioned before.Comment: In Proceedings ICE 2015, arXiv:1508.0459

show abstract

Bridging the Gap Between Supervisory Control and Coordination of Services: Synthesis of Orchestrations and Choreographies

Basile

Beek

Pugliese

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We explore the frontiers between coordination and control systems by discussing a number of contributions to bridging the gap between supervisory control theory and coordination of services. In particular, we illustrate how the classical synthesis algorithm from supervisory control theory to obtain the socalled most permissive controller can be modified to synthesise orchestrations and choreographies of service contracts formalised as contract automata. The key ingredient to make this possible is a novel notion of controllability. Finally, we present an abstract parametric synthesis algorithm and show that it generalises the classical synthesis as well as the orchestration and choreography syntheses.

show abstract

Automata for Specifying and Orchestrating Service Contracts

Cited by 24 publications

References 40 publications

Compositionality of Safe Communication in Systems of Team Automata

Compositionality of Safe Communication in Systems of Team Automata

Orchestrated Session Compliance

Bridging the Gap Between Supervisory Control and Coordination of Services: Synthesis of Orchestrations and Choreographies

Contact Info

Product

Resources

About