Document - Automata for specifying and orchestrating service contracts

2016

Journal article Open Access

Automata for specifying and orchestrating service contracts

Basile D., Degano P., Ferrari G.

Services Theoretical Computer Science Model General Computer Science Verification Contracts

An approach to the formal description of service contracts is presented in terms of automata. We focus on the basic property of guaranteeing that in the multi-party composition of principals each of them gets his requests satisfied, so that the overall composition reaches its goal. Depending on whether requests are satisfied synchronously or asynchronously, we construct an orchestrator that at static time either yields composed services enjoying the required properties or detects the principals responsible for possible violations. To do that in the asynchronous case we resort to Linear Programming techniques. We also relate our automata with two logically based methods for specifying contracts.

Source: Logical Methods in Computer Science 12 (2016). doi:10.2168/LMCS-12(4:6)2016

Publisher: Technische Universität Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany, Germania

Metrics

Back to previous page

Cite as

BibTeX entry

@article{oai:it.cnr:prodotti:366878,
	title = {Automata for specifying and orchestrating service contracts},
	author = {Basile D. and Degano P. and Ferrari G.},
	publisher = {Technische Universität Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany, Germania},
	doi = {10.2168/lmcs-12(4:6)2016},
	journal = {Logical Methods in Computer Science},
	volume = {12},
	year = {2016}
}