{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:29Z","timestamp":1725574589924},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540203636"},{"type":"electronic","value":"9783540397243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39724-3_34","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T02:15:55Z","timestamp":1294452955000},"page":"394-409","source":"Crossref","is-referenced-by-count":3,"title":["Finite Horizon Analysis of Markov Chains with the Mur\u03d5 Verifier"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Della Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedetto","family":"Intrigila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Melatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Tronci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marisa Venturini","family":"Zilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M., Ryan, M.: Symbolic model checking for probabilistic processes. Automata, Languages and Programming, 430\u2013440 (1997)","DOI":"10.1007\/3-540-63165-8_199"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Behrends, E.: Introduction to Markov Chains. Vieweg (2000)","DOI":"10.1007\/978-3-322-90157-6"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers C\u201335(8) (August 1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation, 98 (1992)","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., McMillan, K.L., Zhao, X., Fujita, M., Yang, J.: Spectral transforms for large boolean functions with applications to technology mapping. In: Proc. 30th ACM\/IEEE Design Automation Conference, pp. 54\u201360 (1993)","DOI":"10.1145\/157485.164569"},{"key":"34_CR7","unstructured":"http:\/\/vlsi.colorado.edu\/~fabio\/"},{"key":"34_CR8","first-page":"338","volume-title":"Proc. of FOCS 1988","author":"C. Courcoubetis","year":"1988","unstructured":"Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: Proc. of FOCS 1988, pp. 338\u2013345. IEEE CS Press, Los Alamitos (1988)"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"34_CR10","unstructured":"de Alfaro, L.: Formal verification of performance and reliability of real-time systems. Technical report, Stanford University (1996)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Dill, D.L., Drexler, A.J., Hu, A.J., Yang, C.H.: Protocol verification as a hardware design aid. In: IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 522\u2013525 (1992)","DOI":"10.1109\/ICCD.1992.276232"},{"key":"34_CR12","volume-title":"Time and Probability in Formal Design of Distributed Systems","author":"H. Hansson","year":"1994","unstructured":"Hansson, H.: Time and Probability in Formal Design of Distributed Systems. Elsevier, Amsterdam (1994)"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and probability. Formal Aspects of Computing\u00a06, 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"34_CR14","first-page":"1","volume-title":"Proc. of 16th ACM Symposium on Theory of Computing","author":"S. Hart","year":"1984","unstructured":"Hart, S., Sharir, M.: Probabilistic temporal logic for finite and bounded models. In: Proc. of 16th ACM Symposium on Theory of Computing, pp. 1\u201313. ACM, New York (1984)"},{"key":"34_CR15","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, New Jersey (1991)"},{"issue":"5","key":"34_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The spin model checker. IEEE Trans. on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"#cr-split#-34_CR17.1","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Kemper, P. (ed.) Proc. Tools Session of Aachen 2001 International Multiconference on Measurement, Modelling and Evaluation of Computer-Communication Systems, September 2001, pp. 7???12 (2001);"},{"key":"#cr-split#-34_CR17.2","unstructured":"Available as Technical Report 760\/2001, University of Dortmund"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-46002-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with prism: A hybrid approach. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, p. 52. Springer, Heidelberg (2002)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094, 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Rabin, M.: On the advantages of free choice: A symmetric fully distributed solution to the dining philosophers problem (extended abstract). In: Proc. 8th Symposium on Principles of Programming Languages, pp. 133\u2013138 (1981)","DOI":"10.1145\/567532.567547"},{"key":"34_CR21","unstructured":"http:\/\/sprout.stanford.edu\/dill\/murphi.html"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-36580-X_13","volume-title":"Hybrid Systems: Computation and Control","author":"G. Penna Della","year":"2003","unstructured":"Della Penna, G., Intrigila, B., Melatti, I., Minichino, M., Ciancamerla, E., Parisse, A., Tronci, E., Zilli, M.V.: Automatic verification of a turbogas control system with the murphi verifier. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.\u00a02623, pp. 141\u2013155. Springer, Heidelberg (2003)"},{"issue":"1","key":"34_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01843570","volume":"1","author":"A. Pnueli","year":"1986","unstructured":"Pnueli, A., Zuck, L.: Verification of multiprocess probabilistic protocols. Distributed Computing\u00a01(1), 53\u201372 (1986)","journal-title":"Distributed Computing"},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1012","volume":"103","author":"A. Pnueli","year":"1993","unstructured":"Pnueli, A., Zuck, L.: Probabilistic verification. Information and Computation\u00a0103, 1\u201329 (1993)","journal-title":"Information and Computation"},{"key":"34_CR25","unstructured":"http:\/\/www.cs.bham.ac.uk\/~dxp\/prism\/"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Lynchand, N., Saias, I., Segala, R.: Proving time bounds for randomized distributed algorithms. In: Proc. 13th ACM Symposium on Principles of Distributed Computing, pp. 314\u2013323 (1994)","DOI":"10.1145\/197917.198117"},{"key":"34_CR27","series-title":"Lecture Notes in Computer Science","first-page":"381","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 381\u2013496. Springer, Heidelberg (1994)"},{"key":"34_CR28","unstructured":"http:\/\/netlib.bell-labs.com\/netlib\/spin\/whatispin.html"},{"key":"34_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-60385-9_13","volume-title":"Correct Hardware Design and Verification Methods","author":"U. Stern","year":"1995","unstructured":"Stern, U., Dill, D.L.: Improved probabilistic verification by hash compaction. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol.\u00a0987, pp. 206\u2013224. Springer, Heidelberg (1995)"},{"key":"34_CR30","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: A new scheme for memory-efficient probabilistic verification. In: IFIP TC6\/WG6.1 Joint International Conference on: Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification (1996)","DOI":"10.1007\/978-0-387-35079-0_21"},{"key":"34_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44798-9_22","volume-title":"Correct Hardware Design and Verification Methods","author":"E. Tronci","year":"2001","unstructured":"Tronci, E., Della Penna, G., Intrigila, B., Venturini Zilli, M.: Exploiting transition locality in automatic verification. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol.\u00a02144, p. 259. Springer, Heidelberg (2001)"},{"key":"34_CR32","first-page":"327","volume-title":"Proc. of FOCS 1985","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of FOCS 1985, pp. 327\u2013338. IEEE CS Press, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","Correct Hardware Design and Verification Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39724-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:03:37Z","timestamp":1559930617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39724-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203636","9783540397243"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39724-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}