ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 353, Issues 1-3, 14 March 2006, Pages 71-92
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (315 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2005.10.035    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

Automatic workflow verification and generation

Shiyong Lua, Corresponding Author Contact Information, E-mail The Corresponding Author, Arthur Bernsteinb, E-mail The Corresponding Author and Philip Lewisb, E-mail The Corresponding Author

aDepartment of Computer Science, Wayne State University, Detroit, MI 48202, USA bDepartment of Computer Science, State University of New York, Stony Brook, NY 11790, USA

Received 12 August 2003; 
revised 11 April 2004; 
accepted 7 October 2005. 
Communicated by H. Katsuno. 
Available online 11 November 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Correctness is an important aspect of workflow management systems. However, most of the workflow literature focuses only on the modeling aspects and assumes that a workflow is correct if during the execution it respects the control and data dependency specified by the workflow designer. To address the correctness question properly we propose a new workflow model based on Hoare semantics that allows to: (1) automatically check if the desired outcome of a workflow can be produced by its actual implementation, (2) automatically synthesize a workflow implementation from the workflow specification and a given task library.

In particular we: (1) formalize the semantics of workflows and tasks with pre- and postconditions, (2) for each control construct we provide a set of sound inference rules formalizing its semantics. While most of our workflow constructs are standard, two of them are new: the universal and the existential constructs. We then describe algorithms for automatically checking the correctness of workflows and for automatic workflow generation.

Keywords: Workflow verification; Workflow generation; Workflow correctness; Web services; Hoare logic


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.