A Clean and Efficient Implementation of Choreography Synthesis for Behavioural Contracts

Basile, Davide; Beek, Maurice H. ter

doi:10.1007/978-3-030-78142-2_14

Cited by 9 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Differently from the semi-controllability for orchestrations, a distinct notion of semi-controllability has been studied in [9,4] for choreographies of services. Finally, while a runtime environment for the orchestration of services has been proposed in [6], this has yet to be realised for the case of choreographies, which could result in improvements in the notion of semi-controllability for choreographies.…”

Section: Related Workmentioning

confidence: 99%

Research Challenges in Orchestration Synthesis

Basile,

ter Beek

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Contract automata allow to formally define the behaviour of service contracts in terms of service offers and requests, some of which are moreover optional and some of which are necessary. A composition of contracts is said to be in agreement if all service requests are matched by corresponding offers. Whenever a composition of contracts is not in agreement, it can be refined to reach an agreement using the orchestration synthesis algorithm. This algorithm is a variant of the synthesis algorithm used in supervisory control theory and it is based on the fact that optional transitions are controllable, whereas necessary transitions are at most semi-controllable and cannot always be controlled. In fact, the resulting orchestration is such that as much of the behaviour in agreement is maintained. In this paper, we discuss recent developments of the orchestration synthesis algorithm for contract automata. Notably, we present a refined notion of semi-controllability and compare it with the original notion by means of examples. We then discuss the current limits of the orchestration synthesis algorithm and identify a number of research challenges together with a research roadmap.

show abstract

Section: Related Workmentioning

confidence: 99%

Research Challenges in Orchestration Synthesis

Basile,

ter Beek

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Contract automata abstract from the way in which an orchestration is realised, and until now no examples of concrete implementations were provided. Previously, in [7], a library called CATLib [13] implementing the operations on contract automata (e.g., composition, synthesis) was presented. A front-end of CATLib for graphically editing and operating on contracts is also available [14], called CAT App.…”

Section: Introductionmentioning

confidence: 99%

A Runtime Environment for Contract Automata

Basile¹,

Beek²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Realising contract-based applications from formal specifications with formal guarantees requires to show the adherence of a specification, the contract, to its implementation. Contract automata have been introduced for specifying contract-based applications and synthesising their orchestrations as finite state automata. This paper introduces CARE, a newly developed library for implementing applications specified via contract automata, providing a runtime environment to coordinate services implementing contracts.

show abstract