Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

Thomas T. Hildebrandt
(IT University of Copenhagen)
Raghava Rao Mukkamala
(IT University of Copenhagen)

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.

In Kohei Honda and Alan Mycroft: Proceedings Third Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software (PLACES 2010), Paphos, Cyprus, 21st March 2010, Electronic Proceedings in Theoretical Computer Science 69, pp. 59–73.
Published: 18th October 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.69.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org