2009 13th Enterprise Distributed Object Computing Conference Workshops 2009
DOI: 10.1109/edocw.2009.5332020
|View full text |Cite
|
Sign up to set email alerts
|

Token analysis of graph-oriented process models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
4
1

Relationship

4
5

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Figure 4. Decomposition of (business) processes [3] The authors of [3] describe an algorithm based on token flow analysis, i.e. tokens which are created and merged at gateways and propagated along the flow direction as can be seen in Figure 3.2.. Tokens originating from the same node converge and are removed (indicated by curly brackets).…”
Section: Business Process Analysismentioning
confidence: 99%
“…Figure 4. Decomposition of (business) processes [3] The authors of [3] describe an algorithm based on token flow analysis, i.e. tokens which are created and merged at gateways and propagated along the flow direction as can be seen in Figure 3.2.. Tokens originating from the same node converge and are removed (indicated by curly brackets).…”
Section: Business Process Analysismentioning
confidence: 99%
“…The Single Entry Region (SER) analysis is introduced by Kienberger et al in (Kienberger et al, 2014) and further refined in (Kienberger et al, 2016). It is based on work of (Ottenstein and Ottenstein, 1984), (Johnson et al, 1994), (Tip, 1995) and (Gotz et al, 2009). The idea is to identify regions having a loose coupling to other parts of the system and therefore be kind of isolated.…”
Section: Single Entry Regionmentioning
confidence: 99%
“…The immense search space can be remarkably reduced by providing a beneficial starting point for the simulation and optimization that are carried out to evaluate the initial solution and to search for further ones. This approach is based on techniques introduced in previous papers, [30][31][32] which were further developed in an approach by Götz et al 33 Since its initial proposition (in Kienberger et al 8 ), the partitioning algorithm was extended to cope with highly complex models:…”
Section: Data Dependency Analysis and Validationmentioning
confidence: 99%