{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:12Z","timestamp":1725548952407},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222651"},{"type":"electronic","value":"9783540246114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24611-4_10","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T14:01:10Z","timestamp":1267106470000},"page":"339-383","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Methods in State Space Analysis"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Kuntz","sequence":"first","affiliation":[]},{"given":"Kai","family":"Lampka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0168-9274(99)00005-7","volume":"31","author":"P. Buchholz","year":"1999","unstructured":"Buchholz, P.: Structured Analysis Approaches for Large Markov Chains. Applied Numerical Mathematics\u00a031, 375\u2013404 (1999)","journal-title":"Applied Numerical Mathematics"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023731","volume-title":"Computer-Aided Verification","author":"P. Godefroid","year":"1991","unstructured":"Godefroid, P.: Using Partial Orders to Improve Automatic Verification Methods. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 176\u2013185. Springer, Heidelberg (1991)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. An Approach to the State-Explosion Problem. PhD thesis, Universit\u00e8 de Liege (1995)","DOI":"10.1007\/3-540-60761-7"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Model checking for programming languages using VeriSoft. In: Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pp. 174\u2013186 (1997)","DOI":"10.1145\/263699.263717"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","first-page":"178","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P., Holzmann, G., Pirottin, D.: State Space Caching Revisited. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 178\u2013191. Springer, Heidelberg (1992)"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01383879","volume":"2","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P., Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Formal Methods in System Design\u00a02(2), 149\u2013164 (1993)","journal-title":"Formal Methods in System Design"},{"key":"10_CR7","volume-title":"Concrete Mathematics","author":"R. Graham","year":"1994","unstructured":"Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)","edition":"2"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Haverkort, B.R., Bell, A., Bohnenkamp, H.: 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, pp. 12\u201321 (1999)","DOI":"10.1109\/PNPM.1999.796528"},{"key":"10_CR9","unstructured":"Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In: Plateau, et al. [23], Proc. of the 3rd Int.Workshop on the Numerical Solution of Markov Chains (NSMC 1999), pp. 188\u2013207 (1999)"},{"key":"10_CR10","first-page":"339","volume-title":"Proc. 7th IFIP WG6.1 Int. Workshop on Protocol Specification, Testing, and Verification,","author":"G. Holzmann","year":"1987","unstructured":"Holzmann, G.: On Limits and Possibilities of Automated Protocol Analysis. In: Proc. 7th IFIP WG6.1 Int. Workshop on Protocol Specification, Testing, and Verification,, pp. 339\u2013344. North-Holland Publishers, Amsterdam (1987)"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/spe.4380180203","volume":"18","author":"G. Holzmann","year":"1988","unstructured":"Holzmann, G.: An Improved Protocol Reachability Analysis Technique. Software, Practice and Experience\u00a018(2), 137\u2013161 (1988)","journal-title":"Software, Practice and Experience"},{"key":"10_CR12","volume-title":"Design and Validation of Computer Protocols","author":"G. Holzmann","year":"1991","unstructured":"Holzmann, G.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991)"},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/32.588521","volume":"23","author":"G. Holzmann","year":"1997","unstructured":"Holzmann, G.: The Model Checker SPIN. IEEE Transactions on Software Engineering\u00a023(5), 1\u201317 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008696026254","volume":"13","author":"G. Holzmann","year":"1998","unstructured":"Holzmann, G.: An Analysis of Bitstate Hashing. Formal Methods in System Design\u00a013(3), 289\u2013307 (1998)","journal-title":"Formal Methods in System Design"},{"key":"10_CR15","unstructured":"Knottenbelt, W.: Generalized Markovian Analysis of Timed Transition Systems, Master\u2019s Thesis, University of Cape Town (1996)"},{"key":"10_CR16","unstructured":"Knottenbelt, W., Harrison, P.: Distributed Disk-based Solution Techniques for Large Markov Models. In: Plateau, et al. (eds.) Proc. of the 3rd Int. Workshop on the Numerical Solution of Markov Chains (NSMC 1999)., vol.\u00a023, pp. 58\u201375 (1999)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-68061-6_14","volume-title":"Computer Performance Evaluation","author":"W. Knottenbelt","year":"1998","unstructured":"Knottenbelt, W., Harrison, P., Mestern, M., Kritzinger, P.: Probability, parallelism and the state space exploration problem. In: Puigjaner, R., Savino, N., Serra, B. (eds.) TOOLS 1998. LNCS, vol.\u00a01469, pp. 165\u2013179. Springer, Heidelberg (1998)"},{"issue":"1\u20134","key":"10_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-5316(99)00061-9","volume":"39","author":"W. Knottenbelt","year":"2000","unstructured":"Knottenbelt, W., Harrison, P., Mestern, M., Kritzinger, P.: A Probabilistic Dynamic Technique for the Distributed Generation of Very Large State Spaces. Performance Evaluation Journal\u00a039(1\u20134), 127\u2013148 (2000)","journal-title":"Performance Evaluation Journal"},{"key":"10_CR19","unstructured":"Knottenbelt, W.J.: Parallel Performance Analysis of Large Markov Models. PhD thesis, University of London, Imperial College, Dept. of Computing (1999)"},{"key":"10_CR20","volume-title":"The Art of Computer Programming: Vol 3: Sorting and Searching","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming: Vol 3: Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"10_CR21","unstructured":"Kuntz, M., Lampka, K.: Probabilistic Methods in State Space Analysis. Technical Report 7 07\/02, Universit\u00e4t Erlangen-N\u00fcrnberg, Institut f\u00fcr Informatik 7 (2002)"},{"key":"10_CR22","unstructured":"Ottman, Th., Widmayer, P.: Algorithmen und Datenstrukturen, 3 revised edn. Spektrum Akademischer Verlag (1996)"},{"key":"10_CR23","unstructured":"Plateau, B., Stewart, W.J., Silva, M. (eds.) Proc. of the 3rd Int. Workshop on the Numerical Solution of Markov Chains NSMC 1999, Prensas Universitarias de Zaragoza (1999)"},{"key":"10_CR24","unstructured":"Siegle, M.: Behaviour analysis of communication systems: Compositional modelling, compact representation and analysis of performability properties, Habilitationsschrift, Institut f\u00fcr Informatik. Friederich-Alexander-Universit\u00e4t Erlangen- N\u00fcrnberg (2002)"},{"key":"10_CR25","unstructured":"Stern, U.: Algorithmic Techniques in Verification by Explicit State Enumeration. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (1997)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","first-page":"206","volume-title":"Policies for Distributed Systems and Networks","author":"U. Stern","year":"2001","unstructured":"Stern, U., Dill, D.L.: Improved Probabilistic Verification by Hash Compaction. In: Sloman, M., Lobo, J., Lupu, E.C. (eds.) POLICY 2001. LNCS, vol.\u00a01995, pp. 206\u2013224. Springer, Heidelberg (2001)"},{"key":"10_CR27","series-title":"IFIP Conference Proceedings","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-0-387-35079-0_21","volume-title":"Formal Description Techniques IX: Theory, application and tools","author":"U. Stern","year":"1996","unstructured":"Stern, U., Dill, D.L.: A New Scheme for Memory-Efficient Probabilistic Verification. In: Gotzhein, R., Bredereke, J. (eds.) Formal Description Techniques IX: Theory, application and tools. IFIP Conference Proceedings, vol.\u00a096, pp. 333\u2013348. Kluwer, Dordrecht (1996); Proc. of IFIP TC6 WG6.1 International Conference on Formal Description Techniques IX \/ Protocol Specification, Testing and Verification XVI, Kaiserslautern Germany, October 8-11"},{"key":"10_CR28","unstructured":"Stern, U., Dill, D.L.: Combining State Space Caching and Hash Compaction. In: Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI\/ITG\/GME Workshop, pp. 81\u201390 (1996)"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-56922-7_6","volume-title":"Computer Aided Verification","author":"P. Wolper","year":"1993","unstructured":"Wolper, P., Leroy, D.: Reliable Hashing Without Collision Detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 59\u201370. Springer, Heidelberg (1993)"},{"key":"10_CR30","unstructured":"Wolper, P., Stern, U., Leroy, D., Dill, D.L.: Reliable probabilistic verification using hash compaction (submitted for publication), Downloaded from http:\/\/www.citeseer.nj.nec.com\/32915.html on (August 23, 2002)"}],"container-title":["Lecture Notes in Computer Science","Validation of Stochastic Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24611-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:46:29Z","timestamp":1558856789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24611-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222651","9783540246114"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24611-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}