Skip to main content

History-Dependent Stochastic Petri Nets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5947))

Abstract

Stochastic Petri Nets are a useful and well-known tool for performance analysis. However, an implicit assumption in the different types of Stochastic Petri Nets is the Markov property. It is assumed that a choice in the Petri net only depends on the current state and not on earlier choices. For many real-life processes, choices made in the past can influence choices made later in the process. For example, taking one more iteration in a loop might increase the probability to leave the loop, etc. In this paper, we introduce a novel framework where probability distributions depend not only on the marking of the net, but also on the history of the net. We also describe a number of typical abstraction functions for capturing relevant aspects of the net’s history and show how we can discover the probabilistic mechanism from event logs, i.e. real-life observations are used to learn relevant correlations. Finally, we present how our nets can be modelled and simulated using CPN Tools and discuss the results of some simulation experiments.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow Mining: A Survey of Issues and Approaches. Data and Knowledge Engineering 47(2), 237–267 (1996)

    Google Scholar 

  2. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  3. Florin, G., Natkin, S.: Les Reseaux de Petri Stochastiques. Technique et Science Informatiques 4(1), 143–160 (1985)

    MATH  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS monographs on Theoretical Computer Science. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  6. Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems. International Journal on Software Tools for Technology Transfer 9(3-4), 213–254 (2007)

    Article  Google Scholar 

  7. Kolmogorov, A.: Moscow Univ. Math. Bull.  1 (1937)

    Google Scholar 

  8. Ajmone Marsan, M., Balbo, G., Chiola, G., Conte, G.: Generalized Stochastic Petri Nets Revisited: Random Switches and Priorities. In: PNPM 1987: The Proceedings of the Second International Workshop on Petri Nets and Performance Models, Washington, DC, USA, pp. 44–53. IEEE Computer Society, Los Alamitos (1987)

    Google Scholar 

  9. Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. ACM SIGMETRICS Perform. Eval. Rev. 26(2), 2 (1998)

    Article  Google Scholar 

  10. Molloy, M.K.: On the Integration of Delay and Throughput Measures in Distributed Processing Models. PhD thesis, University of California, Los Angeles (1981)

    Google Scholar 

  11. Neveu, J.: Mathematical Foundations of the Calculus of Probability. Holden-day (1965)

    Google Scholar 

  12. Ross, S.M.: Introduction to Probability Models, 9th edn. Academic Press, Inc., Orlando (2006)

    MATH  Google Scholar 

  13. Rozinat, A., Mans, R.S., Song, M., van der Aalst, W.M.P.: Discovering Colored Petri Nets From Event Logs. International Journal on Software Tools for Technology Transfer 10(1), 57–74 (2008)

    Article  Google Scholar 

  14. Schonenberg, H., Weber, B., van Dongen, B.F., van der Aalst, W.M.P.: Supporting Flexible Processes Through Recommendations Based on History. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 51–66. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Symons, F.J.W.: Modelling and Analysis of Communication Protocols Using Numerical Petri Nets. 152, Ph.D. Thesis, Univ. of Essex, Dep. of Electr. Engineering Science, Telecommunication Systems Group (May 1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schonenberg, H., Sidorova, N., van der Aalst, W., van Hee, K. (2010). History-Dependent Stochastic Petri Nets. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2009. Lecture Notes in Computer Science, vol 5947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11486-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11486-1_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11485-4

  • Online ISBN: 978-3-642-11486-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics