Computing response time distributions using stochastic Petri nets and matrix diagrams

10th International Workshop on Petri Nets and Performance Models, PNPM 2003

Volumn , Issue , 2003, Pages 10-19

  Miner, Andrew S ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPHIC METHODS; PETRI NETS; STOCHASTIC SYSTEMS;

CONTINUOUS PHASE TYPE DISTRIBUTIONS; DECISION MATRIX; EXPLICIT TECHNIQUES; MATRIX DIAGRAMS; MATRIX VECTOR MULTIPLICATION; MULTIPLICATION ALGORITHMS; MULTIWAY DECISION DIAGRAMS; NUMERICAL SOLUTION; RESPONSE TIME DISTRIBUTION; STOCHASTIC PETRI NETS;

RANDOM VARIABLES;

EID: 2942576368     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.2003.1231538     Document Type: Conference Paper

References (31)

1. M. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte, and A. Cumani. The effect of execution policies on the semantics and analyis of Stochastic Petri Nets. IEEE Trans. Softw. Eng., 15(7):832-846, July 1989.
2. M. Ajmone Marsan, G. Balbo, and G. Conte. A class of Generalized Stochastic Petri Nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2(2):93-122, May 1984.
3. M. Ajmone Marsan, S. Donatelli, F. Neri, and A. Scalia. Approximate GSPN analysis of multiserver polling systems. In Proceedings of the International Conference on Telecommunication, Distribution and Parallelism (TDP'96), La Londe Les Maures, France, June 1996.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng., 29(6):524-541, June 2003.
5. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, SUMMER 2000.
6. G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. Perf. Eval., Sept. 1988.
7. G. Ciardo, R. Jones, A. Miner, and R. Siminiceanu. Logical and stochastic modeling with SMART. In Proc. 13th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, 2003. To appear.
8. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: an efficient iteration strategy for symbolic state space generation. In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2031, pages 328-342, Genova, Italy, Apr. 2001. Springer-Verlag.
9. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Warsaw, Poland, Apr. 2003. Springer-Verlag. To appear.
10. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pages 44-57, Saint Malo, France, June 1997. Springer-Verlag.
11. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In P. Buchholz, editor, 8th Int. Workshop on Petri Nets and Performance Models (PNPM'99), pages 22-31, Zaragoza, Spain, Sept. 1999. IEEE Comp. Soc. Press.
12. G. Ciardo and R. Siminiceanu. Using edge-valued decision diagrams for symbolic generation of shortest paths. In M. D. Aagaard and J. W. O'Leary, editors, Proc. Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 256-273, Portland, OR, USA, Nov. 2002. Springer-Verlag.
13. G. Ciardo and R. Siminiceanu. Structural symbolic CTL model checking of asynchronous systems. In Proc. 15th Int. Conf. on Computer-Aided Verification (CAV 2003), July 2003. To appear.
14. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
15. N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt. Response time densities in generalised stochastic Petri net models. In 3rd ACM Workshop on Software and Performance (WOSP 2002), pages 46-54, Rome, Italy, July 2002.
16. B. L. Fox and P. W. Glynn. Computing Poisson probabilities. Communications of the ACM, 31(4):440-445, April 1988.
17. D. Gross and D. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research, 32(2):343-361, 1984.
18. P. G. Harrison and W. J. Knottenbelt. Passage time distributions in large Markov chains. In Proc. 2002 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 77-85, Marina Del Rey, CA, June 2002.
19. B. Haverkort, A. Bell, and H. Bohnenkamp. On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets. In P. Buchholz, editor, 8th Int. Workshop on Petri Nets and Performance Models (PNPM'99), pages 12-21, Zaragoza, Spain, Sept. 1999. IEEE Comp. Soc. Press.
20. H. Hermanns, J. Kayser, and M. Siegle. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In B. Plateau, W. J. Stewart, and M. Silva, editors, Numerical Solution of Markov Chains, pages 188-207, Zaragoza, Spain, June 1999. Prensas Universitarias de Zaragoza.
21. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
22. F. Kelly and P. Pollet. Sojourn times in closed queueing networks. Advances in Applied Probability, 15:638-656, 1983.
23. P. Kemper. Transient analysis of superposed GSPNs. IEEE Trans. Softw. Eng., 25(2):182-193, 1999.
24. J. McKenna. Asymptotic expansion of the sojourn time distribution functions of jobs in closed, product-form queueing networks. J. ACM, 34:985-1103, 1987.
25. A. S. Miner. Data Structures for the Analysis of Large Structured Markov Models. PhD thesis, The College of William and Mary, Williamsburg, VA, 2000.
26. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In H. Kleijn and S. Donatelli, editors, Application and Theory of Petri Nets 1999 (Proc. 20th Int. Conf. on Applications and Theory of Petri Nets), LNCS 1639, pages 6-25, Williamsburg, VA, USA, June 1999. Springer-Verlag.
27. M. K. Molloy. Performance analysis using stochastic Petri nets. IEEE Trans. Comp., 31(9):913-917, Sept. 1982.
28. J. K. Muppala, K. S. Trivedi, V. Mainkar, and V. G. Kulkarni. Numerical computation of response time distributions using stochastic reward nets. Annals of Operations Research, 48:155-184, 1994.
29. M. Neuts. Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, 1981.
30. K. Sevcik and I. Mitrani. The distribution of queueing network states at input and output instants. J. ACM, 28(2), Apr. 1981.
31. F. Somenzi, K. Ravi, and R. Bloem. Analysis of symbolic SCC hull algorithms. In M. Aagaard and J. W. O'Leary, editors, 4th Int. Conf. on Formal Methods in Computer-Aided Design, LNCS 2517, pages 88-105, Portland, OR, USA, Nov. 2002. Springer-Verlag.