Name
Abstract | ||
|---|---|---|
Assuring compliant business processes is an important task of business process management, which is commonly supported by the use of business process models. As every compliance rule corresponds with a typical structure, the detection of those corresponds to a pattern matching problem. More specifically, we encounter the problem of subgraph isomorphism. In this paper we propose an automatic business process compliance checking approach that relies on a subgraph isomorphism algorithm and that is suitable for process models in general. As common subgraph isomorphism is a problem that can only be solved in exponential time, we use an algorithm that simplifies the problem through pre-processing. This makes the isomorphism solvable in polynomial time. With the approach, we aim at supporting decision makers in business process compliance management. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-24148-2_19 | GOVERNANCE AND SUSTAINABILITY IN INFORMATION SYSTEMS: MANAGING THE TRANSFER AND DIFFUSION OF IT |
Keywords | Field | DocType |
Compliance, Business Process Management, Pattern Matching, Subgraph Isomorphism, Efficiency | Data mining,Business process management,Business process,Maximum common subgraph isomorphism problem,Computer science,Process modeling,Theoretical computer science,Business process modeling,Time complexity,Subgraph isomorphism problem,Business rule | Conference |
Volume | ISSN | Citations |
366 | 1868-4238 | 1 |
PageRank | References | Authors |
0.34 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jörg Becker | 1 | 1323 | 137.64 |
| Philipp Bergener | 2 | 63 | 8.35 |
| Dominic Breuker | 3 | 90 | 13.34 |
| Patrick Delfmann | 4 | 276 | 38.49 |
| Mathias Eggert | 5 | 29 | 5.87 |