Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sap R/3 Process Oriented Implementation
Sap R/3 Process Oriented Implementation
Identifying Similar Code with Program Dependence Graphs
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Clone Detection Using Abstract Syntax Trees
ICSM '98 Proceedings of the International Conference on Software Maintenance
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Comparison and Evaluation of Clone Detection Tools
IEEE Transactions on Software Engineering
Querying business processes with BP-QL
Information Systems
Semantic Querying of Business Process Models
EDOC '08 Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference
Efficient Compliance Checking Using BPMN-Q and Temporal Logic
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Improved model management with aggregated business process models
Data & Knowledge Engineering
The refined process structure tree
Data & Knowledge Engineering
Complete and accurate clone detection in graph-based models
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Instantaneous Soundness Checking of Industrial Business Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Meronymy-based aggregation of activities in business process models
ER'10 Proceedings of the 29th international conference on Conceptual modeling
APROMORE: An advanced process model repository
Expert Systems with Applications: An International Journal
Efficient and accurate retrieval of business process models through indexing
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Survey paper: Refactoring large process model repositories
Computers in Industry
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
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Clone detection in repositories of business process models
BPM'11 Proceedings of the 9th international conference on Business process management
Fragment-based version management for repositories of business process models
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Business Process Model Merging: An Approach to Business Process Consolidation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Efficient querying of large process model repositories
Computers in Industry
Slice, mine and dice: complexity-aware automated discovery of business process models
BPM'13 Proceedings of the 11th international conference on Business Process Management
Simplifying process model abstraction: Techniques for generating model names
Information Systems
Hi-index | 0.00 |
As organizations reach higher levels of business process management maturity, they often find themselves maintaining very large process model repositories, representing valuable knowledge about their operations. A common practice within these repositories is to create new process models, or extend existing ones, by copying and merging fragments from other models. We contend that if these duplicate fragments, a.k.a. exact clones, can be identified and factored out as shared subprocesses, the repository's maintainability can be greatly improved. With this purpose in mind, we propose an indexing structure to support fast detection of clones in process model repositories. Moreover, we show how this index can be used to efficiently query a process model repository for fragments. This index, called RPSDAG, is based on a novel combination of a method for process model decomposition (namely the Refined Process Structure Tree), with established graph canonization and string matching techniques. We evaluated the RPSDAG with large process model repositories from industrial practice. The experiments show that a significant number of non-trivial clones can be efficiently found in such repositories, and that fragment queries can be handled efficiently.