Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
On the coding of ordered graphs
Computing
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A case-based reasoning framework for workflow model management
Data & Knowledge Engineering - Special issue: Advances in business process management
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
A configurable reference modelling language
Information Systems
Measuring similarity between semantic business process models
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
Representation and Structure-Based Similarity Assessment for Agile Workflows
ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Refactoring Process Models in Large Process Repositories
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Measuring Similarity between Business Process Models
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
The refined process structure tree
Data & Knowledge Engineering
Graph Matching Algorithms for Business Process Model Similarity Search
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Aligning business process models
EDOC'09 Proceedings of the 13th IEEE international conference on Enterprise Distributed Object Computing
On the discovery of preferred work practice through business process variants
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Deciding behaviour compatibility of complex correspondences between process models
BPM'10 Proceedings of the 8th international conference on Business process management
Similarity of business process models: Metrics and evaluation
Information Systems
Simplified computation and generalization of the refined process structure tree
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Improving business process models with reference models in business-driven development
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
A survey of schema-based matching approaches
Journal on Data Semantics IV
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
BPEL processes matchmaking for service discovery
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Evaluation of technical measures for workflow similarity based on a pilot study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Survey: An overview on XML similarity: Background, current trends and future directions
Computer Science Review
Business process model repositories - Framework and survey
Information and Software Technology
Structuring acyclic process models
Information Systems
Approximate clone detection in repositories of business process models
BPM'12 Proceedings of the 10th international conference on Business Process Management
Fast detection of exact clones in business process model repositories
Information Systems
Assessing the best-order for business process model refactoring
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Decomposition driven consolidation of process models
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
Context: In order to ensure high quality of a process model repository, refactoring operations can be applied to correct anti-patterns, such as overlap of process models, inconsistent labeling of activities and overly complex models. However, if a process model collection is created and maintained by different people over a longer period of time, manual detection of such refactoring opportunities becomes difficult, simply due to the number of processes in the repository. Consequently, there is a need for techniques to detect refactoring opportunities automatically. Objective: This paper proposes a technique for automatically detecting refactoring opportunities. Method: We developed the technique based on metrics that can be used to measure the consistency of activity labels as well as the extent to which processes overlap and the type of overlap that they have. We evaluated it, by applying it to two large process model repositories. Results: The evaluation shows that the technique can be used to pinpoint the approximate location of three types of refactoring opportunities with high precision and recall and of one type of refactoring opportunity with high recall, but low precision. Conclusion: We conclude that the technique presented in this paper can be used in practice to automatically detect a number of anti-patterns that can be corrected by refactoring.