DocumentCode
2700984
Title
Timing Constraints Specification and Verification for Web Service Compositions
Author
Dai, Guilan ; Liu, Rujuan ; Zhao, Chongchong ; Hu, Changjun
Author_Institution
Res. Inst. of InformationTechnology, Tsinghiia Univ., Beijing
fYear
2008
fDate
9-12 Dec. 2008
Firstpage
315
Lastpage
322
Abstract
Web service composition is an emerging paradigm for enabling application integration within and across organizational boundaries. Since most business processes exist in temporal context in real world, and the candidate partners in Web service compositions have complex interactions, timing constraints satisfiability verification for Web service compositions becomes increasingly important to build efficient and effective business processes based on Web services. In this paper, we present an approach to specify and verify timing constraints satisfiability for the compositions of Web services workflow based on BPEL4WS(Business Process Execution Language for Web Services). By using timing constraints annotation layers, a BPEL4WS model can be extended with timing constraint information. The pair of an underlying BPEL4WS model and a timing constraint annotation layer can be transformed to corresponding TPPN (Timed Predicate Petri-net) model to verify automatically timing constraint satisfiability for a business process. The method allows us to add conveniently timing constraints information to a business process model,and find whether a process is schedulable and which activities in the process are not schedulable under the consideration of timing constraints without actual execution based on its specification. The paper describes how to specify timing constraints for compositions of Web services workflow, and how to determine whether the specification satisfies its timing constraints.
Keywords
Petri nets; business data processing; formal specification; formal verification; scheduling; BPEL4WS; Business Process Execution Language; Web service workflow composition; business process model; scheduling; timed predicate Petri-net; timing constraint satisfiability verification; timing constraint specification; Assembly systems; Context-aware services; Distributed computing; Information analysis; Isolation technology; Microstrip; Scheduling; Testing; Timing; Web services; TPPN; Timing constraints; Web service compositions;
fLanguage
English
Publisher
ieee
Conference_Titel
Asia-Pacific Services Computing Conference, 2008. APSCC '08. IEEE
Conference_Location
Yilan
Print_ISBN
978-0-7695-3473-2
Electronic_ISBN
978-0-7695-3473-2
Type
conf
DOI
10.1109/APSCC.2008.59
Filename
4780694
Link To Document