Formalization and verification of EPCs with OR-joins based on state and context

J. Mendling; W.M.P. Aalst, van der

doi:10.1007/978-3-540-72988-4_31

Formalization and verification of EPCs with OR-joins based on state and context

J. Mendling
, W.M.P. Aalst, van der

Information Systems IE&IS

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

72 Citations (Scopus)

228 Downloads (Pure)

Abstract

The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two major problems. First, several formalizations depend upon restrictions of the EPC to a subset. Second, several approaches contradict the modeling intuition since the structuredness of the process does not guarantee soundness. In this paper, we present a novel semantical definition of EPCs that addresses these aspects yielding a formalization that is applicable for all EPCs and for which structuredness is a sufficient condition for soundness. Furthermore, we introduce a set of reduction rules for the verification of an EPC-specific soundness criterion and present a respective implementation.

Original language	English
Title of host publication	Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway
Editors	J. Krogstie, A.L. Opdahl, G. Sindre
Place of Publication	Berlin
Publisher	Springer
Pages	439-453
ISBN (Print)	978-3-540-72987-7
DOIs	https://doi.org/10.1007/978-3-540-72988-4_31
Publication status	Published - 2007
Event	19th International Conference on Advanced Information Systems Engineering (CAiSE 2009) - Trondheim, Norway Duration: 11 Jun 2007 → 15 Jun 2007 Conference number: 19

Publication series

Name	Lecture Notes in Computer Science
Volume	4495
ISSN (Print)	0302-9743

Conference

Conference	19th International Conference on Advanced Information Systems Engineering (CAiSE 2009)
Abbreviated title	CAiSE '07
Country/Territory	Norway
City	Trondheim
Period	11/06/07 → 15/06/07

Access to Document

10.1007/978-3-540-72988-4_31

Metis207849Final published version, 794 KB

Cite this

Mendling, J., & Aalst, van der, W. M. P. (2007). Formalization and verification of EPCs with OR-joins based on state and context. In J. Krogstie, A. L. Opdahl, & G. Sindre (Eds.), Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway (pp. 439-453). (Lecture Notes in Computer Science; Vol. 4495). Springer. https://doi.org/10.1007/978-3-540-72988-4_31

Mendling, J. ; Aalst, van der, W.M.P. / Formalization and verification of EPCs with OR-joins based on state and context. Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway. editor / J. Krogstie ; A.L. Opdahl ; G. Sindre. Berlin : Springer, 2007. pp. 439-453 (Lecture Notes in Computer Science).

@inproceedings{7aff8482fdd34b778e4fff012b5b3a79,

title = "Formalization and verification of EPCs with OR-joins based on state and context",

abstract = "The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two major problems. First, several formalizations depend upon restrictions of the EPC to a subset. Second, several approaches contradict the modeling intuition since the structuredness of the process does not guarantee soundness. In this paper, we present a novel semantical definition of EPCs that addresses these aspects yielding a formalization that is applicable for all EPCs and for which structuredness is a sufficient condition for soundness. Furthermore, we introduce a set of reduction rules for the verification of an EPC-specific soundness criterion and present a respective implementation.",

author = "J. Mendling and \{Aalst, van der\}, W.M.P.",

year = "2007",

doi = "10.1007/978-3-540-72988-4\_31",

language = "English",

isbn = "978-3-540-72987-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "439--453",

editor = "J. Krogstie and A.L. Opdahl and G. Sindre",

booktitle = "Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway",

address = "Germany",

note = "19th International Conference on Advanced Information Systems Engineering (CAiSE 2009), CAiSE '07 ; Conference date: 11-06-2007 Through 15-06-2007",

}

Mendling, J & Aalst, van der, WMP 2007, Formalization and verification of EPCs with OR-joins based on state and context. in J Krogstie, AL Opdahl & G Sindre (eds), Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway. Lecture Notes in Computer Science, vol. 4495, Springer, Berlin, pp. 439-453, 19th International Conference on Advanced Information Systems Engineering (CAiSE 2009), Trondheim, Norway, 11/06/07. https://doi.org/10.1007/978-3-540-72988-4_31

Formalization and verification of EPCs with OR-joins based on state and context. / Mendling, J.; Aalst, van der, W.M.P.
Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway. ed. / J. Krogstie; A.L. Opdahl; G. Sindre. Berlin: Springer, 2007. p. 439-453 (Lecture Notes in Computer Science; Vol. 4495).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Formalization and verification of EPCs with OR-joins based on state and context

AU - Mendling, J.

AU - Aalst, van der, W.M.P.

N1 - Conference code: 19

PY - 2007

Y1 - 2007

N2 - The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two major problems. First, several formalizations depend upon restrictions of the EPC to a subset. Second, several approaches contradict the modeling intuition since the structuredness of the process does not guarantee soundness. In this paper, we present a novel semantical definition of EPCs that addresses these aspects yielding a formalization that is applicable for all EPCs and for which structuredness is a sufficient condition for soundness. Furthermore, we introduce a set of reduction rules for the verification of an EPC-specific soundness criterion and present a respective implementation.

AB - The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two major problems. First, several formalizations depend upon restrictions of the EPC to a subset. Second, several approaches contradict the modeling intuition since the structuredness of the process does not guarantee soundness. In this paper, we present a novel semantical definition of EPCs that addresses these aspects yielding a formalization that is applicable for all EPCs and for which structuredness is a sufficient condition for soundness. Furthermore, we introduce a set of reduction rules for the verification of an EPC-specific soundness criterion and present a respective implementation.

U2 - 10.1007/978-3-540-72988-4_31

DO - 10.1007/978-3-540-72988-4_31

M3 - Conference contribution

SN - 978-3-540-72987-7

T3 - Lecture Notes in Computer Science

SP - 439

EP - 453

BT - Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway

A2 - Krogstie, J.

A2 - Opdahl, A.L.

A2 - Sindre, G.

PB - Springer

CY - Berlin

T2 - 19th International Conference on Advanced Information Systems Engineering (CAiSE 2009)

Y2 - 11 June 2007 through 15 June 2007

ER -

Mendling J, Aalst, van der WMP. Formalization and verification of EPCs with OR-joins based on state and context. In Krogstie J, Opdahl AL, Sindre G, editors, Proceedings of the 19th International Conference on Advanced Information Systems Engineering (CAiSE 2007) 11-15 June 2007, Trondheim, Norway. Berlin: Springer. 2007. p. 439-453. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-72988-4_31

Formalization and verification of EPCs with OR-joins based on state and context

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this