Communications in choreographies, revisited

Cruz-Filipe, Luís; Montesi, Fabrizio; Peressotti, Marco

doi:10.1145/3167132.3167267

Cited by 7 publications

(8 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Choreographic programming is a different approach prototyped by Montesi 51 and further developed in the recent years by his research group. [52][53][54][55][56] The code for all endpoints is written in a single choreography, which instructs both communications and how data should be computed. Then, the choreography is automatically translated into an executable program for each endpoint.…”

Section: Related Workmentioning

confidence: 99%

“…Carbone et al 49,50 exploit multiparty session types to automatically translate choreographies into local specifications of the communications that each endpoint should implement. Choreographic programming is a different approach prototyped by Montesi 51 and further developed in the recent years by his research group 52‐56 . The code for all endpoints is written in a single choreography, which instructs both communications and how data should be computed.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Highly collaborative distributed systems: Synthesis and enactment at work

Autili

Perucci

Leite

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Service choreographies support a distributed composition approach that is based on the specification of the external interaction of the participant services in terms of flows of message exchanges, given from a global perspective. When developing distributed service-based applications, different services are produced by different teams; at the same time, such choreographies can also interact with third-party services, hence leading to the reuse of black-box services. Enforcing a global coordination logic across the many in-house and third-party services to correctly realize the specified choreography is a nontrivial endeavor. Automatic support is then desirable. In this article, we present an integrated development and run-time environment for choreography-based systems, which covers all the development activities, including specification, code synthesis, automatic deployment, enactment, and monitoring on the Cloud. We focus on providing a practical solution, that is, applicable by the community and considering technological standards used in the industry. We report the results of an experiment that we conducted with a use case in the in-store marketing and sales domain. Results confirm confidence in the approach and show that the platform can be applied in practical contexts.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Highly collaborative distributed systems: Synthesis and enactment at work

Autili

Perucci

Leite

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Choreographic languages like ours are used in choreographic programming, a programming paradigm where choreographies are programs that can be compiled to distributed implementations [20,10,21]. Our extraction algorithm can be applied to several existing languages for networks, modulo minor syntactic differences [9,10,11,21]. For some of these languages, our algorithm can be applied only to fragments of them; we point out some of the features for future work in the next paragraphs.…”

Section: Conclusion and Discussionmentioning

confidence: 99%

“…In order to extract asynchronous exchanges, we do not need full asynchrony at the choreography level. Rather, we can restrict ourselves to a new primitive called a multicom [11]: a list of communication actions with distinct receivers, written (η). Using multicoms, the program in Example 13 can be extracted as p.e -> q.x , q.e -> p.y .…”

Section: Conclusion and Discussionmentioning

confidence: 99%

Implementing Choreography Extraction

Cruz-Filipe¹,

Larsen²,

Montesi³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification and synthesis of correct-by-construction software. They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most software does not come with choreographies yet, which prevents their application. To attack this problem, previous work investigated choreography extraction, which automatically constructs a choreography that describes the behaviour of a given set of programs or protocol specifications.We propose a new extraction methodology that improves on the state of the art: we can deal with programs that are equipped with state and internal computation and time complexity is dramatically better. We also implement this theory and show that, in spite of its theoretical exponential complexity, it is usable in practice. We discuss the data structures needed for an efficient implementation, introduce some optimisations, and perform a systematic practical evaluation.

show abstract

“…While well-threadedness and coherence concern the behaviour of replicated servers, connectedness is the same as the projectability criterium of BPMN 2.0.2, which we also adopt in the present paper. The connectedness property occurs also in other works on choreography, e.g., [24,8]. In the theory of multiparty session types [21] and in Chor [7], such property is omitted at a price of a more flexible interpretation of sequencing.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Declarative Choreographies and Liveness

Hildebrandt¹,

López

Debois

et al. 2019

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

We provide the first formal model for declarative choreographies, which is able to express general omega-regular liveness properties. We use the Dynamic Condition Response (DCR) graphs notation for both choreographies and end-points. We define end-point projection as a restriction of DCR graphs and derive the condition for end-point projectability from the causal relationships of the graph. We illustrate the results with a running example of a Buyer-Seller-Shipper protocol. All the examples are available for simulation in the online DCR workbench at http://dcr.tools/forte19.

show abstract

Communications in choreographies, revisited

Cited by 7 publications

References 15 publications

Highly collaborative distributed systems: Synthesis and enactment at work

Highly collaborative distributed systems: Synthesis and enactment at work

Implementing Choreography Extraction

Declarative Choreographies and Liveness

Contact Info

Product

Resources

About