{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:32Z","timestamp":1725558632490},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_6","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"58-71","source":"Crossref","is-referenced-by-count":3,"title":["Finite Horizon Analysis of Stochastic Systems with the Mur\u03c6 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":"6_CR1","series-title":"Text and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4376-0","volume-title":"Verification of Sequential and Concurrent Programs","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Text and Monographs in Computer Science. Springer, Heidelberg (1991)"},{"key":"6_CR2","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":"6_CR3","doi-asserted-by":"crossref","unstructured":"Behrends, E.: Introduction to Markov Chains. Vieweg (2000)","DOI":"10.1007\/978-3-322-90157-6"},{"key":"6_CR4","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":"6_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":"6_CR6","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":"6_CR7","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":"6_CR8","unstructured":"de Alfaro, L.: Formal verification of performance and reliability of real-time systems. Technical report, Stanford University (1996)"},{"key":"6_CR9","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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hermanns, H., Infante Lopez, G.G., Katoen, J.: Beyond memoryless distribution: Model checking semi-markov chains. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 57\u201370. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44804-7_4"},{"key":"6_CR11","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":"6_CR12","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":"6_CR13","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":"6_CR14","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#-6_CR15.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#-6_CR15.2","unstructured":"Available as Technical Report 760\/2001, University of Dortmund."},{"key":"6_CR16","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":"6_CR17","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":"6_CR18","unstructured":"http:\/\/sprout.stanford.edu\/dill\/murphi.html"},{"key":"6_CR19","volume-title":"Stochastic Modeling: Analysis And Simulation","author":"B.L. Nelson","year":"1995","unstructured":"Nelson, B.L.: Stochastic Modeling: Analysis And Simulation. Dover Publications, New York (1995)"},{"key":"6_CR20","unstructured":"Papoulis, A.: Probability, Random Variables and Stochastic Processes. McGraw-Hill Series in System Sciences (1965)"},{"key":"6_CR21","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)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Della Penna, G., Intrigila, B., Melatti, I., Tronci, E., Zilli, M.V.: Finite horizon analysis of markov chains with the murphi verifier (2003) (submitted for publication)","DOI":"10.1007\/978-3-540-45208-9_6"},{"key":"6_CR23","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":"6_CR24","unstructured":"http:\/\/www.cs.bham.ac.uk\/~dxp\/prism\/"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BFb0015027","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":"6_CR26","unstructured":"http:\/\/netlib.bell-labs.com\/netlib\/spin\/whatispin.html"},{"key":"6_CR27","unstructured":"http:\/\/www.sti.uniurb.it\/bernardo\/twotowers\/"},{"key":"6_CR28","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)"},{"key":"6_CR29","unstructured":"http:\/\/www.di.univaq.it\/melatti\/ICTCS03\/"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the Future in Systems Theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1022\u20131037. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:40:46Z","timestamp":1559209246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}