Distributed state space generation of discrete-state stochastic models

INFORMS Journal on Computing

Volumn 10, Issue 1, 1998, Pages 82-93

  Ciardo, Gianfranco ^a   Gluckman, Joshua ^a   Nicol, David ^a  

^a The College of William and Mary   (United States)

Author keywords

Graphs; Heuristics; Networks

Indexed keywords

EID: 0007124749     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.1.82     Document Type: Article

References (28)

1. M. AJMONE MARSAN, G. BALBO, and G. CONTE, 1984. A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems, ACM Transactions on Computer Science 2:2, 93-122.
2. G. BALBO, G. CHIOLA, G. FRANCESCHINIS, and G. MOLINARI ROET, 1987. On the Efficient Construction of the Tangible Reachability Graph of Generalized Stochastic Petri Nets, in Proceedings of the 2nd International Workshop on Petri Nets and Performance Models (PNPM'87), IEEE Computer Society Press, 136-145.
3. F. BASKETT, K.M. CHANDY, R.R. MUNTZ, and F. PALACIOS-GOMEZ, 1975. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the American Computer Society 22:2, 335-381.
4. A. BLAKEMORE, 1989. The Cost of Eliminating Vanishing Markings From Generalized Stochastic Petri Nets, in Proceedings of the 3rd International Workshop on Petri Nets and Performance Models (PNPM'89), IEEE Computer Society Press, 85-92.
5. P. BUCHHOLZ, 1992. Hierarchical Markovian Models - Symmetries and Reduction, in Modelling Techniques and Tools for Computer Performance Evaluation. Elsevier Science Publishers B.V. (North-Holland), Amsterdam.
6. S. CASELLI, G. CONTE, and P. MARENZONI, 1995. Parallel State Space Exploration for GSPN Models, in Application and Theory of Petri Nets 1995, Lecture Notes in Computer Science 935 (Proceedings of the 16th International Conference on Applications and Theory of Petri Nets, Turin, Italy), G. De Michelis and M. Diaz (eds.), Springer-Verlag, Berlin, 181-200.
7. G. CIARDO, A. BLAKEMORE, P.F.J. CHIMENTO, J.K. MUPPALA, and K.S. TRIVEDI, 1993. Automated Generation and Analysis of Markov Reward Models using Stochastic Reward Nets, in Linear Algebra, Markov Chains, and Queueing Models, C. Meyer and R.J. Plemmons (eds.), Vol. 48 of IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 145-191.
8. G. CIARDO, J.K. MUPPALA, and K.S. TRIVEDI, 1991. On the Solu-tion of GSPN Reward Models, Performance Evaluation 12:4, 237-253.
9. G. CIARDO and K.S. TRIVEDI, 1993. A Decomposition Approach for Stochastic Reward Net Models, Performance Evaluation 18:1, 37-59.
10. G. CIARDO, K.S. TRIVEDI, and J.K. MUPPALA, 1989. SPNP: Stochastic Petri Net Package, in Proceedings of the 3rd International Workshop on Petri Nets and Performance Models (PNPM'89), IEEE Computer Society Press, Los Alamitos, CA, 142-151.
11. P.J. COURTOIS, 1977. Decomposability: Queuing and Computer System Applications, Academic Press, New York.
12. E.W. DIJKSTRA, W. FEIJEN, and A. VAN GASTEREN, 1983. Derivation of a Termination Detection Algorithm for a Distributed Computation, Information Processing Letters, 16, 217-219.
13. S. DONATELLI, 1991. Superposed Stochastic Automata: a class of stochastic Petri nets amenable to parallel solution, in Proceedings of the 4th International Workshop on Petri Nets and Performance Models (PNPM'91), IEEE Computer Society Press, Los Alamitos, CA, 54-63.
14. A. GOYAL, W.C. CARTER, E. DE SOUZA E SILVA, S.S. LAVENBERG, and K.S. TRIVEDI, 1986. The System Availability Estimator, in Proceedings of the 16th International Symposium on Fault-Tolerant Computing, IEEE Computer Society Press, Los Alamitos, CA, 84-89.
15. W.K. GRASSMANN and Y. WANG, 1995. Immediate Events in Markov Chain, in Computations with Markov Chains, W.J. Stewart (ed.), Kluwer, Boston, MA, 163-176.
16. W. GROPP, E. LUSK, and A. SKJELLUM, 1994. Using MPI, MIT Press, Cambridge, MA.
17. D. HAREL, 1988. On visual formalisms. Communications of the Association for Computing Machinery 31:5, 512-530.
18. A. JENSEN, 1953. Markoff Chains as an Aid in the Study of Markoff Processes, Skandinavish Aktuarietidskrift 36, 87-91.
19. J. MARTINEZ and M. SILVA, 1981. A Simple and Fast Algorithm to Obtain All Invariants of a Generalised Petri Net, in Proceedings of the 2nd European Workshop on Application and Theory of Petri Nets, Springer-Verlag, Berlin, 411-422.
20. T. MURATA, 1989. Petri Nets: Properties, Analysis and Applications, Proceedings of the IEEE 77:4, 541-579.
21. D. NICOL, D. PALUMBO, and M. ULREY, 1995. A Graphical Tool for Reliability and Failure-Mode-Effects Analysis, in Proceedings of the 1995 Reliability and Maintainability Conference, IEEE Publishing Services, Piscataway, NJ, 74-81.
22. D.M. NICOL, 1995. Non-Commital Barrier Synchronization, Parallel Computing 21, 529-549.
23. J.L. PETERSON, 1981. Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, NJ.
24. C. PETRI. Kommunikation mit Automaten. PhD thesis, University of Bonn, Bonn, Germany, 1962.
25. S. PISSANETZKY, 1984. Sparse Matrix Technology, Academic Press, London.
26. M. SERENO and G. BALBO, 1993. Computational Algorithms for Product Form Solution Stochastic Petri Nets, in Proceedings of the 5th International Workshop on Petri Nets and Performance Models (PNPM'93), 98-107. IEEE Computer Society Press, Los Alamitos, CA.
27. W.J. STEWART, 1994. Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ.
28. R.S. VARGA, 1962. Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ.