2013
DOI: 10.1007/978-3-642-36285-9_50
|View full text |Cite
|
Sign up to set email alerts
|

A Runtime Analysis of Graph-Theoretical Algorithms to Detect Patterns in Process Model Collections

Abstract: Abstract.Pattern detection serves different purposes in managing large collections of process models, ranging from syntax checking to compliance validation. This paper presents a runtime analysis of four graph-theoretical algorithms for (frequent) pattern detection. We apply these algorithms to large collections of process and data models to demonstrate that, despite their theoretical intractability, they are able to return results within (milli-) seconds. We discuss the relative performance of these algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…While many works applying NLP on conceptual models are concerned with model quality, there are also approaches which aim for eliciting knowledge that is implicitly captured by the model. Examples include the identification of activity correspondences between models [24,6], the discovery of services [46,52] and the elicitation of process patterns [32]. [60,16,8] or they ignore the syntax.…”
Section: State Of the Artmentioning
confidence: 99%
See 1 more Smart Citation
“…While many works applying NLP on conceptual models are concerned with model quality, there are also approaches which aim for eliciting knowledge that is implicitly captured by the model. Examples include the identification of activity correspondences between models [24,6], the discovery of services [46,52] and the elicitation of process patterns [32]. [60,16,8] or they ignore the syntax.…”
Section: State Of the Artmentioning
confidence: 99%
“…To accomplish this, each word of the input element is investigated in the context of a loop (lines [3][4][5][6]. If the considered word carries more than a single part of speech tag, the above introduced technique is used to decide on the actual part of speech (line 5).…”
Section: Ambiguity Resolutionmentioning
confidence: 99%