Discrete-Time Markovian Stochastic Petri Nets

  • Gianfranco Ciardo

Abstract

We revisit and extend the original definition of discrete-time stochastic Petri nets, by allowing the firing times to have a “defective discrete phase distribution”. We show that this formalism still corresponds to an underlying discrete-time Markov chain. The structure of the state for this process describes both the marking of the Petri net and the phase of the firing time for of each transition, resulting in a large state space. We then modify the well-known power method to perform a transient analysis even when the state space is infinite, subject to the condition that only a finite number of states can be reached in a finite amount of time. Since the memory requirements might still be excessive, we suggest a bounding technique based on truncation.

Keywords

Lime Convolution Arena 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. S. Adve and M. K. Vernon. The influence of random delays on parallel execution times. In Proc. 1993 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Santa Clara, CA, May 1993.Google Scholar
  2. [2]
    T. Agerwala. A complete model for representing the coordination of asynchronous processes. Hopkins Computer Research Report 32, Johns Hopkins University, Baltimore, Maryland, July 1974.CrossRefGoogle Scholar
  3. [3]
    M. Ajmone Marsan, G. Balbo, and G. Conte. A class of Generalized Stochastic Petri Nets for the performance evaluation of multiprocessor systems. ACM Trans. Comp. Syst., 2(2):93–122, May 1984.CrossRefGoogle Scholar
  4. [4]
    M. Ajmone Marsan and V. Signore. Timed Petri nets performance models for fiber optic LAN architectures. Proc. 2rd Int. Workshop on Petri Nets and Performance Models (PNPM’87), pages 66–74, 1987.Google Scholar
  5. [5]
    R. Y. Al-Jaar and A. A. Desrochers. Modeling and analysis of transfer lines and production networks using Generalized Stochastic Petri Nets. In Proc. 1988 UPCAEDM Conf., pages 12–21, Atlanta, GA, June 1988.Google Scholar
  6. [6]
    K. Barkaoui, G. Florin, C. Fraize, B. Lemaire, and S. Natkin. Reliability analysis of non repairable systems using stochastic Petri nets. In Proc. 18th Int. Sump. on Fault-Tolerant Computing, pages 90–95, Tokyo, Japan, June 1988.Google Scholar
  7. [7]
    J. Bechta Dugan and G. Ciardo. Stochastic Petri net analysis of a replicated file system. IEEE Trans. Softw. Eng., 15(4):394–401, Apr. 1989.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    E. Çinlar. Introduction to Stochastic Processes. Prentice-Hall, 1975.MATHGoogle Scholar
  9. [9]
    G. Chiola, S. Donatelli, and G. Franceschinis. GSPNs versus SPNs: what is the actual role of immediate transitions? In Proc. 4th Int. Workshop on Petri Nets and Performance Models (PNPM’91), Melbourne, Australia, Dec. 1991. IEEE Computer Society Press.Google Scholar
  10. [10]
    H. Choi and K. S. Trivedi. Approximate performance models of polling systems using stochastic Petri nets. In Proc. IEEE INFOCOM 92, pages 2306–2314, Florence, Italy, May 1992.Google Scholar
  11. [11]
    G. Ciardo. Analysis of large stochastic Petri net models. PhD thesis, Duke University, Durham, NC, 1989.Google Scholar
  12. [12]
    G. Ciardo, A. Blakemore, P. F. J. Chimento, J. K. Muppala, and K. S. Trivedi. Automated generation and analysis of Markov reward models using Stochastic Reward Nets. In C. Meyer and R. J. Plemmons, editors, Linear Algebra,Markov Chains, and Queueing Models, volume 48 of IMA Volumes in Mathematics and its Applications, pages 145–191. Springer-Verlag, 1993.CrossRefGoogle Scholar
  13. [13]
    G. Ciardo, R. German, and C. Lindemann. A characterization of the stochastic process underlying a stochastic Petri net. IEEE Trans. Softw. Eng., 20(7):506–515, July 1994.CrossRefGoogle Scholar
  14. [14]
    G. Ciardo and C. Lindemann. Analysis of deterministic and stochastic Petri nets. In Proc. 5th Int. Workshop on Petri Nets and Performance Models (PNPM’93), pages 160–169, Toulouse, France, Oct. 1993. IEEE Computer Society Press.Google Scholar
  15. [15]
    A. Cumani. ESP - A package for the evaluation of stochastic Petri nets with phase-type distributed transitions times. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985.Google Scholar
  16. [16]
    E. de Souza e Silva and P. Mejía Ochoa. State space exploration in Markov models. In Proc. 1992 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 152–166, Newport, RI, USA, June 1992.Google Scholar
  17. [17]
    W. K. Grassmann. Means and variances of time averages in Markovian environments. Eue. J. Oper. Res.,31(1):132–139, 1987.MathSciNetMATHCrossRefGoogle Scholar
  18. [18]
    W. K. Grassmann. Finding transient solutions in Markovian event systems through randomization. In W. J. Stewart, editor, Numerical Solution of Markov Chains, pages 357–371. Marcel Dekker, Inc., New York, NY, 1991.Google Scholar
  19. [19]
    M. Holliday and M. Vernon. A Generalized Timed Petri Net model for performance analysis. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985.Google Scholar
  20. [20]
    G. Horton and S. T. Leutenegger. A multi-level solution algorithm for steady state Markov chains. In Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 191–200, Nashville, TN, May 1994.Google Scholar
  21. [21]
    A. Jensen. Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskr., 36:87–91, 1953.MathSciNetGoogle Scholar
  22. [22]
    J. G. Kemeny and J. L. Snell. Finite Markov Chains. D. Van Nostrand-Reinhold, New York, NY, 1960.MATHGoogle Scholar
  23. [23]
    C. Lindemann, G. Ciardo, R. German, and G. Hommel. Performability modeling of an automated manufacturing system with deterministic and stochastic Petri nets. In Proc. 1993 IEEE Int. Conf. on Robotics and Automation, pages 576–581, Atlanta, GA, May 1993. IEEE Press.Google Scholar
  24. [24]
    B. Melamed and M. Yadin. Randomization procedures in the computation of cumulative-time distributions over discrete state Markov rocesses. Operations Research, 32(4):926–944, July-Aug. 1984.MathSciNetMATHCrossRefGoogle Scholar
  25. [25]
    M. K. Molloy. On the integration of delay and throughput measures in distributed processing models. PhD thesis, UCLA, Los Angeles, CA, 1981.Google Scholar
  26. [26]
    S. Natkin. Reseaux de Petri stochastiques. These de docteur ingeneur, CNAM-Paris, Paris, France, June 1980.Google Scholar
  27. [27]
    A. L. Reibman and K. S. Trivedi. Numerical transient analysis of Markov models. Computers and Operations Research, 15(1):19–36, 1988.MATHCrossRefGoogle Scholar
  28. [28]
    A. P. A. van Moorsel and W. H. Sanders. Adaptive uniformization. Stochastic Models, 10(3), 1994.Google Scholar
  29. [29]
    R. Zijal and R. German. A new approach to discrete time stochastic Petri nets. In Proc. 11th Int. Conf. on Analysis and Optimization of Systems, Discrete Event Systems, pages 198–204, Sophia-Antipolis, France, June 1994.Google Scholar
  30. [30]
    W. M. Zuberek. D-timed Petri nets and the modeling of timeouts and protocols. Trans. of the Society for Computer Simulation, 4(4):331–357, 1987.Google Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Gianfranco Ciardo
    • 1
  1. 1.Department of Computer ScienceCollege of William and MaryWilliamsburgUSA

Personalised recommendations