Advertisement

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.

Keywords

Compliance Business Process Management Pattern Matching Subgraph Isomorphism Efficiency 

References

  1. Abdullah, S.N., Indulska, M., Sadiq, S.: A Study of Compliance Management in Information Systems Research. In: ECIS, Scholar One, Verona (2009)Google Scholar
  2. Becker, J., Ahrendt, C., Coners, A., Weiss, B., Winkelmann, A.: Business Rule Based Extension of a Semantic Process Modeling Language for Managing Business Process Compliance in the Financial Sector. Lecture Notes in Informatics: Modellierung betrieblicher Informationssysteme (MobIs) 175(1), 201–206 (2010)Google Scholar
  3. Caldwell, F.: The Worldwide Economic Crisis will Bring Real-Time Reporting for Risk Management Gartner Research. Gartner, Inc. (2009) Google Scholar
  4. Caldwell, F., Bace, J., Lotto, R.J.D.: U.S. Financial System Regulatory Overhaul Brings More Scrutiny Gartner Research. Gartner, Inc. (2009) Google Scholar
  5. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)CrossRefGoogle Scholar
  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  7. Governatori, G., Hoffmann, J., Sadiq, S., Weber, I.: Detecting regulatory compliance for business process models through semantic annotations. In: Workshop on Business Process Design, Milan (2008)Google Scholar
  8. Governatori, G., Rotolo, A.: A Conceptually Rich Model of Business Process Compliance. APCCM, Brisbane (2010)Google Scholar
  9. Harary, F.: Graph Theory Reading (1969)Google Scholar
  10. Kharbili, M.E., de Medeiros, A., Stein, S., van Der Aalst, W.M.P.: Business Process Compliance Checking: Current State and Future Challenges. Lecture Notes in Informatics: Modellierung betrieblicher Informationssysteme (MobIs) 141, 107–113 (2008)Google Scholar
  11. Liu, X., Müller, S., Xu, K.: A static compliance-checking framework for business process models. IBM Systems Journal 46(2), 335–361 (2007)CrossRefGoogle Scholar
  12. McKay, B.D.: Practical Graph Isomorphism. Congressus Numerantium: 30), 45–87 (1981) Google Scholar
  13. Messmer, B.T., Bunke, H.: A Decision Tree Approach to Graph and Subgraph Isomorphism Detection. Journal of Pattern Recognition 32(12), 1979–1980 (1999)CrossRefGoogle Scholar
  14. Messmer, B.T., Bunke, H.: Efficient Subgraph Isomorphism Detection: A Decomposition Approach. IEEE Transactions on Knowledge and Data Engineering 12(2), 307–323 (2000)CrossRefGoogle Scholar
  15. Opromolla, G.: Facing the Financial Crisis: Bank of Italy’s Implementing Regulation on Hedge Funds. Journal of Investment Compliance 10(2), 41–44 (2009)CrossRefGoogle Scholar
  16. Sadiq, S., Governatori, G., Namiri, K.: Modeling control objectives for business process compliance. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 149–164. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. Stijin, G., Vanthienen, J.: Designing Compliant Business Processes with Obligations and Permissions. In: Eder, J., Dustdar, S. (eds.) BPM Workshops 2006. LNCS, vol. 4103, pp. 5–14. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the Association for Computing Machinery 23(1), 31–42 (1976)MathSciNetGoogle Scholar
  19. Wörzberger, R., Kurpick, T., Heer, T.: Checking Correctness and Compliance of Integrated Process Models. In: 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 576–583 (2008)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Jörg Becker
    • 1
  • Philipp Bergener
    • 1
  • Dominic Breuker
    • 1
  • Patrick Delfmann
    • 1
  • Mathias Eggert
    • 1
  1. 1.ERCIS – European Research Center for Information SystemsUniversity of MuensterMünsterGermany

Personalised recommendations