Semantic notions of weakly correct AND/XOR business workflows based on partial synchronization

Akhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Workflows coordinate the execution of multiple tasks or services. This paper presents a novel approach to model workflows based on partial synchronization. We develop new notions of weak correctness called semantic correctness and redundancy soundness that permit semantically correct execution instances with some partially finished paths, and show how to deal with them by the notion of transactional "undo". The properties of partial synchronization using strong and weak corresponding pairs are analyzed, and illustrated with realistic examples. An algorithm called WeakVerify is developed to check a workflow for weak correctness properties. This algorithm makes use of an existing algorithm for strict verification. Our design approach mimics how end users think about workflows in practice, and we contrast it with other notions of strict and weak correctness. We compare our approach with various other approaches.

Original languageEnglish (US)
Title of host publicationProceedings - 2011 IEEE International Conference on Services Computing, SCC 2011
Pages128-135
Number of pages8
DOIs
StatePublished - Sep 29 2011
Event2011 IEEE International Conference on Services Computing, SCC 2011 - Washington, DC, United States
Duration: Jul 4 2011Jul 9 2011

Publication series

NameProceedings - 2011 IEEE International Conference on Services Computing, SCC 2011

Other

Other2011 IEEE International Conference on Services Computing, SCC 2011
CountryUnited States
CityWashington, DC
Period7/4/117/9/11

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Semantic notions of weakly correct AND/XOR business workflows based on partial synchronization'. Together they form a unique fingerprint.

Cite this