Probabilistic methods in state space analysis

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

Volumn 2925, Issue , 2004, Pages 339-383

  Kuntz, Matthias ^a   Lampka, Kai ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; MAPPING; SPACE RESEARCH;

MULTIPLE HASHING; POSITIVE PROBABILITY; PROBABILISTIC METHODS; PROBABILITY OF ERRORS; RUN-TIME EFFICIENCY; SOFTWARE SYSTEMS; STATE SPACE EXPLORATION; STATE-SPACE ANALYSIS;

PROBABILITY;

EID: 34548084859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_10     Document Type: Article

References (32)

1. P. Buchholz. Structured Analysis Approaches for Large Markov Chains. Applied Numerical Mathematics, 31:375-404, 1999.
2. P. Godefroid. Using Partial Orders to Improve Automatic Verification Methods. In Edmund M. Clarke and Robert P. Kurshan, editors, Proceedings of 2nd International Workshop on Computer Aided Verification (CAV'90), volume 531 of LNCS, pages 176-185. Springer, 1990.
3. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. An Approach to the State-Explosion Problem. PhD thesis, Université de Liege, 1995.
4. P. Godefroid. Model checking for programming languages using VeriSoft. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 174-186, 1997.
5. P. Godefroid, G. Holzmann, and D. Pirottin. State Space Caching Revisited. In Proceedings of CAV'92, volume 663, pages 178-191. Springer, LNCS, 1992.
6. P. Godefroid and P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Formal Methods in System Design, 2(2):149-164, April 1993.
7. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 2 edition, 1994.
8. B.R. Haverkort, A. Bell, and H. Bohnenkamp. On the Efficient Sequential and Distributed Generation of very Large Markov Chains from Stochastic Petri Nets. In Proc. of IEEE Petri Nets and Performance Models, pages 12-21, 1999.
9. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In Plateau et al. [23], pages 188-207. Proc. of the 3rd Int. Workshop on the Numerical Solution of Markov Chains (NSMC'99).
10. G. Holzmann. On Limits and Possibilities of Automated Protocol Analysis. In Proc. 7th IFIP WG6.1 Int. Workshop on Protocol Specification, Testing, and Verification, pages 339-344. North-Holland Publishers, 1987.
11. G. Holzmann. An Improved Protocol Reachability Analysis Technique. Software, Practice and Experience, 18(2):137-161, 1988.
12. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
13. G. Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering, 23(5):1-17, 1997.
14. G. Holzmann. An Analysis of Bitstate Hashing. Formal Methods in System Design, 13(3):289-307, 1998.
15. W. Knottenbelt. Generalized Markovian Analysis of Timed Transition Systems, 1996. Master's Thesis, University of Cape Town.
16. W. Knottenbelt and P. Harrison. Distributed Disk-based Solution Techniques for Large Markov Models. In Plateau et al. [23], pages 58-75. Proc. of the 3rd Int. Workshop on the Numerical Solution of Markov Chains (NSMC'99).
17. W. Knottenbelt, P. Harrison, M. Mestern, and P. Kritzinger. Probability, Parallelism and the State Space Exploration Problem. In R. Puigjaner, N. Savino, and B. Serra, editors, Computer Performance Evaluation: Modelling Techniques and Tools, volume 1469 of LNCS, pages 165-179. Springer, 1998.
18. Proc. of the 10th International Conference, Tools '98, Palma de Mallorca, Spain, September 14-18, 1998.
19. W. Knottenbelt, P. Harrison, M. Mestern, and P. Kritzinger. A Probabilistic Dynamic Technique for the Distributed Generation of Very Large State Spaces. Performance Evaluation Journal, 39(1-4):127-148, February 2000.
20. W.J. Knottenbelt. Parallel Performance Analysis of Large Markov Models. PhD thesis, University of London, Imperial College, Dept. of Computing, 1999.
21. D. Knuth. The Art of Computer Programming: Vol 3: Sorting and Searching. Addison-Wesley, 2 edition, 1998.
22. M. Kuntz and K. Lampka. Probabilistic Methods in State Space Analysis. Technical Report 7 07/02, Universität Erlangen-Nürnberg, Institut für Informatik 7, 2002.
23. Th. Ottman and P. Widmayer. Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, 3. revised edition, 1996.
24. B. Plateau, W.J. Stewart, and M. Silva, editors. Numerical Solution of Markov Chains. Prensas Universitarias de Zaragoza, 1999. Proc. of the 3rd Int. Workshop on the Numerical Solution of Markov Chains (NSMC'99).
25. M. Siegle. Behaviour analysis of communication systems: Compositional modelling, compact representation and analysis of performability properties. Habilitationsschrift, Institut für Informatik, Friederich-Alexander-Universität Erlangen-Nürnberg, 2002.
26. U. Stern. Algorithmic Techniques in Verification by Explicit State Enumeration. PhD thesis, Technische Universität München, 1997.
27. U. Stern and D. L. Dill. Improved Probabilistic Verification by Hash Compaction. In Proceedings of CHARME '95, volume 987, pages 206-224. Springer, LNCS, 1995.
28. U. Stern and D. L. Dill. A New Scheme for Memory-Efficient Probabilistic Verification. In Reinhard Gotzhein and Jan Bredereke, editors, Formal Description Techniques IX: Theory, application and tools, volume 96 of IFIP Conference Proceedings, pages 333-348. Kluwer, 1996.
29. Proc. of IFIP TC6 WG6.1 International Conference on Formal Description Techniques IX / Protocol Specification, Testing and Verification XVI, Kaiserslautern Germany, October 8-11.
30. U. Stern and D. L. Dill. Combining State Space Caching and Hash Compaction. In Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI/ITG/GME Workshop, pages 81-90, 1996.
31. P. Wolper and D. Leroy. Reliable Hashing Without Collision Detection. In Proceedings of the 5th International Computer Aided editor = Costas Courcoubetis, Verication Conference (CAV'93), volume 697 of LNCS, pages 59-70. Springer, 1993.
32. P. Wolper, U. Stern, D. Leroy, and D. L. Dill. Reliable probabilistic verification using hash compaction. Submitted for publication, downloaded from http://www.citeseer.nj.nec.com/32915.html on 23.08.2002.