On the automatic generation of workflow processes based on product structures
Computers in Industry
Analysis and simulation of Web services
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: The Semantic Web: an evolution for a revolution
Semantic E-Workflow Composition
Journal of Intelligent Information Systems
Constraint Driven Web Service Composition in METEOR-S
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tools for composite web services: a short overview
ACM SIGMOD Record
Modeling service compatibility with pi-calculus for choreography
ER'06 Proceedings of the 25th international conference on Conceptual Modeling
Hi-index | 0.00 |
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the definition of requirement towards service. Such requirement not only constrains the functional semantics on an operation of service, but also constrains the timed and business relation among operations of service. Thus, services fulfilling such requirement can preserve the business and timed relation of the composite process. In order to automatically discover satisfied services, a multilevel matching relation model is defined which includes matching rules on the level of syntactic, functional semantics and behavioral semantics to test whether service is similar to the requirement. And based on such relation model, an algorithm for discovering services for the composite process is proposed. The experimentation shows that the proposed approach can preserve the timed and business relation effectively.