Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/39062
Title: Relating two automata-based models of orchestration and choreography
Authors: Basile, D.
Degano, P.
Ferrari, G. L.
Tuosto, E.
First Published: 2-Oct-2015
Publisher: Elsevier
Citation: Journal of Logical and Algebraic Methods in Programming, 2016, 85 (3), pp. 425-446 (22)
Abstract: We investigate the relations between two automata-based models for describing and studying distributed services, called contract automata and communicating machines. In the first model, distributed services are abstracted away as automata – oblivious of their partners – that coordinate with each other through an orchestrator. The second one is concerned with the interactions occurring between distributed services, that are represented by channel-based asynchronous communications; then services are coordinated through choreography. We define a notion of strong agreement on contract automata; exhibit a natural mapping from this model to communicating machines with a synchronous semantics; and give conditions to ensure that strong agreement corresponds to well-formed choreography. Then these results are extended to a more liberal notion of agreement and to a fully asynchronous semantics of communicating machines.
DOI Link: 10.1016/j.jlamp.2015.09.011
ISSN: 2352-2208
Links: http://www.sciencedirect.com/science/article/pii/S2352220815000930
http://hdl.handle.net/2381/39062
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Creative Commons “Attribution Non-Commercial No Derivatives” licence CC BY-NC-ND, further details of which can be found via the following link: http://creativecommons.org/licenses/by-nc-nd/4.0/ Archived with reference to SHERPA/RoMEO and publisher website.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
SecondRevisedVersion.pdfPost-review (final submitted author manuscript)461.57 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.