English

Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

Logic in Computer Science 2011-10-20 v1 Formal Languages and Automata Theory Programming Languages

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

@article{arxiv.1110.4161,
  title  = {Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs},
  author = {Thomas T. Hildebrandt and Raghava Rao Mukkamala},
  journal= {arXiv preprint arXiv:1110.4161},
  year   = {2011}
}

Comments

In Proceedings PLACES 2010, arXiv:1110.3853

R2 v1 2026-06-21T19:22:31.726Z