ITU

Concurrency & Asynchrony in Declarative Workflows

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Standard

Concurrency & Asynchrony in Declarative Workflows. / Debois, Søren; Hildebrandt, Thomas; Slaats, Tijs.

Lecture Notes in Computer Science: Proceedings of 13th International Conference on Business Process Management (BPM 2015). Vol. 9253 Springer, 2015. p. 72-89 (Lecture Notes in Computer Science).

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Harvard

Debois, S, Hildebrandt, T & Slaats, T 2015, Concurrency & Asynchrony in Declarative Workflows. in Lecture Notes in Computer Science: Proceedings of 13th International Conference on Business Process Management (BPM 2015). vol. 9253, Springer, Lecture Notes in Computer Science, pp. 72-89. https://doi.org/10.1007/978-3-319-23063-4_5

APA

Debois, S., Hildebrandt, T., & Slaats, T. (2015). Concurrency & Asynchrony in Declarative Workflows. In Lecture Notes in Computer Science: Proceedings of 13th International Conference on Business Process Management (BPM 2015) (Vol. 9253, pp. 72-89). Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-319-23063-4_5

Vancouver

Debois S, Hildebrandt T, Slaats T. Concurrency & Asynchrony in Declarative Workflows. In Lecture Notes in Computer Science: Proceedings of 13th International Conference on Business Process Management (BPM 2015). Vol. 9253. Springer. 2015. p. 72-89. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-23063-4_5

Author

Debois, Søren ; Hildebrandt, Thomas ; Slaats, Tijs. / Concurrency & Asynchrony in Declarative Workflows. Lecture Notes in Computer Science: Proceedings of 13th International Conference on Business Process Management (BPM 2015). Vol. 9253 Springer, 2015. pp. 72-89 (Lecture Notes in Computer Science).

Bibtex

@inproceedings{964530cf4e614d79b72012b3bdcd3685,
title = "Concurrency & Asynchrony in Declarative Workflows",
abstract = "Declarative or constraint-based business process and workflow notations have received increasing interest in the last decade as possible means of addressing the challenge of supporting at the same time flexibility in execution, adaptability and compliance. However, the definition of concurrent semantics, which is a necessary foundation for asynchronously executing distributed processes, is not obvious for declarative formalisms and is so far virtually unexplored. This is in stark contrast to the very successful Petri-net–based process languages, which have an inherent notion of concurrency. In this paper, we pro- pose a notion of concurrency for declarative process models, formulated in the context of Dynamic Condition Response (DCR) graphs, and exploiting the so-called “true concurrency” semantics of Labelled Asynchronous Transition Systems. We demonstrate how this semantic underpinning of concurrency in DCR Graphs admits asynchronous execution of declarative workflows both conceptually and by reporting on a prototype implementation of a distributed declarative workflow engine. Both the theoretical development and the implementation is supported by an extended example; moreover, the theoretical development has been verified correct in the Isabelle-HOL interactive theorem prover.",
author = "S{\o}ren Debois and Thomas Hildebrandt and Tijs Slaats",
year = "2015",
month = aug,
day = "31",
doi = "10.1007/978-3-319-23063-4_5",
language = "English",
isbn = "978-3319230627",
volume = "9253",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "72--89",
booktitle = "Lecture Notes in Computer Science",
address = "Germany",

}

RIS

TY - GEN

T1 - Concurrency & Asynchrony in Declarative Workflows

AU - Debois, Søren

AU - Hildebrandt, Thomas

AU - Slaats, Tijs

PY - 2015/8/31

Y1 - 2015/8/31

N2 - Declarative or constraint-based business process and workflow notations have received increasing interest in the last decade as possible means of addressing the challenge of supporting at the same time flexibility in execution, adaptability and compliance. However, the definition of concurrent semantics, which is a necessary foundation for asynchronously executing distributed processes, is not obvious for declarative formalisms and is so far virtually unexplored. This is in stark contrast to the very successful Petri-net–based process languages, which have an inherent notion of concurrency. In this paper, we pro- pose a notion of concurrency for declarative process models, formulated in the context of Dynamic Condition Response (DCR) graphs, and exploiting the so-called “true concurrency” semantics of Labelled Asynchronous Transition Systems. We demonstrate how this semantic underpinning of concurrency in DCR Graphs admits asynchronous execution of declarative workflows both conceptually and by reporting on a prototype implementation of a distributed declarative workflow engine. Both the theoretical development and the implementation is supported by an extended example; moreover, the theoretical development has been verified correct in the Isabelle-HOL interactive theorem prover.

AB - Declarative or constraint-based business process and workflow notations have received increasing interest in the last decade as possible means of addressing the challenge of supporting at the same time flexibility in execution, adaptability and compliance. However, the definition of concurrent semantics, which is a necessary foundation for asynchronously executing distributed processes, is not obvious for declarative formalisms and is so far virtually unexplored. This is in stark contrast to the very successful Petri-net–based process languages, which have an inherent notion of concurrency. In this paper, we pro- pose a notion of concurrency for declarative process models, formulated in the context of Dynamic Condition Response (DCR) graphs, and exploiting the so-called “true concurrency” semantics of Labelled Asynchronous Transition Systems. We demonstrate how this semantic underpinning of concurrency in DCR Graphs admits asynchronous execution of declarative workflows both conceptually and by reporting on a prototype implementation of a distributed declarative workflow engine. Both the theoretical development and the implementation is supported by an extended example; moreover, the theoretical development has been verified correct in the Isabelle-HOL interactive theorem prover.

U2 - 10.1007/978-3-319-23063-4_5

DO - 10.1007/978-3-319-23063-4_5

M3 - Article in proceedings

SN - 978-3319230627

VL - 9253

T3 - Lecture Notes in Computer Science

SP - 72

EP - 89

BT - Lecture Notes in Computer Science

PB - Springer

ER -

ID: 80616349