Contracts for cross-organizational workflows as timed dynamic condition response graphs

TY - GEN

T1 - Contracts for cross-organizational workflows as timed dynamic condition response graphs

AU - Hildebrandt, Thomas

AU - Mukkamala, Raghava Rao

AU - Slaats, Tijs

AU - Zanitti, Francesco

N1 - Conference code: 5

PY - 2013

Y1 - 2013

N2 - We conservatively extend the declarative Dynamic Condition Response (DCR) Graph process model, introduced in the PhD thesis of the second author, to allow for discrete time deadlines. We prove that safety and liveness properties can be verified by mapping finite timed DCR Graphs to finite state transition systems. We exemplify how deadlines can introduce time-locks and deadlocks and violate liveness. We then prove that the general technique for safe distribution of DCR Graphs provided in previous work can be extended to timed DCR Graphs. We exemplify the use of timed DCR Graphs and the distribution technique in praxis on a timed extension of a cross-organizational case management process arising from a previous case study. The example shows how a timed DCR Graph can be used to describe the global contract for a timed workflow process involving several organizations, which can then be distributed as a network of communicating timed DCR Graphs describing the local contract for each organization.

AB - We conservatively extend the declarative Dynamic Condition Response (DCR) Graph process model, introduced in the PhD thesis of the second author, to allow for discrete time deadlines. We prove that safety and liveness properties can be verified by mapping finite timed DCR Graphs to finite state transition systems. We exemplify how deadlines can introduce time-locks and deadlocks and violate liveness. We then prove that the general technique for safe distribution of DCR Graphs provided in previous work can be extended to timed DCR Graphs. We exemplify the use of timed DCR Graphs and the distribution technique in praxis on a timed extension of a cross-organizational case management process arising from a previous case study. The example shows how a timed DCR Graph can be used to describe the global contract for a timed workflow process involving several organizations, which can then be distributed as a network of communicating timed DCR Graphs describing the local contract for each organization.

U2 - 10.1016/j.jlap.2013.05.005

DO - 10.1016/j.jlap.2013.05.005

M3 - Conference article

SN - 2352-2208

VL - 82

SP - 164

EP - 185

JO - Journal of Logical and Algebraic Methods in Programming

JF - Journal of Logical and Algebraic Methods in Programming

IS - 5-7

T2 - 5th Workshop on Formal Languages and Analysis of Contract-Oriented Software

Y2 - 22 September 2011 through 23 September 2011

ER -