Contract Based Behavior Model for Services Coordination

Portilla, Alberto; Vargas-Solar, Genoveva; Collet, Christine; Zechinelli-Martini, José-Luis; García‐Bañuelos, Luciano

doi:10.1007/978-3-540-68262-2_9

Cited by 9 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alberto Portilla et al in [19] proposes an approach that adds transactional behavior to services coordination. For modeling transactional behavior, they introduce a contract based behavior model based on behavior of activities and set of activities.…”

Section: Related Workmentioning

confidence: 99%

Contract-Based Generic Programming Mechanism for Dynamic Service Orchestration

Xie

Xue

Jiang

2014

2014 IEEE International Conference on Computer and Information Technology

View full text Add to dashboard Cite

The fundamental characteristic of service oriented computing is to bind services dynamically and replace failing service automatically at runtime. The challenge is to provide techniques which can support for programming services in an alterable way. The distinct resources that can provide the same services are logically the identical computational entities. In this perspective, a novel service oriented programming mechanism is proposed through defining a high-level abstraction which involves a generic service signature representing those various resources. The novel service oriented programming mechanism focuses on the business process logic but do not care of the concrete technical implementation of resources, so the development of service oriented applications is more convenient. And the generic services are instantiated under the control of contracts, according to the actual execution status of all candidate resources that are invoked in parallel but not the historical QoS experience. Eventually, the suitable service is bound dynamically since the selection policies are executed according to the run-time context of resources. And how to alternate services that throw exceptions is avoided elaborately. The contract-based generic mechanism divides the service-based application development into two uncorrelated parts, and the concrete implementation of resources is separated from how to provide services or consume services. We also give a case study to illustrate the feasibility of the proposed language mechanism.

show abstract

Section: Related Workmentioning

confidence: 99%

Contract-Based Generic Programming Mechanism for Dynamic Service Orchestration

Xie

Xue

Jiang

2014

2014 IEEE International Conference on Computer and Information Technology

View full text Add to dashboard Cite

show abstract

“…The actions depend on the properties expressed by the contract (e.g, signaling a situation to a user, automatically executing recovery or repair actions). Details of contract model can be found in [20,22].…”

Section: Contract Modelmentioning

confidence: 99%

Verifying Atomicity Requirements of Services Coordination Using B

Portilla

Vargas-Solar

García‐Bañuelos

et al. 2008

2008 Mexican International Conference on Computer Science

View full text Add to dashboard Cite

This paper introduces an approach for verifying atomicity requirements in services coordination. In our approach atomicity is expressed orthogonally to services coordination by means of contracts. A services coordination represents an execution order where execution is supposed to be free of problems (e.g., deadlocks and race condition). Such an execution order, is extended by atomicity requirements that deal with exceptional situations. Yet, contracts can introduce new states that should be verified in order prevent deadlocks and and race conditions at execution time and to determine possible termination states. The verification process cannot be done manually due to the number of combination of states. We propose an approach for statically verifying contract based atomic services coordinations using a model checker. The contracts defining the atomicity properties are expressed using the B method. The application logic is expressed using CSP processes. Therefore, the verification process is made by guiding the resulting B machine by the CSP process.

show abstract

“…However, the problem is generally addressed from the QoS side or from the transactional side separately. The conventional QoS-aware composition approaches [3], [4], [5], [6], [7] do not consider the transactional constraints during the composition process, likewise transactional-aware ones [8], [9], [10], [11], [12] do not consider QoS. As far as we know, only [2] proposes a composition model in design-time which captures both aspects in order to evaluate the QoS of a composite WS with various transactional requirements.…”

Section: Introductionmentioning

confidence: 99%

“…Their approach allows resolving the heterogeneity among WSs. The authors of [12] use contracts to express the transactional behavior of a given CWS. To our knowledge, our approach is the only one that selects appropriate transactional component WSs to construct a TCWS that satisfies the user requirements.…”

mentioning

confidence: 99%

TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition

Hadad

Manouvrier

Rukoz

2010

IEEE Trans. Serv. Comput.

282

136

View full text Add to dashboard Cite

Web Services are the most famous implementation of service oriented architectures that has brought some challenging research issues. One of these is the composition, i.e. the capability to recursively construct a composite Web service as a workflow of other existing Web services, which are developed by different organizations and offer diverse functionalities (e.g. ticket purchase, payment), transactional properties (e.g. compensatable or not) and Quality of Service (QoS) values (e.g. execution price, success rate). The selection of a Web service, for each activity of the workflow, meeting the user's requirements, is still an important challenge. Indeed, the selection of one Web service among a set of them that fulfill some functionalities is a critical task, generally depending on a combined evaluation of QoS. However, the conventional QoS-aware composition approaches do not consider the transactional constraints during the composition process. This paper addresses the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics. We propose a selection algorithm that satisfies user's preferences, expressed as weights over QoS criteria and as risk levels defining semantically the transactional requirements. Proofs and experimental results are presented.

show abstract

Contract Based Behavior Model for Services Coordination

Cited by 9 publications

References 12 publications

Contract-Based Generic Programming Mechanism for Dynamic Service Orchestration

Contract-Based Generic Programming Mechanism for Dynamic Service Orchestration

Verifying Atomicity Requirements of Services Coordination Using B

TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition

Contact Info

Product

Resources

About