ITU
ITU

Contracts for Cross-organizational Workflows as Timed Dynamic Condition Response Graphs

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Standard

Contracts for Cross-organizational Workflows as Timed Dynamic Condition Response Graphs. / Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs; Zanitti, Francesco.

In: Journal of Logic and Algebraic Programming, Vol. 82, 2013, p. 164–185.

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{a1a7a4b7d5554de89aaa31d2c799af0b,
title = "Contracts for Cross-organizational Workflows as Timed Dynamic Condition Response Graphs",
abstract = "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.",
author = "Thomas Hildebrandt and Mukkamala, {Raghava Rao} and Tijs Slaats and Francesco Zanitti",
note = "Special Issue: FLACOS 2011",
year = "2013",
language = "English",
volume = "82",
pages = "164–185",
journal = "Journal of Logic and Algebraic Programming",
issn = "1567-8326",
publisher = "Elsevier",

}

RIS

TY - JOUR

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 - Special Issue: FLACOS 2011

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.

M3 - Journal article

VL - 82

SP - 164

EP - 185

JO - Journal of Logic and Algebraic Programming

JF - Journal of Logic and Algebraic Programming

SN - 1567-8326

ER -

ID: 37342467