Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules
The number of process models in process repositories has grown in recent years. For this reason, it is becoming increasingly important to efficiently retrieve process models from the repositories for management purposes. In fact, the method of retrieval is also essential to increase the potential of...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9507485/ |
id |
doaj-84ab5879a0c343a9b4832778144d377c |
---|---|
record_format |
Article |
spelling |
doaj-84ab5879a0c343a9b4832778144d377c2021-08-16T23:00:17ZengIEEEIEEE Access2169-35362021-01-01911204311205610.1109/ACCESS.2021.31026349507485Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive RulesN. Long Ha0https://orcid.org/0000-0002-5673-2812Thomas M. Prinz1https://orcid.org/0000-0001-9602-3482Department of Information and Communication Systems, Inje University, Gimhae, Republic of KoreaCourse Evaluation Service, Friedrich Schiller University Jena, Jena, GermanyThe number of process models in process repositories has grown in recent years. For this reason, it is becoming increasingly important to efficiently retrieve process models from the repositories for management purposes. In fact, the method of retrieval is also essential to increase the potential of additional analysis such as similarity and behavioral analysis and compliance checking. Most retrieval methods can be classified as structural or behavioral retrieval. Behavioral retrieval considers the relationships between activities during process execution. In this paper, we introduce such a new behavior-based retrieval method called <italic>Partitioning Behavioral Retrieval</italic>. It is the first retrieval method that allows process models to contain inclusive (OR) gateways. The method is based on the dominance relation and a node-based process structure tree known from compiler theory. Although it uses instance subgraph checking as a computational basis, it derives new behavioral relations by using transitive rules. Currently, the method is limited to acyclic process models for ease of introduction. Experiments show the time advantage offered by our new method.https://ieeexplore.ieee.org/document/9507485/Behavioral querybusiness process modeldominance relationprocess repositorystructural decomposition |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
N. Long Ha Thomas M. Prinz |
spellingShingle |
N. Long Ha Thomas M. Prinz Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules IEEE Access Behavioral query business process model dominance relation process repository structural decomposition |
author_facet |
N. Long Ha Thomas M. Prinz |
author_sort |
N. Long Ha |
title |
Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules |
title_short |
Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules |
title_full |
Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules |
title_fullStr |
Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules |
title_full_unstemmed |
Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules |
title_sort |
partitioning behavioral retrieval: an efficient computational approach with transitive rules |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2021-01-01 |
description |
The number of process models in process repositories has grown in recent years. For this reason, it is becoming increasingly important to efficiently retrieve process models from the repositories for management purposes. In fact, the method of retrieval is also essential to increase the potential of additional analysis such as similarity and behavioral analysis and compliance checking. Most retrieval methods can be classified as structural or behavioral retrieval. Behavioral retrieval considers the relationships between activities during process execution. In this paper, we introduce such a new behavior-based retrieval method called <italic>Partitioning Behavioral Retrieval</italic>. It is the first retrieval method that allows process models to contain inclusive (OR) gateways. The method is based on the dominance relation and a node-based process structure tree known from compiler theory. Although it uses instance subgraph checking as a computational basis, it derives new behavioral relations by using transitive rules. Currently, the method is limited to acyclic process models for ease of introduction. Experiments show the time advantage offered by our new method. |
topic |
Behavioral query business process model dominance relation process repository structural decomposition |
url |
https://ieeexplore.ieee.org/document/9507485/ |
work_keys_str_mv |
AT nlongha partitioningbehavioralretrievalanefficientcomputationalapproachwithtransitiverules AT thomasmprinz partitioningbehavioralretrievalanefficientcomputationalapproachwithtransitiverules |
_version_ |
1721205620953055232 |