{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T19:34:16Z","timestamp":1790710456633,"version":"4.1.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T00:00:00Z","timestamp":1459900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANPCyT PICT","award":["2011-1774, 2012-0724, 2013-2341, 2014-1656"],"award-info":[{"award-number":["2011-1774, 2012-0724, 2013-2341, 2014-1656"]}]},{"DOI":"10.13039\/501100010253","name":"UBACYT","doi-asserted-by":"crossref","award":["036, 0384"],"award-info":[{"award-number":["036, 0384"]}],"id":[{"id":"10.13039\/501100010253","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CONICET PIP","award":["11220110100596CO, 11220130100688CO"],"award-info":[{"award-number":["11220110100596CO, 11220130100688CO"]}]},{"name":"MEALS","award":["295261"],"award-info":[{"award-number":["295261"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2016,5,16]]},"abstract":"<jats:p>Model-based reliability estimation of systems can provide useful insights early in the development process. However, computational complexity of estimating metrics such as mean time to first failure (MTTFF), turnaround time (TAT), or other domain-based quantitative measures can be prohibitive both in time, space, and precision. In this article, we present an alternative to exhaustive model exploration, as in probabilistic model checking, and partial random exploration, as in statistical model checking. Our hypothesis is that a (carefully crafted) partial systematic exploration of a system model can provide better bounds for these quantitative model metrics at lower computation cost. We present a novel automated technique for metric estimation that combines simulation, invariant inference, and probabilistic model checking. Simulation produces a probabilistically relevant set of traces from which a state invariant is inferred. The invariant characterises a partial model, which is then exhaustively explored using probabilistic model checking. We report on experiments that suggest that metric estimation using this technique (for both fully probabilistic models and those exhibiting nondeterminism) can be more effective than (full-model) probabilistic and statistical model checking, especially for system models for which the events of interest are rare.<\/jats:p>","DOI":"10.1145\/2890494","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T22:16:10Z","timestamp":1460067370000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Less is More"],"prefix":"10.1145","volume":"25","author":[{"given":"Esteban","family":"Pavese","sequence":"first","affiliation":[{"name":"Departamento de Computaci\u00f3n, Universidad de Buenos Aires, CABA, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00edctor","family":"Braberman","sequence":"additional","affiliation":[{"name":"Departamento de Computaci\u00f3n, Universidad de Buenos Aires and CONICET, CABA, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Uchitel","sequence":"additional","affiliation":[{"name":"Departamento de Computaci\u00f3n, Universidad de Buenos Aires, Imperial College London, and CONICET, CABA, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,4,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Aziz V. Singhal F. Balarin R. K. Brayton and A. Sangiovanni-Vincentelli. 1995. It usually works: The temporal logic of stochastic systems. Lecture Notes in Computer Science Springer Berlin 155--155.   A. Aziz V. Singhal F. Balarin R. K. Brayton and A. Sangiovanni-Vincentelli. 1995. It usually works: The temporal logic of stochastic systems. Lecture Notes in Computer Science Springer Berlin 155--155.","DOI":"10.1007\/3-540-60045-0_48"},{"key":"e_1_2_1_2_1","unstructured":"C. Baier and J. P. Katoen. 2008. Principles of Model Checking. MIT Press Cambridge MA.   C. Baier and J. P. Katoen. 2008. Principles of Model Checking. MIT Press Cambridge MA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10373-5_17"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646833.708042"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"J. Bogdoll L. M. Ferrer Fioriti A. Hartmanns and H. Hermanns. 2011. Partial order methods for statistical model checking and simulation. In FMOODS\/FORTE. 59--74.   J. Bogdoll L. M. Ferrer Fioriti A. Hartmanns and H. Hermanns. 2011. Partial order methods for statistical model checking and simulation. In FMOODS\/FORTE. 59--74.","DOI":"10.1007\/978-3-642-21461-5_4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594329"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050035"},{"key":"e_1_2_1_9_1","volume-title":"An Introduction to Statistical Modelling of Extreme Values","author":"Coles S.","unstructured":"S. Coles . 2001. An Introduction to Statistical Modelling of Extreme Values . Springer . S. Coles. 2001. An Introduction to Statistical Modelling of Extreme Values. Springer."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"P.\n      D\u2019Argenio B.\n      Jeannet H.\n      Jensen and \n      K.\n      Larsen\n  . \n  2001\n  . Reachability analysis of probabilistic systems by successive refinements. In PAPM\/PROBMIV Lecture Notes in Computer Science Vol. \n  2165\n  . \n  Springer Berlin 39--56.   P. D\u2019Argenio B. Jeannet H. Jensen and K. Larsen. 2001. Reachability analysis of probabilistic systems by successive refinements. In PAPM\/PROBMIV Lecture Notes in Computer Science Vol. 2165. Springer Berlin 39--56.","DOI":"10.1007\/3-540-44804-7_3"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.10.037"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence. 106--111","author":"Dean T.","unstructured":"T. Dean and R. Givan . 1997. Model minimization in Markov decision processes . In Proceedings of the National Conference on Artificial Intelligence. 106--111 . T. Dean and R. Givan. 1997. Model minimization in Markov decision processes. In Proceedings of the National Conference on Artificial Intelligence. 106--111."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486870"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859043"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"L.\n      Helmink M.\n      Sellink and \n      F.\n      Vaandrager\n  . \n  1994\n  . Proof-checking a data link protocol. In Proceedings of the International Workshop on Types for Proofs and Programs (TYPES\u201993) Lecture Notes in Computer Science Vol. \n  806\n  . \n  Springer Berlin.   L. Helmink M. Sellink and F. Vaandrager. 1994. Proof-checking a data link protocol. In Proceedings of the International Workshop on Types for Proofs and Programs (TYPES\u201993) Lecture Notes in Computer Science Vol. 806. Springer Berlin.","DOI":"10.1007\/3-540-58085-9_75"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2012.19"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of NSMC\u201999","author":"Hermanns H.","unstructured":"H. Hermanns , J. Meyer-Kayser , and M. Siegle . 1999. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains . In Proceedings of NSMC\u201999 . Prensas Universitarias de Zaragoza, 188--207. H. Hermanns, J. Meyer-Kayser, and M. Siegle. 1999. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In Proceedings of NSMC\u201999. Prensas Universitarias de Zaragoza, 188--207."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_29"},{"key":"e_1_2_1_20_1","unstructured":"Institute of Electrical and Electronic Engineers. 1997. IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications.  Institute of Electrical and Electronic Engineers. 1997. IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications."},{"key":"e_1_2_1_21_1","first-page":"76","article-title":"Weighted alliances in graphs","volume":"187","author":"Jamieson L. H.","year":"2007","unstructured":"L. H. Jamieson and B. C. Dean . 2007 . Weighted alliances in graphs . Congressus Numerantium 187 , 76 . L. H. Jamieson and B. C. Dean. 2007. Weighted alliances in graphs. Congressus Numerantium 187, 76.","journal-title":"Congressus Numerantium"},{"key":"e_1_2_1_22_1","first-page":"4","article-title":"A comparison of three iterative methods for the solution of linear equations","volume":"12","author":"Kalambi I. B.","year":"2008","unstructured":"I. B. Kalambi . 2008 . A comparison of three iterative methods for the solution of linear equations . Journal of Applied Sciences and Environmental Management 12 , 4 . I. B. Kalambi. 2008. A comparison of three iterative methods for the solution of linear equations. Journal of Applied Sciences and Environmental Management 12, 4.","journal-title":"Journal of Applied Sciences and Environmental Management"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.04.001"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.980013"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_23"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.058"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/827269.828994"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.05.031"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643011"},{"key":"e_1_2_1_30_1","volume-title":"Handbook of Software Reliability Engineering","author":"Lyu Michael R.","unstructured":"Michael R. Lyu . 1996. Handbook of Software Reliability Engineering . McGraw-Hill, Inc. , Hightstown, NJ . Michael R. Lyu. 1996. Handbook of Software Reliability Engineering. McGraw-Hill, Inc., Hightstown, NJ."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/22980"},{"key":"e_1_2_1_32_1","volume-title":"Statistical Approaches for Probabilistic Model Checking. Master\u2019s Dissertation","author":"Nimal V.","unstructured":"V. Nimal . 2010. Statistical Approaches for Probabilistic Model Checking. Master\u2019s Dissertation . Oxford University Computing Laboratory , Oxford, UK . V. Nimal. 2010. Statistical Approaches for Probabilistic Model Checking. Master\u2019s Dissertation. Oxford University Computing Laboratory, Oxford, UK."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1808877.1808884"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486868"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of Annual Symposium on Fault Tolerant Computing. IEEE, 116--125","author":"Muhammad","unstructured":"Muhammad A. Qureshi and William H. Sanders. 1996. A new methodology for calculating distributions of reward accumulated during a finite interval . In Proceedings of Annual Symposium on Fault Tolerant Computing. IEEE, 116--125 . Muhammad A. Qureshi and William H. Sanders. 1996. A new methodology for calculating distributions of reward accumulated during a finite interval. In Proceedings of Annual Symposium on Fault Tolerant Computing. IEEE, 116--125."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04761-9_11"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40196-1_31"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"C. P. Robert and G. Casella. 2005. Monte Carlo Statistical Methods. Springer New York NY.   C. P. Robert and G. Casella. 2005. Monte Carlo Statistical Methods. Springer New York NY.","DOI":"10.1007\/978-1-4757-4145-2"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"R. Y. Rubinstein and D. P. Kroese. 2008. Simulation and the Monte Carlo Method (Series in Probability and Statistics). Vol. 707. John Wiley & Sons Hoboken NJ.   R. Y. Rubinstein and D. P. Kroese. 2008. Simulation and the Monte Carlo Method (Series in Probability and Statistics). Vol. 707. John Wiley & Sons Hoboken NJ.","DOI":"10.1002\/9780470230381"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.22237\/jmasm\/1051748460"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_26"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.42"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_59"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.12"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/193201.194044"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00705-6"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_43"},{"key":"e_1_2_1_49_1","volume-title":"Formal Methods: Foundations and Applications 144--160.","author":"Younes H.","year":"2011","unstructured":"H. Younes , E. Clarke , and P. Zuliani . 2011 . Statistical verification of probabilistic properties with unbounded until. Formal Methods: Foundations and Applications 144--160. H. Younes, E. Clarke, and P. Zuliani. 2011. Statistical verification of probabilistic properties with unbounded until. Formal Methods: Foundations and Applications 144--160."}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2890494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:55Z","timestamp":1750221535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890494"}},"subtitle":["Estimating Probabilistic Rewards over Partial System Explorations"],"short-title":[],"issued":{"date-parts":[[2016,4,6]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5,16]]}},"alternative-id":["10.1145\/2890494"],"URL":"https:\/\/doi.org\/10.1145\/2890494","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,6]]},"assertion":[{"value":"2015-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}