Towards dynamic matching of business-level protocols in adaptive service compositions

Authors:
Alan Colman;Linh Duy Pham;Jun Han;Jean-Guy Schneider
Affiliations:
Faculty of ICT, Swinburne University of Technology, Hawthorn, Australia;Faculty of ICT, Swinburne University of Technology, Hawthorn, Australia;Faculty of ICT, Swinburne University of Technology, Hawthorn, Australia;Faculty of ICT, Swinburne University of Technology, Hawthorn, Australia
Venue:
BPM'07 Proceedings of the 2007 international conference on Business process management
Year:
2007

Citing 7
Cited 0

Making Components Contract Aware

Computer
Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Consistency and Interoperability Checking for Component Interaction Rules

APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Using role-based coordination to achieve software adaptability

Science of Computer Programming
Dynamic Protocol Aggregation and Adaptation for Service-Oriented Computing

ASWEC '07 Proceedings of the 2007 Australian Software Engineering Conference
COCOA: ConversationBased Service Composition for Pervasive Computing Environments

PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
Pattern based property specification and verification for service composition

WISE'06 Proceedings of the 7th international conference on Web Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service composition those behavioural requirements may be continually changing. This paper shows how the behavioural requirements in abstract service definitions (roles) can be dynamically and incrementally defined using constraints. These constraints are then used to generate finite state automata, which are used to check the compatibility of candidate services that have their behaviour expressed in static interface descriptions such as OWL-S.