Skip to main content

Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2009)

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

Abstract

In concurrent real-time processes, the speed of individual components has a double impact: on the one hand, the overall latency of a compound process is affected by the latency of its components. But, if the composition has race conditions, the very outcome of the process will also depend on the latency of component processes. Using stochastic Petri nets, we investigate the probability of a transition occurrence being critical for the entire process, i.e. such that a small increase or decrease of the duration of the occurrence entails an increase or decrease of the total duration of the process. The first stage of the analysis focuses on occurrence nets, as obtained by partial order unfoldings, to determine criticality of events; we then lift to workflow nets to investigate criticality of transitions inside a workflow.

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. van der Aalst, W.M.P.: The application of Petri Nets to Workflow Management. Journal of Circuits, Systems and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  3. Abbes, S., Benveniste, A.: True-concurrency probabilistic models: Markov nets and a law of large numbers. Theor. Comput. Sci. 390(2-3), 129–170 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Abbes, S., Benveniste, A.: Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures. Information and Computation 204(2), 231–274 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modeling with Generalized Stochastic Petri Nets. Parallel Computing Series. Wiley, Chichester (1995)

    MATH  Google Scholar 

  6. Benveniste, A., Fabre, E., Haar, S.: Markov Nets: Probabilistic Models for distributed and concurrent systems. IEEE Trans. Aut. Control 48(11), 1936–1950 (2003)

    Article  MathSciNet  Google Scholar 

  7. Bouillard, A., Haar, S., Rosario, S.: Critical paths in the Partial Order Unfolding of a Stochastic Petri Net. INRIA Research report (August 2009)

    Google Scholar 

  8. Bouillard, A., Rosario, S., Benveniste, A., Haar, S.: Monotonicity in Service Orchestrations. Petri Nets (2009), http://petrinets2009.lip6.fr/

  9. Engelfriet, J.: Branching Processes of Petri Nets. Acta Informatica 28, 575–591 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods in System Design 20(3), 285–310 (2002)

    Article  MATH  Google Scholar 

  11. Haas, P.: Stochastic Petri Nets. Modelling, Stability, Simulation. Springer Series in Operations Research, Berlin (2002)

    Google Scholar 

  12. Katoen, J.-P., Baier, C., Latella, D.: Metric semantics for true concurrent real time. Theoretical Computer Science 254, 501–542 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mairesse, J., Gaubert, S.: Modeling and Analysis of Timed Petri Nets using Heaps of Pieces. IEEE Trans. Autom. Control 44(4), 683–697 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. McMillan, K.: Using Unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: 4th Workshop on Computer Aided Verification, pp. 164–174 (1992)

    Google Scholar 

  15. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures, and domains, Part I. TCS 13, 85–108 (1981)

    Article  MATH  Google Scholar 

  16. Ruys, T.C., Langerak, R., Katoen, J.-P., Latella, D., Massink, M.: First passage time analysis of stochastic process algebra using partial orders. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 220–235. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Rosario, S., Benveniste, A., Haar, S., Jard, C.: Probabilistic QoS and soft contracts for transaction based Web services. In: Proceedings ICWS 2007, pp. 126–133 (2007)

    Google Scholar 

  18. Rosario, S., Kitchin, D.E., Benveniste, A., Cook, W., Haar, S., Jard, C.: Event structure semantics of orc. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 154–168. Springer, Heidelberg (2008); long version as INRIA Research Report Nr 6221

    Chapter  Google Scholar 

  19. Tucker, H.G.: An Introduction to probability and mathematical statistics. Academic Press, London (1962)

    MATH  Google Scholar 

  20. Varacca, D., Völzer, H., Winskel, G.: Probabilistic event structures and domains. Theor. Comput. Sci. 358(2-3), 173–199 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouillard, A., Haar, S., Rosario, S. (2009). Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net. In: Ouaknine, J., Vaandrager, F.W. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2009. Lecture Notes in Computer Science, vol 5813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04368-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04368-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04367-3

  • Online ISBN: 978-3-642-04368-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics