Controller synthesis of service contracts with variability.
Saved in:
| Title: | Controller synthesis of service contracts with variability. |
|---|---|
| Authors: | Basile, Davide1,2 (AUTHOR) davide.basile@isti.cnr.it, ter Beek, Maurice H.1 (AUTHOR), Degano, Pierpaolo3 (AUTHOR), Legay, Axel4 (AUTHOR), Ferrari, Gian-Luigi3 (AUTHOR), Gnesi, Stefania1 (AUTHOR), Di Giandomenico, Felicita1 (AUTHOR) |
| Source: | Science of Computer Programming. Feb2020, Vol. 187, pN.PAG-N.PAG. 1p. |
| Subjects: | Service contracts, Supervisory control systems, Control theory (Engineering), Service level agreements, Music orchestration |
| Abstract: | Service contracts characterise the desired behavioural compliance of a composition of services. Compliance is typically defined by the fulfilment of all service requests through service offers, as dictated by a given Service-Level Agreement (SLA). Contract automata are a recently introduced formalism for specifying and composing service contracts. Based on the notion of synthesis of the most permissive controller from Supervisory Control Theory, a safe orchestration of contract automata can be computed that refines a composition into a compliant one. To model more fine-grained SLA and more adaptive service orchestrations, in this paper we endow contract automata with two orthogonal layers of variability: (i) at the structural level, constraints over service requests and offers define different configurations of a contract automaton, depending on which requests and offers are selected or discarded, and (ii) at the behavioural level, service requests of different levels of criticality can be declared, which induces the novel notion of semi-controllability. The synthesis of orchestrations is thus extended to respect both the structural and the behavioural variability constraints. Finally, we show how to efficiently compute the orchestration of all configurations from only a subset of these configurations. A prototypical tool supports the developed theory. [ABSTRACT FROM AUTHOR] |
| Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 141195673 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Controller synthesis of service contracts with variability. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Basile%2C+Davide%22">Basile, Davide</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<i> davide.basile@isti.cnr.it</i><br /><searchLink fieldCode="AR" term="%22ter+Beek%2C+Maurice+H%2E%22">ter Beek, Maurice H.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Degano%2C+Pierpaolo%22">Degano, Pierpaolo</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Legay%2C+Axel%22">Legay, Axel</searchLink><relatesTo>4</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Ferrari%2C+Gian-Luigi%22">Ferrari, Gian-Luigi</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Gnesi%2C+Stefania%22">Gnesi, Stefania</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Di+Giandomenico%2C+Felicita%22">Di Giandomenico, Felicita</searchLink><relatesTo>1</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. Feb2020, Vol. 187, pN.PAG-N.PAG. 1p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Service+contracts%22">Service contracts</searchLink><br /><searchLink fieldCode="DE" term="%22Supervisory+control+systems%22">Supervisory control systems</searchLink><br /><searchLink fieldCode="DE" term="%22Control+theory+%28Engineering%29%22">Control theory (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Service+level+agreements%22">Service level agreements</searchLink><br /><searchLink fieldCode="DE" term="%22Music+orchestration%22">Music orchestration</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Service contracts characterise the desired behavioural compliance of a composition of services. Compliance is typically defined by the fulfilment of all service requests through service offers, as dictated by a given Service-Level Agreement (SLA). Contract automata are a recently introduced formalism for specifying and composing service contracts. Based on the notion of synthesis of the most permissive controller from Supervisory Control Theory, a safe orchestration of contract automata can be computed that refines a composition into a compliant one. To model more fine-grained SLA and more adaptive service orchestrations, in this paper we endow contract automata with two orthogonal layers of variability: (i) at the structural level, constraints over service requests and offers define different configurations of a contract automaton, depending on which requests and offers are selected or discarded, and (ii) at the behavioural level, service requests of different levels of criticality can be declared, which induces the novel notion of semi-controllability. The synthesis of orchestrations is thus extended to respect both the structural and the behavioural variability constraints. Finally, we show how to efficiently compute the orchestration of all configurations from only a subset of these configurations. A prototypical tool supports the developed theory. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=141195673 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.scico.2019.102344 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 1 StartPage: N.PAG Subjects: – SubjectFull: Service contracts Type: general – SubjectFull: Supervisory control systems Type: general – SubjectFull: Control theory (Engineering) Type: general – SubjectFull: Service level agreements Type: general – SubjectFull: Music orchestration Type: general Titles: – TitleFull: Controller synthesis of service contracts with variability. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Basile, Davide – PersonEntity: Name: NameFull: ter Beek, Maurice H. – PersonEntity: Name: NameFull: Degano, Pierpaolo – PersonEntity: Name: NameFull: Legay, Axel – PersonEntity: Name: NameFull: Ferrari, Gian-Luigi – PersonEntity: Name: NameFull: Gnesi, Stefania – PersonEntity: Name: NameFull: Di Giandomenico, Felicita IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 02 Text: Feb2020 Type: published Y: 2020 Identifiers: – Type: issn-print Value: 01676423 Numbering: – Type: volume Value: 187 Titles: – TitleFull: Science of Computer Programming Type: main |
| ResultId | 1 |