Skip to Main content Skip to Navigation
Conference papers

An Efficient Business Process Compliance Checking Approach

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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01571720
Contributor : Hal Ifip <>
Submitted on : Thursday, August 3, 2017 - 2:33:53 PM
Last modification on : Thursday, March 5, 2020 - 4:47:08 PM

File

978-3-642-24148-2_19_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Jörg Becker, Philipp Bergener, Dominic Breuker, Patrick Delfmann, Mathias Eggert. An Efficient Business Process Compliance Checking Approach. Governance and Sustainability in Information Systems: Managing the Transfer and Diffusion of IT (Working conference), Sep 2011, Hamburg, Germany. pp.282-287, ⟨10.1007/978-3-642-24148-2_19⟩. ⟨hal-01571720⟩

Share

Metrics

Record views

760

Files downloads

286