posted on 2017-01-04, 16:46authored byD. Basile, P. Degano, G. L. Ferrari, E. Tuosto
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.
Funding
This work has been partially supported by the MIUR project Security Horizons and IST-FP7-FET open-IP project ASCENS, by the European Union Seventh Framework Programme under grant agreement No. 295261Mobility between Europe and Argentina applying Logics to Systems (MEALS), and by the COST Action IC1201: Behavioural Types for Reliable Large-Scale Software Systems (BETTY).
History
Citation
Journal of Logical and Algebraic Methods in Programming, 2016, 85 (3), pp. 425-446 (22)
Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science
Version
AM (Accepted Manuscript)
Published in
Journal of Logical and Algebraic Methods in Programming