Skip to main content

Modelling with History-Dependent Petri Nets

  • Conference paper
Business Process Management (BPM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4714))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  Google Scholar 

  2. Best, E., Devillers, R.R.: Sequential and concurrent behaviour in petri net theory. Theoretical Computer Science 55(1), 87–136 (1987)

    Article  MATH  Google Scholar 

  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. Goltz, U., Reisig, W.: The non-sequential behavior of Petri nets. Information and Control 57(2/3), 125–147 (1983)

    Article  MATH  Google Scholar 

  5. Hartmann, J.G.: Predicate/transition nets. In: Advances in Petri Nets, pp. 207–247 (1986)

    Google Scholar 

  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. 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. Montanari, U., Pistore, M.: History-dependent automata: An introduction. In: SFM, pp. 1–28 (2005)

    Google Scholar 

  9. Widom, J., Ceri, S. (eds.): Active Database Systems: Triggers and Rules For Advanced Database Processing. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gustavo Alonso Peter Dadam Michael Rosemann

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Hee, K., Serebrenik, A., Sidorova, N., Voorhoeve, M., van der Werf, J.M. (2007). Modelling with History-Dependent Petri Nets . In: Alonso, G., Dadam, P., Rosemann, M. (eds) Business Process Management. BPM 2007. Lecture Notes in Computer Science, vol 4714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75183-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75183-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75182-3

  • Online ISBN: 978-3-540-75183-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics