2005
DOI: 10.1007/11575771_14
|View full text |Cite
|
Sign up to set email alerts
|

Colored Petri Nets to Verify Extended Event-Driven Process Chains

Abstract: Abstract. Business processes are becoming more and more complex and at the same time their correctness is becoming a critical issue: The costs of errors in business information systems are growing due to the growing scale of their application and the growing degree of automation. In this paper we consider Extended Event-driven Process Chains (eEPCs), a language which is widely used for modeling business processes, documenting industrial reference models and designing workflows. We describe how to translate eEP… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 11 publications
(17 reference statements)
0
5
0
Order By: Relevance
“…As such, the notation has been established as the industry standard for modeling business processes [22]. The basic idea of EPC is that events trigger functions and executed functions trigger events, producing a chain of functions and events, hence the name "event driven process chain" [23].…”
Section: Process Modeling Notationsmentioning
confidence: 99%
“…As such, the notation has been established as the industry standard for modeling business processes [22]. The basic idea of EPC is that events trigger functions and executed functions trigger events, producing a chain of functions and events, hence the name "event driven process chain" [23].…”
Section: Process Modeling Notationsmentioning
confidence: 99%
“…Van Hee, Oanea, and Sidorova discuss a formalization of extended EPCs as they are implemented in the simulation tool of the ARIS Toolset (see [191]) based on a transition system [172]. This transition system is mapped to colored Petri nets in order to be verified with CPN Tools (see [198]).…”
Section: Approaches To Epc Semantics Formalizationmentioning
confidence: 99%
“…Table 2.3 summarizes existing work on the formalization of the OR-join. The solution based on Reset nets seems to be promising from the intuition of its behavior yet it requires extensive calculation effort since it depends upon backward search to decide [78] OR-join must match OR-split [238] Joins as loop entry undefined [349] every-time missing synchronization [349] first-come OR-join can block [349] wait-for-all OR-join as loop entry undefined [218] EPC can be unclean [172] folders with expired timers do not synchronize [11] limited synchronization [464] OR-join may block [266] OR-join loop entries block coverability. Newer approaches impose little or even no restrictions (see [218,11,464]), but exhibit unexpected behavior for OR-block refinements on loops with further OR-joins on it.…”
Section: Approaches To Epc Semantics Formalizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Petri nets are a formalism well known for verifying properties of a model. In [27,28] for example Petri nets are used to formalise event-driven process chains for the description of business processes. While most modelling and simulation tools support the user in checking the syntactical correctness of the model (cf.…”
Section: Introductionmentioning
confidence: 99%