Semantics Based Verification and Synthesis of BPEL4WS Abstract Processes

Authors:
Ziyang Duan;Arthur Bernstein;Philip Lewis;Shiyong Lu
Affiliations:
SUNY at Stony Brook, NY;SUNY at Stony Brook, NY;SUNY at Stony Brook, NY;Wayne State University, Detroit, Michigan
Venue:
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Year:
2004

Citing 0
Cited 5

A model for abstract process specification, verification and composition

Proceedings of the 2nd international conference on Service oriented computing
Automatic workflow verification and generation

Theoretical Computer Science
Modular verification of web services using efficient symbolic encoding and summarization

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
A novel graph based approach for automatic composition of high quality grid workflows

Proceedings of the 18th ACM international symposium on High performance distributed computing
Analytical quality assurance

Service research challenges and solutions for the future internet

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a logic model to formally specify the semanticsof workflows and their composite tasks describedas BPEL4WS abstract processes. Based on the model, wepresent a set of inference rules to deduce the strongestpostcondition and weakest precondition of a workflow anddemonstrate that automatic workflow verification is possibledue to the restrictions on data manipulation in an abstractprocess. We then sketch an algorithm that automaticallysynthesizes a workflow given its specification and a task library.