Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333441 | Journal of Logical and Algebraic Methods in Programming | 2016 | 22 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
D. Basile, P. Degano, G.L. Ferrari, E. Tuosto,