Behaviour-Aware Matching of Cloud Applications

OASIS TOSCA aims at solving the problem of managing complex applications across heterogeneous clouds by providing a standard, vendor-agnostic language to describe them. TOSCA permits defining a cloud application as an orchestration of typed components, which can be instantiated by matching other TOSCA applications. In this paper we first present two types of behaviour-aware matching of applications, based on a notion of simulation. We then relax this notion by permitting to match an operation with a sequence of available operations, and present a coinductive procedure to compute such relaxed simulation.

[1]  Steffen Becker,et al.  Component Composition with Parametric Contracts , 2004 .

[2]  Antonio Brogi,et al.  A Net-based Approach to Web Services Publication and Replaceability , 2009, Fundam. Informaticae.

[3]  Boualem Benatallah,et al.  Protocol-aware matching of web service interfaces for adapter development , 2010, WWW '10.

[4]  Antonio Brogi,et al.  ToscaMart: A method for adapting and reusing cloud applications , 2016, J. Syst. Softw..

[5]  Matthias Klusch,et al.  OWLS-MX: A hybrid Semantic Web service matchmaker for OWL-S services , 2009, J. Web Semant..

[6]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[7]  Antonio Brogi,et al.  Modelling and Analysing Cloud Application Management , 2015, ESOCC.

[8]  Oliver Kopp,et al.  OpenTOSCA - A Runtime for TOSCA-Based Cloud Applications , 2013, ICSOC.

[9]  Paola Inverardi,et al.  Automatic synthesis of modular connectors via composition of protocol mediation patterns , 2013, 2013 35th International Conference on Software Engineering (ICSE).

[10]  Rik Eshuis,et al.  Structural Matching of BPEL Processes , 2007, Fifth European Conference on Web Services (ECOWS'07).

[11]  Simon Moser,et al.  Topology and Orchestration Specification for Cloud Applications Version 1.0 , 2013 .

[12]  Matteo Pradella,et al.  An Automatic Approach to Enable Replacement of Conversational Services , 2009, ICSOC/ServiceWave.

[13]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[14]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[15]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[16]  Antonio Brogi,et al.  Finding available services in TOSCA-compliant clouds , 2016, Sci. Comput. Program..

[17]  Antonio Brogi,et al.  TOSCA in a Nutshell: Promises and Perspectives , 2014, ESOCC.

[18]  Dhavalkumar Thakker,et al.  Semantic-Driven Matchmaking and Composition of Web Services Using Case-Based Reasoning , 2007, ECOWS 2007.

[19]  Valérie Issarny,et al.  Automated Synthesis of Mediators to Support Component Interoperability , 2015, IEEE Transactions on Software Engineering.

[20]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .