1 / 17

An Efficient Business Process Compiance Checking Approach

An Efficient Business Process Compiance Checking Approach. Jörg Becker, Phillip Bergener, Dominic Breuker, Patrick Delfmann, Matthias Eggert European Research Center for Information Systems Westfälische Wilhelms-Universität Münster. Motivation. Compliance in IS Research.

orpah
Download Presentation

An Efficient Business Process Compiance Checking Approach

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Efficient Business Process Compiance Checking Approach Jörg Becker, Phillip Bergener, Dominic Breuker, Patrick Delfmann, Matthias Eggert European Research Center for Information Systems Westfälische Wilhelms-Universität Münster

  2. Motivation Compliance in IS Research Abdullah, N. S., Indulska, M. and Sadiq, S. (2009). A study of compliance management in information systems research, ECIS'09, Verona, Italy, pp. 1-10. Solvency Act SOX MaRisk Basel II

  3. Agenda Content 1. Idea 2. Algorithmicapproach 3. Modifications

  4. Solution – at a glance Solvency Act

  5. Solution – at a glance

  6. The Algorithm • SubgraphIsomorphism • Well-knownproblemfromgraphtheory • NP-complete… • … but severalpracticalalgorithmsexist • Messmer-BunkeAlgorithm • Preprocessing step: construct a huge index • Search step is very fast •  Preprocessing done once per model, searching is then almost without cost

  7. Agenda Content 1. Idea 2. Algorithmicapproach 3. Modifications

  8. The Algorithm

  9. The Algorithm

  10. The Algorithm

  11. The Algorithm

  12. Agenda Content 1. Idea 2. Algorithmicapproach 3. Modifications

  13. The Algorithm • SubgraphIsomorphism • Well-knownproblemfromgraphtheory • NP-complete… • … but severalpracticalalgorithmsexist • Messmer-BunkeAlgorithm • Preprocessing step: construct a huge index • Search step is very fast •  Preprocessing done once per model, searching is then almost without cost

  14. The Algorithm - Adaptions • Inducessubgraphisomorphism • The patternandmodelgraphedges must matchexactly • Extend search index – add all node configurations • Unproblematic if there are few edges

  15. The Algorithm - Adaptions • Fromedgestopaths • The algorithmmapsedgestoedges, whileweneedtomapedgestopaths • We want to check for prohibited labels on that path • From adjacency matrix to distance matrix • Store for each label if there is a path without this label

  16. Conclusion and Outlook • Computationally efficient, generic solution • Experiments with original algorithm: • Up to 50 nodes in model graphs • Search times in fractions of seconds / Decision tree size in 100s of kilobytes • ToDo’s: Algorithm • Implementation of modified algorithm to actually test performance • ToDo’s: Patterns • Evaluate which activity types / attributes / etc. are required • Develop concrete compliance patterns •  build an appropriate compliance language and encode actual law in form of patterns

  17. Contact Prof. Dr. Jörg Becker E-Mail: becker@ercis.uni-muenster.de Tel.: +49 (0) 251 83-38100 Philipp Bergener E-Mail: philipp.bergener@ercis.uni-muenster.de Tel.: +49 (0) 251 83-38067 Dominic Breuker E-Mail: dominic.breuker@ercis.uni-muenster.de Tel.: +49 (0) 251 83-38062 PD Patrick Delfmann E-Mail: patrick.delfmann@ercis.uni-muenster.de Tel.: +49 (0) 251 83-38083 Mathias Eggert E-Mail: mathias.eggert@ercis.uni-muenster.de Tel.: +49 (0) 251 83-38084

More Related