2011/10/19 by Thomas T. Hildebrandt, Raghava Rao Mukkamala
Computer Science · #cs.LO #cs.FL #cs.PL
paper · pdf · doi:10.4204/eptcs.69.5
published as EPTCS 69, 2011, pp. 59-73 · In Proceedings PLACES 2010, arXiv:1110.3853
arxiv created 2011/10/19 · arxiv updated 2011/10/20
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.