On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets

Proceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999

Volumn , Issue , 1999, Pages 12-21

  Haverkort, Boudewijn ^a   Bell, Alexander ^a   Bohnenkamp, Henrik ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); CHAINS; CONTINUOUS TIME SYSTEMS; DIGITAL STORAGE; DISTRIBUTED POWER GENERATION; PETRI NETS; STOCHASTIC SYSTEMS; TREES (MATHEMATICS);

CLUSTER OF WORKSTATIONS; CODING TECHNIQUES; CONTINUOUS TIME MARKOV CHAIN; PROTOTYPE TOOLS; REACHABILITY GRAPHS; STOCHASTIC PETRI NETS; STORAGE EFFICIENCY; TREE-BASED DATA STRUCTURES;

MARKOV PROCESSES;

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

References (32)

1. S. Allmaier, S. Dalibor, and D. Kreische. Parallel graph generation algorithms for shared and distributed memory machines. In Proceedings of the Parallel Computing Conference (PARCO '97). Springer Verlag, 1997.
2. S. Allmaier and G. Horton. Parallel shared-memory state space exploration in stochastic modelling. In G. Blardi, A. Ferreira, B.Lüling, and J. Rolim, editors, Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science 1253. Springer Verlag, 1997.
3. S. Allmaier, M. Kowarschik, and G. Horton. State space construction and steady-state solution of GSPNs on a sharedmemory multiprocessor. In Proceedings of the 7th International Workshop on Petri Nets and Performance Models, pages 112-121. IEEE Computer Society Press, 1997.
4. C. Amza, A. Cox, S. Dwarkadas, P. Keleher, R. R. H. Lu, W. Yu, and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2):18-28, 1996.
5. A. Bell. Verteilte Bewertung stochstischer Petrinetzen. Master's thesis, RWTH Aachen, Department of Computer Science, 1998.
6. S. Caselli, G. Conte, F. Bonardi, and M. Fontanesi. Experiences on SIMDmassively parallel GSPNanalysis. In G. Haring and G. Kotsis, editors, Computer Performance Evaluation: Modelling Techniques and Tools, volume 794 of Lecture Notes in Computer Science, pages 266-283. Springer- Verlag, 1994.
7. S. Caselli, G. Conte, and P. Marenzoni. Parallel state space exploration for GSPN models. In G. De Michelis and M. Diaz, editors, Applications and Theory of Petri Nets 1995, volume 935 of Lecture Notes in Computer Science, pages 181-200. Springer-Verlag, 1995.
8. G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. In R. Puigjaner and D. Potier, editors, Modelling Techniques and Tools for Computer Performance Evaluation, pages 11-24. Plenum Press, 1989.
9. G. Ciardo, J. Gluckman, and D. Nicol. Distributed state space generation of discrete-state stochastic models. ORSA Journal of Computing, forthcoming 1998.
10. G. Ciardo and A. Milner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Computer Performance Evaluation, Lecture Notes in Computer Science 1245, pages 44-57. Springer Verlag, 1997.
11. G. Ciardo, J. Muppala, and K. S. Trivedi. SPNP: Stochastic Petri net package. In Proceedings of the 3rd International Workshop on Petri Nets and Performance Models, pages 142-151. IEEE Computer Society Press, 1989.
12. G. Ciardo and K. Trivedi. A decomposition approach for stochastic reward net models. Performance Evaluation, 18(3):37-59, 1993.
13. D. Deavours andW. Sanders. An efficient disk-based tool for solving very large Markov models. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Computer Performance Evaluation, Lecture Notes in Computer Science 1245, pages 58-71. Springer Verlag, 1997.
14. D. Deavours and W. Sanders. "On-the-fly" techniques for stochastic Petri nets and extensions. In Proceedings of the 7th International Workshop on Petri Nets and Performance Models, pages 132-141. IEEE Computer Society Press, 1997.
15. E. Dijkstra, W. Feijen, and A. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16:217-219, 1983.
16. M. Fujita, P. McGeer, and J.-Y. Yang. Multi-terminal binary decision diagrams: an efficient data structure for matrix representations. Formal Methods in System Design, 10:149-169, 1997.
17. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
18. P. Kemper. Reachability analysis based on structured representations. In Advances in Petri Nets, Lecture Notes in Computer Science 1091, pages 269-288. Springer-Verlag, 1996.
19. W. Knottenbelt, M. Mestern, P. Harrison, and P. Kritzinger. Probability, parallelism and the state space exploration problem. In R. Puigjaner, N. Savino, and B. Serra, editors, Computer Performance Evaluation, Lecture Notes in Computer Science 1469, pages 165-179. Springer-Verlag, 1998.
20. D. Knuth. The Art of Computer Programming; Volume 3: Sorting and Searching. Addison-Wesley, 1973.
21. A. Lenstra, H. Lenstra, and L. Lovasz. Mathematical Annals, 261:515-534, 1982.
22. B. Lubachevsky and D. Mitra. A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius. Journal of the ACM, 33(1):130-150, 1986.
23. P. Marenzoni, S. Caselli, and G. Conte. Analysis of large GSPN models: a distributed solution tool. In Proceedings of the 7th International Workshop on Petri Nets and Performance Models, pages 122-131. IEEE Computer Society Press, 1997.
24. J. Martinez and M. Silva. A simple and fast algorithm to obtain all invariants of a generalized Petri net. In C. Girault and W. Reisig, editors, Application and Theory of Petri Nets; Informatik Fachberichte 52, pages 301-310. Springer-Verlag, 1981.
25. D. Nicol and G. Ciardo. Automated parallelization of discrete state-space generation. Journal of Parallel and Distributed Computing, 47:153-167, 1997.
26. U. Stern and D. Dill. Improved probabilistic verification by hash compaction. In IFIP WG 10.5 Advanced Research Workshop on Correct Hardware Design and Verification Methods, pages 206-224, 1995.
27. U. Stern and D. Dill. Parallelizing the Mur' verifier. In O. Grumberg, editor, Computer Aided Verification, Lecture Notes in Computer Science 1254, pages 256-267. Springer- Verlag, 1997.
28. U. Stern and D. Dill. Using magnetic disk instead of main memory in the Mur' verifier. In A. J. Hu and M. Vardi, editors, Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 172-183. Springer- Verlag, 1998.
29. W. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
30. B. Stroustrup. The C++ Programming Language. Addison Wesley, third edition, 1997.
31. D. Walker. The design of a standard message passing interface for distributed memory concurrent computers. Parallel Computing, 20:657-673, 1994.
32. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Computer-Aided Verification '93, volume 697 of Lecture Notes in Computer Science, pages 59-70, 1993.