An analysis and taxonomy of unstructured workflows

Rong Liu, Akhil Kumar

Research output: Contribution to journalConference article

98 Citations (Scopus)

Abstract

Most workflow tools support structured workflows despite the fact that unstructured workflows can be more expressive. The reason for this is that unstructured workflows are more prone to errors. In this paper, we describe a taxonomy that serves as a framework for analyzing unstructured workflows. The taxonomy organizes unstructured workflows in terms of two considerations: improper nesting and mismatched split-join pairs. Based on this taxonomy we characterize situations that are well-behaved and others that are not. We also discuss well-behaved unstructured workflows that have equivalent structured mappings. Finally, we also introduce a relaxed notion of correctness called quasi-equivalence that is based on one-directional bisimulation. The results of our research will be useful for researchers investigating expressiveness and correctness issues in unstructured workflows.

Original languageEnglish (US)
Pages (from-to)268-284
Number of pages17
JournalLECTURE NOTES IN COMPUTER SCIENCE
Volume3649
StatePublished - Oct 31 2005
Event3rd Internaional Conference on Business Process Management,BPM 2005 - Nancy, France
Duration: Sep 5 2005Sep 8 2005

Fingerprint

Taxonomies
Taxonomy
Work Flow
Correctness
Bisimulation
Tool Support
Expressiveness
Join
Equivalence

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{dbdcb10090364293a91c8fddca443034,
title = "An analysis and taxonomy of unstructured workflows",
abstract = "Most workflow tools support structured workflows despite the fact that unstructured workflows can be more expressive. The reason for this is that unstructured workflows are more prone to errors. In this paper, we describe a taxonomy that serves as a framework for analyzing unstructured workflows. The taxonomy organizes unstructured workflows in terms of two considerations: improper nesting and mismatched split-join pairs. Based on this taxonomy we characterize situations that are well-behaved and others that are not. We also discuss well-behaved unstructured workflows that have equivalent structured mappings. Finally, we also introduce a relaxed notion of correctness called quasi-equivalence that is based on one-directional bisimulation. The results of our research will be useful for researchers investigating expressiveness and correctness issues in unstructured workflows.",
author = "Rong Liu and Akhil Kumar",
year = "2005",
month = "10",
day = "31",
language = "English (US)",
volume = "3649",
pages = "268--284",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

An analysis and taxonomy of unstructured workflows. / Liu, Rong; Kumar, Akhil.

In: LECTURE NOTES IN COMPUTER SCIENCE, Vol. 3649, 31.10.2005, p. 268-284.

Research output: Contribution to journalConference article

TY - JOUR

T1 - An analysis and taxonomy of unstructured workflows

AU - Liu, Rong

AU - Kumar, Akhil

PY - 2005/10/31

Y1 - 2005/10/31

N2 - Most workflow tools support structured workflows despite the fact that unstructured workflows can be more expressive. The reason for this is that unstructured workflows are more prone to errors. In this paper, we describe a taxonomy that serves as a framework for analyzing unstructured workflows. The taxonomy organizes unstructured workflows in terms of two considerations: improper nesting and mismatched split-join pairs. Based on this taxonomy we characterize situations that are well-behaved and others that are not. We also discuss well-behaved unstructured workflows that have equivalent structured mappings. Finally, we also introduce a relaxed notion of correctness called quasi-equivalence that is based on one-directional bisimulation. The results of our research will be useful for researchers investigating expressiveness and correctness issues in unstructured workflows.

AB - Most workflow tools support structured workflows despite the fact that unstructured workflows can be more expressive. The reason for this is that unstructured workflows are more prone to errors. In this paper, we describe a taxonomy that serves as a framework for analyzing unstructured workflows. The taxonomy organizes unstructured workflows in terms of two considerations: improper nesting and mismatched split-join pairs. Based on this taxonomy we characterize situations that are well-behaved and others that are not. We also discuss well-behaved unstructured workflows that have equivalent structured mappings. Finally, we also introduce a relaxed notion of correctness called quasi-equivalence that is based on one-directional bisimulation. The results of our research will be useful for researchers investigating expressiveness and correctness issues in unstructured workflows.

UR - http://www.scopus.com/inward/record.url?scp=27144463739&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27144463739&partnerID=8YFLogxK

M3 - Conference article

VL - 3649

SP - 268

EP - 284

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -