Automata for Specifying and Orchestrating Service Contracts

Davide Basile; Pierpaolo Degano; Gian-Luigi Ferrari

doi:10.2168/LMCS-12(4:6)2016

Davide Basile ; Pierpaolo Degano ; Gian-Luigi Ferrari - Automata for Specifying and Orchestrating Service Contracts

lmcs:2614 - Logical Methods in Computer Science, April 27, 2017, Volume 12, Issue 4 - https://doi.org/10.2168/LMCS-12(4:6)2016

Automata for Specifying and Orchestrating Service ContractsArticle

Authors: Davide Basile ; Pierpaolo Degano ; Gian-Luigi Ferrari

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.

https://doi.org/10.2168/LMCS-12(4:6)2016

Source: arXiv.org:1607.08363

Volume: Volume 12, Issue 4

Published on: April 27, 2017

Accepted on: December 28, 2016

Submitted on: August 31, 2015

Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory,F.1.2,F.3.1,H.3.5,H.5.3

Licence: arXiv.org - Non-exclusive license to distribute

Bibliographic References

14 Documents citing this article

Davide Basile;Maurice H. ter Beek, arXiv (Cornell University), A Runtime Environment for Contract Automata, pp. 550-567, 2023, 10.1007/978-3-031-27481-7_31, https://arxiv.org/abs/2203.14122.

Maurice H. ter Beek;Guillermina Cledou;Rolf Hennicker;José Proença, Lecture Notes in Computer Science, Can We Communicate? Using Dynamic Logic to Verify Team Automata, pp. 122-141, 2023, 10.1007/978-3-031-27481-7_9.

Davide Basile;Maurice H. ter Beek;Vincenzo Ciancia, Lecture notes in computer science, An Experimental Toolchain for Strategy Synthesis with Spatial Properties, pp. 142-164, 2022, 10.1007/978-3-031-19759-8_10.

Hanen Ochi;Kais Klai, 2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), Checking Composition-Aware Service Substitutability, 2022, Melbourne, Australia, 10.1109/ispa-bdcloud-socialcom-sustaincom57177.2022.00113.

Davide Basile;Maurice H. ter Beek, Lecture notes in computer science, A Clean and Efficient Implementation of Choreography Synthesis for Behavioural Contracts, pp. 225-238, 2021, 10.1007/978-3-030-78142-2_14.

Davide Basile;Maurice H. ter Beek;Pierpaolo Degano;Axel Legay;Gian Luigi Ferrari;et al., Lecture Notes in Computer Science, Supervisory Synthesis of Configurable Behavioural Contracts with Modalities, pp. 177-181, 2021, 10.1007/978-3-030-78089-0_10.

Paolo Bottoni;Anna Labella, 2021, Transactions and contracts based on reaction systems, Theoretical Computer Science, 881, pp. 25-61, 10.1016/j.tcs.2021.07.012.

Davide Basile;Maurice H. ter Beek;Felicita Di Giandomenico;Alessandro Fantechi;Stefania Gnesi;et al., Lecture notes in computer science, 30 Years of Simulation-Based Quantitative Analysis Tools: A Comparison Experiment Between Möbius and Uppaal SMC, pp. 368-384, 2020, 10.1007/978-3-030-61362-4_21.

Davide Basile;Maurice H. ter Beek;Pierpaolo Degano;Axel Legay;Gian Luigi Ferrari;et al., 2020, Controller synthesis of service contracts with variability, Science of Computer Programming, 187, pp. 102344, 10.1016/j.scico.2019.102344, https://doi.org/10.1016/j.scico.2019.102344.

Maurice H. ter Beek;Rolf Hennicker;Jetty Kleijn, Zenodo (CERN European Organization for Nuclear Research), Compositionality of Safe Communication in Systems of Team Automata, pp. 200-220, 2020, 10.1007/978-3-030-64276-1_11, https://zenodo.org/record/4050293.

Claudio Menghi;Paola Spoletini;Marsha Chechik;Carlo Ghezzi, 2019, A verification-driven framework for iterative design of controllers, Formal aspects of computing, 31, 5, pp. 459-502, 10.1007/s00165-019-00484-1, https://doi.org/10.1007/s00165-019-00484-1.

Davide Basile, 2019, Applying supervisory control synthesis to priced featured automata and energy problems, International Journal on Software Tools for Technology Transfer, 21, 6, pp. 679-689, 10.1007/s10009-019-00533-3.

Davide Basile;Maurice H. ter Beek;Axel Legay, 2019, Timed service contract automata, Innovations in systems and software engineering (Print), 16, 2, pp. 199-214, 10.1007/s11334-019-00353-3.

Davide Basile;Rosario Pugliese;Francesco Tiezzi;Pierpaolo Degano;Gian Luigi Ferrari, Lecture notes in computer science, Automata-Based Behavioural Contracts with Action Correlation, pp. 131-151, 2019, 10.1007/978-3-030-30985-5_9.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 1509 times.

This article's PDF has been downloaded 571 times.