{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:44:37Z","timestamp":1725561877419},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212997"},{"type":"electronic","value":"9783540247302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_4","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:00:15Z","timestamp":1280761215000},"page":"46-60","source":"Crossref","is-referenced-by-count":28,"title":["Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study"],"prefix":"10.1007","author":[{"given":"H\u00e5kan L. S.","family":"Younes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gethin","family":"Norman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Parker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.A.: Reactive modules. Formal Methods in System Design\u00a015(1), 7\u201348 (1999)","journal-title":"Formal Methods in System Design"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-61474-5_75","volume-title":"Computer Aided Verification","author":"A. Aziz","year":"1996","unstructured":"Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Verifying continuous time Markov chains. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 269\u2013276. Springer, Heidelberg (1996)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/343369.343402","volume":"1","author":"A. Aziz","year":"2000","unstructured":"Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuoustime Markov chains. ACM Transactions on Computational Logic\u00a01(1), 162\u2013170 (2000)","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/10722167_28","volume-title":"Computer Aided Verification","author":"C. Baier","year":"2000","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model checking continuous-time Markov chains by transient analysis. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 358\u2013372. Springer, Heidelberg (2000)"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"8","key":"4_CR6","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/280265.280274","volume":"8","author":"P. Buchholz","year":"1998","unstructured":"Buchholz, P.: A new approach combining simulation and randomization for the analysis of large continuous time Markov chains. ACM Transactions on Modeling and Computer Simulation\u00a08(2), 194\u2013222 (1998)","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/42404.42409","volume":"31","author":"B.L. Fox","year":"1988","unstructured":"Fox, B.L., Glynn, P.W.: Computing Poisson probabilities. Communications of the ACM\u00a031(4), 440\u2013445 (1988)","journal-title":"Communications of the ACM"},{"issue":"2\/3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design\u00a010(2\/3), 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"key":"4_CR10","first-page":"228","volume-title":"Proc. 19th IEEE Symposium on Reliable Distributed Systems","author":"B.R. Haverkort","year":"2000","unstructured":"Haverkort, B.R., Hermanns, H., Katoen, J.-P.: On the use of model checking techniques for dependability evaluation. In: Proc. 19th IEEE Symposium on Reliable Distributed Systems, pp. 228\u2013237. IEEE Computer Society, Los Alamitos (2000)"},{"key":"4_CR11","unstructured":"Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In: Proc. 3rd International Workshop on the Numerical Solution of Markov Chains, pp. 188\u2013207. Prensas Universitarias de Zaragoza (1999)"},{"issue":"9","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1109\/49.62852","volume":"8","author":"O.C. Ibe","year":"1990","unstructured":"Ibe, O.C., Trivedi, K.S.: Stochastic Petri net models of polling systems. IEEE Journal on Selected Areas in Communications\u00a08(9), 1649\u20131657 (1990)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-44804-7_4","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"G.G. Infante L\u00f3pez","year":"2001","unstructured":"Infante L\u00f3pez, G.G., Hermanns, H., Katoen, J.-P.: Beyond memoryless distributions: 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)"},{"key":"4_CR14","first-page":"87","volume":"36","author":"A. Jensen","year":"1953","unstructured":"Jensen, A.: Markoff chains as an aid in the study of Markoff processes. Skandinavisk Aktuarietidskrift\u00a036, 87\u201391 (1953)","journal-title":"Skandinavisk Aktuarietidskrift"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-44804-7_2","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"J.-P. Katoen","year":"2001","unstructured":"Katoen, J.-P., Kwiatkowska, M., Norman, G., Parker, D.: Faster and symbolic CTMC model checking. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 23\u201338. Springer, Heidelberg (2001)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-46029-2_13","volume-title":"Computer Performance Evaluation","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol.\u00a02324, pp. 200\u2013204. Springer, Heidelberg (2002)"},{"key":"4_CR17","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, pp. 52\u201366. Springer, Heidelberg (2002)"},{"issue":"11","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1825","DOI":"10.1016\/0026-2714(94)90137-6","volume":"34","author":"M. Malhotra","year":"1994","unstructured":"Malhotra, M., Muppala, J.K., Trivedi, K.S.: Stiffness-tolerant methods for transient analysis of stiff Markov chains. Microelectronics and Reliability\u00a034(11), 1825\u20131841 (1994)","journal-title":"Microelectronics and Reliability"},{"key":"4_CR19","unstructured":"Parker, D.: Implementation of Symbolic Model Checking for Probabilistic Systems. PhD thesis, University of Birmingham (2002)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(88)90026-3","volume":"15","author":"A. Reibman","year":"1988","unstructured":"Reibman, A., Trivedi, K.S.: Numerical transient analysis of Markov models. Computers & Operations Research\u00a015(1), 19\u201336 (1988)","journal-title":"Computers & Operations Research"},{"issue":"6","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1287\/opre.31.6.1030","volume":"31","author":"J.G. Shanthikumar","year":"1983","unstructured":"Shanthikumar, J.G., Sargent, R.G.: A unifying view of hybrid simulation\/ analytic models and modeling. Operations Research\u00a031(6), 1030\u20131052 (1983)","journal-title":"Operations Research"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/359340.359350","volume":"21","author":"W.J. Stewart","year":"1978","unstructured":"Stewart, W.J.: A comparison of numerical techniques in Markov modeling. Communications of the ACM\u00a021(2), 144\u2013152 (1978)","journal-title":"Communications of the ACM"},{"issue":"10","key":"4_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/365844.365851","volume":"9","author":"D. Tiechroew","year":"1966","unstructured":"Tiechroew, D., Lubin, J.F.: Computer simulation\u2014discussion of the techniques and comparison of languages. Communications of the ACM\u00a09(10), 723\u2013741 (1966)","journal-title":"Communications of the ACM"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1214\/aoms\/1177731118","volume":"16","author":"A. Wald","year":"1945","unstructured":"Wald, A.: Sequential tests of statistical hypotheses. Annals of Mathematical Statistics\u00a016(2), 117\u2013186 (1945)","journal-title":"Annals of Mathematical Statistics"},{"key":"4_CR25","first-page":"195","volume-title":"Proc. Thirteenth International Conference on Automated Planning and Scheduling","author":"H.L.S. Younes","year":"2003","unstructured":"Younes, H.L.S., Musliner, D.J., Simmons, R.G.: A framework for planning in continuous-time stochastic domains. In: Proc. Thirteenth International Conference on Automated Planning and Scheduling, pp. 195\u2013204. AAAI Press, Menlo Park (2003)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45657-0_17","volume-title":"Computer Aided Verification","author":"H.L.S. Younes","year":"2002","unstructured":"Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 223\u2013235. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T18:52:45Z","timestamp":1552848765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}