Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
A timed workflow process model
Journal of Systems and Software
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Representing, analysing and managing web service protocols
Data & Knowledge Engineering - Special issue: ER 2004
Semi-automated adaptation of service interactions
Proceedings of the 16th international conference on World Wide Web
Deriving Protocol Models from Imperfect Service Conversation Logs
IEEE Transactions on Knowledge and Data Engineering
Developing Process Mediator for Supporting Mediated Web Service Interactions
ECOWS '08 Proceedings of the 2008 Sixth European Conference on Web Services
Control and data dependencies in business processes based on semantic business activities
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Data & Knowledge Engineering
SKG '09 Proceedings of the 2009 Fifth International Conference on Semantics, Knowledge and Grid
Adapt or perish: algebra and visual notation for service interface adaptation
BPM'06 Proceedings of the 4th international conference on Business Process Management
Developing adapters for web services integration
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
In this paper we propose a new kind of adaptability assessment that determines whether service protocols of a requestor and a provider are adaptable, computes their adaptation degree, and identifies conditions that determine when they can be adapted. We also propose a technique that implements this adaptability assessment: (1) we construct a complete adaptation graph that captures all service interactions adaptable between these two service protocols. The emptiness or non-emptiness of this graph corresponds to the fact that whether or not they are adaptable; (2) we propose a novel path computation technique to generate all instance sub-protocols which reflect valid executions of a particular service protocol, and to derive all instance sub-protocol pairs captured by the complete adaptation graph. An adaptation degree is computed as a ratio between the number of instance sub-protocols captured by these instance sub-protocol pairs with respect to a service protocol and that of this service protocol; (3) and finally we identify a set of conditions based on these instance sub-protocol pairs. A condition is the conjunction of all conditions specified on the transitions of a given pair of instance sub-protocols. This assessment is a comprehensive means of selecting the suitable service protocol among functionally-equivalent candidates according to the requestor's business requirements.