Advertisement

Modelling with History-Dependent Petri Nets

  • Kees van Hee
  • Alexander Serebrenik
  • Natalia Sidorova
  • Marc Voorhoeve
  • Jan Martijn van der Werf
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4714)

Abstract

Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We consider processes that not only keep track of their history in a log, but also make decisions based on this log. Extending our previous work on history-dependent Petri nets we propose and evaluate a methodology for modelling processes by such nets and show how history-dependent nets can combine modelling comfort with analysability.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science 323(1-3), 129–189 (2004)zbMATHCrossRefGoogle Scholar
  2. 2.
    Best, E., Devillers, R.R.: Sequential and concurrent behaviour in petri net theory. Theoretical Computer Science 55(1), 87–136 (1987)zbMATHCrossRefGoogle Scholar
  3. 3.
    Ceri, S., Widom, J.: Deriving production rules for constraint maintainance. In: 16th International Conference on Very Large Data Bases, August 13-16, 1990, Brisbane, Queensland, Australia, pp. 566–577 (1990)Google Scholar
  4. 4.
    Goltz, U., Reisig, W.: The non-sequential behavior of Petri nets. Information and Control 57(2/3), 125–147 (1983)zbMATHCrossRefGoogle Scholar
  5. 5.
    Hartmann, J.G.: Predicate/transition nets. In: Advances in Petri Nets, pp. 207–247 (1986)Google Scholar
  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, Springer, Heidelberg (2007)Google Scholar
  7. 7.
    Junttila, T.A.: New canonical representative marking algorithms for place/transition-nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 258–277. Springer, Heidelberg (2004)Google Scholar
  8. 8.
    Montanari, U., Pistore, M.: History-dependent automata: An introduction. In: SFM, pp. 1–28 (2005)Google Scholar
  9. 9.
    Widom, J., Ceri, S. (eds.): Active Database Systems: Triggers and Rules For Advanced Database Processing. Morgan Kaufmann, San Francisco (1996)Google Scholar
  10. 10.
    Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kees van Hee
    • 1
  • Alexander Serebrenik
    • 1
  • Natalia Sidorova
    • 1
  • Marc Voorhoeve
    • 1
  • Jan Martijn van der Werf
    • 1
  1. 1.Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB EindhovenThe Netherlands

Personalised recommendations