Amending Contracts for Choreographies

Abstract

Distributed interactions can be suitably designed in terms of choreographies. Such abstractions can be thought of as global descriptions of the coordination of several distributed parties. Global assertions define contracts for choreographies by annotating multiparty session types with logical formulae to validate the content of the exchanged messages. The introduction of such constraints is a critical design issue as it may be hard to specify contracts that allow each party to be able to progress without violating the contract. In this paper, we propose three methods that automatically correct inconsistent global assertions. The methods are compared by discussing their applicability and the relationships between the amended global assertions and the original (inconsistent) ones.Comment: In Proceedings ICE 2011, arXiv:1108.014

Choreography Automata

“…Similarly to what discussed in Remark 4.10, some approaches propose techniques to fix choreographies which are not well-behaved. This issue is considered in some multiparty session types [10,11], in algebraic and automata-based frameworks for choreographies [8,36] as well as in the choreographic middleware ChoreOS [3,4]. While they consider different conditions than ours, trying to adapt their approaches to our setting is an interesting item for future work.…”

Three Algorithms and a Methodology for Amending Contracts for Choreographies

“…This article is the full version of the extended abstract published in [4]. We include here extended definitions and explanations, as well as proofs for our key results, and sketches of proofs for trivial ones.…”

Dynamic adaptation with distributed control in Paradigm

“…The emptiness of the set underlines the ending of scope, as from here on McPhil i has nothing to govern any longer, its final local result having been delivered. 19 We continue specifying the sets of rules and model fragments. The set Crs i,orch with the actual adaptation orchestration by McPhil i , comprising the rules (37) to (68) (47)- (50) Rules (43)- (46), with McPhil i in ToR, cover the new R-order, basically implementing the to-be rules (11)- (14) (17)- (76) …”

“…[37] focuses on modeling and deployment of distributed resources for adaptive services in a mobile environment. Tuosto et al [18,14,19] advocate the use of contracts in distributed setting, in particular addressing service-oriented computing involving multiple parties and multiple sessions. In this set-up contracts-as-formulas enable to split up the interaction in stages distinguishing between global assertions and their local projections.…”