2010
DOI: 10.1007/978-3-642-12186-9_2
|View full text |Cite
|
Sign up to set email alerts
|

Diagnosing and Repairing Data Anomalies in Process Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(35 citation statements)
references
References 13 publications
0
35
0
Order By: Relevance
“…The most common formalisations of BPMN are given via encodings to various formalisms, such as Petri Nets [9], [45], [46], [47], [48], or their extensions such as YAWL [49], [50] and ECATNets [51] [52], and process calculi [10], [53], [11], [54], [12], [55], [56], [57].…”
Section: B Bpmn Formalisation Via Encodingsmentioning
confidence: 99%
“…The most common formalisations of BPMN are given via encodings to various formalisms, such as Petri Nets [9], [45], [46], [47], [48], or their extensions such as YAWL [49], [50] and ECATNets [51] [52], and process calculi [10], [53], [11], [54], [12], [55], [56], [57].…”
Section: B Bpmn Formalisation Via Encodingsmentioning
confidence: 99%
“…If such an activity is executed and its associated precondition is not satisfied, a deadlock may arise. In the work of Awad et al, a method is presented that checks Petri net–based process models for this type of errors. At the same time, the corresponding error patterns (unsatisfiable preconditions, missing match between branching and preconditions, and read/write conflicts for data‐driven objects) and their automated or semiautomated repair are described.…”
Section: State Of the Artmentioning
confidence: 99%
“…For each distinct data class of the process scenario, one place p i and one place q i are added to the collector. Each place p i has transition t as postset 1 . Then, for each final data state of some object life cycle, a transition u i is added to the collector.…”
Section: -Petri Net Integrationmentioning
confidence: 99%
“…[1] introduces a mapping from BPMN to Petri nets based on six rules. Compared to our mapping, the authors duplicate transitions in the Petri net to specify each data constraint of the corresponding activity separately and did not address challenges with respect to parallel data access.…”
Section: -Soundness Checkingmentioning
confidence: 99%