Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

  • Hildebrandt T
  • Mukkamala R
N/ACitations
Citations of this article
52Readers
Mendeley users who have this article in their library.

Abstract

We present Dynamic Condition Response Graphs (DCR Graphs) as a declarative, event-based process model inspired by the workflow language employed by our industrial partner and conservatively generalizing prime event structures. A dynamic condition response graph is a directed graph with nodes representing the events that can happen and arrows representing four relations between events: condition, response, include, and exclude. Distributed DCR Graphs is then obtained by assigning roles to events and principals. We give a graphical notation inspired by related work by van der Aalst et al. We exemplify the use of distributed DCR Graphs on a simple workflow taken from a field study at a Danish hospital, pointing out their flexibility compared to imperative workflow models. Finally we provide a mapping from DCR Graphs to Buchi-automata.

Cite

CITATION STYLE

APA

Hildebrandt, T. T., & Mukkamala, R. R. (2011). Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs. Electronic Proceedings in Theoretical Computer Science, 69, 59–73. https://doi.org/10.4204/eptcs.69.5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free