Probability, parallelism and the state space exploration problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1469, Issue , 1998, Pages 165-179

  Knottenbelt, William ^a   Mestern, Mark ^b   Harrison, Peter ^a   Kritzinger, Pieter ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAPE TOWN   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HASH FUNCTIONS; SPACE RESEARCH;

DISTRIBUTED-MEMORY PARALLEL COMPUTERS; HASH COMPACTION; LOW MEMORY; STATE EXPLORATION ALGORITHMS; STATE SPACE EXPLORATION; STATE VECTOR;

PROBABILITY;

EID: 84958059492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68061-6_14     Document Type: Conference Paper

References (19)

1. M. Ajmone-Marsan, G. Conte, and G. Balbo. A class of Generalised Stochastic Petri Nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2:93-122, 1984.
2. S.C. Allmaier and G. Horton. Parallel shared-memory state-space exploration in stochastic modeling. Lecture Notes in Computer Science, 1253, 1997.
3. F. Basket, K.M. Chandy, R.R. Muntz, and F.G. Palacios. Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM, 22:248-260, 1975.
4. F. Bause. Queueing Petri nets: A formalism for the combined qualitative and quantitative analysis of systems. In Proceedings of the 5th International Workshop on Petri nets and Performance Models. IEEE, October 1993.
5. P. Buchholz. Hierarchical Markovian models: Symmetries and aggregation. Perform,ance Evaluation, 22:93-110, 1995.
6. S. Caselli, G. Conte, and P. Marenzoni. Parallel state exploration for GSPN models. In Lecture Notes in Computer Science 935: Proceedings of the 16th, International Conference on the Application and Theory and Petri Nets. Springer Verlag, Turin, Italy, June 1995.
7. G. Ciardo, J. Gluckman, and D. Nicol. Distributed state-space generation of discrete-state stochastic models. INFORMS J. Comp. To appear.
8. G. Ciardo, J.K. Muppula, and K.S. Trivedi. On the solution of GSPN reward models. Perform,ance Evaluation, 12(4):237-253, 1991.
9. G. Ciardo and K.S. Trivedi. A decomposition approach for stochastic reward net models. Perform,ance Evaluation, 18(l):37-59, 1993.
10. E.W. Dijkstra, W.H.J. Feijen, and A.J.M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Inform,ation Processing letters, 16:217-219, June 1983.
11. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM Parallel Virtual Machine: A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, Massachussetts, 1994.
12. W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with, the Message Passing Interface. MIT Press, Cambridge, Massachussetts, 1994.
13. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
14. G.J. Holzmann. An analysis of bitstate hashing. In Proceedings of IFIP/PSTV95: Conference on Protocol Specification, Testing and Verification. Chapman & Hall, Warsaw, Poland, June 1995.
15. H. Ishihata, M. Takahashi, and H. Sato. Hardware of AP3000 scalar parallel server. Fujitsu Scientific and Technical Journal, 33(l):24-30, June 1997.
16. P. Kemper. Numerical analysis of superposed GSPNs. In Proc. of the Sixth, International Workshop on Petri Nets and Perfromance Models, pages 52-62. IEEE Computer Society Press, 1995.
17. W.J. Knottenbelt. Generalised Markovian analysis of timed transition systems. Master’s thesis, University of Cape Town, 1996.
18. U. Stern and D.L. Dill. Improved probabilistic verification by hash compaction. In IFIP WG 10.5 Advanced Research, Working Conference on Correct Hardware Design and Verification Methods, 1995.
19. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Lecture Notes in Computer Science 697, pages 59-70. Springer-Verlag, 1993.