On-the-Fly Auditing of Business Processes

  • Kees van Hee
  • Jan Hidders
  • Geert-Jan Houben
  • Jan Paredaens
  • Philippe Thiran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6550)


Information systems supporting business processes are usually very complex. If we have to ensure that certain business rules are enforced in a business process, it is often easier to design a separate system, called a monitor, that collects the events of the business processes and verifies whether the rules are satisfied or not. This requires a business rule language (BRL) that allows to verify business rules over finite histories. We introduce such a BRL and show that it can express many common types of business rules. We introduce two interesting properties of BRL formulas: the future stability and the past stability. The monitor should be able to verify the business rules over the complete history, which is increasing over time. Therefore we consider abstractions of the history. Actually we generate from a set of business rules a labeled transition system (with countable state space) that can be executed by the monitor if each relevant event of the business process triggers a step in the labeled transition system. As long as the monitor is able to execute a step, the business rules are not violated. We show that for a sublanguage of BRL, we can transform the labeled transition system into a colored Petri net such that verification becomes independent of the history length.


Business Process Label Transition System Business Rule Variable Binding Authorization Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Romney, M.B., Steinbart, P.J.: Accounting Information Systems. 11 edn. Pearson International Editions (2009)Google Scholar
  2. 2.
    Geerts, G.L., McCarthy, W.E.: An ontological analysis of the economic primitives of the extended-REA enterprise information architecture. International Journal of Accounting Information Systems 3(1), 1–16 (2002)CrossRefGoogle Scholar
  3. 3.
    McCarthy, W.E.: The REA accounting model: A generalized framework for accounting systems in a shared data environment. The Accounting Review 57(3), 554–578 (1982)Google Scholar
  4. 4.
    Berg, D.: Turning Sarbanes-Oxley projects into strategic business processes. Sarbanes-Oxley Compliance Journal (2004)Google Scholar
  5. 5.
    IFRS Foundation: The International Accounting Standards Board Web Site (2010),
  6. 6.
    van Hee, K.M., Serebrenik, A., Sidorova, N., van der Aalst, W.M.P.: History-dependent petri nets. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 164–183. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Jensen, K.: Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2. Springer, London (1995)zbMATHGoogle Scholar
  8. 8.
    van Hee, K.M.: Information Systems Engineering, a Formal Approach. Cambridge University Press, New York (1994)zbMATHGoogle Scholar
  9. 9.
    van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods and Systems. MIT Press, Cambridge (2002)Google Scholar
  10. 10.
    van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  11. 11.
    Girault, C., Valk, R.: Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications. Springer, New York (2001)zbMATHGoogle Scholar
  12. 12.
    Darondeau, P.: Deriving Unbounded Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533–548. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  13. 13.
    van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process Discovery Using Integer Linear Programming. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 368–387. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Ross, S.: Introduction to Probability Models. Academic Press, London (2007)Google Scholar
  15. 15.
    Jensen, K., Kristensen, L.: Coloured Petri nets: modelling and validation of concurrent systems. Springer, Heidelberg (2009)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kees van Hee
    • 1
  • Jan Hidders
    • 2
  • Geert-Jan Houben
    • 2
  • Jan Paredaens
    • 3
  • Philippe Thiran
    • 4
  1. 1.Department of Mathematics and Computer ScienceEindhoven University of TechnologyThe Netherlands
  2. 2.Department of Electrical Engineering, Mathematics and Computer ScienceDelft University of TechnologyThe Netherlands
  3. 3.Department of Mathematics and Computer ScienceUniversity of AntwerpBelgium
  4. 4.Faculty of Computer ScienceUniversity of NamurBelgium

Personalised recommendations