Composite process oriented service discovery in preserving business and timed relation

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. Categories a...

• Type: Conference
• Year: 2008
• Where: WWW
• Authors: Yu Dai, Lei Yang, Bin Zhang, Kening Gao
• Keywords: Composite Process, Internet Technology, Multilevel Matching Relation, Process Oriented Service, WWW 2008