{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:31:32Z","timestamp":1725557492529},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135675"},{"type":"electronic","value":"9783642135682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13568-2_10","type":"book-chapter","created":{"date-parts":[[2010,6,16]],"date-time":"2010-06-16T08:37:14Z","timestamp":1276677434000},"page":"130-144","source":"Crossref","is-referenced-by-count":3,"title":["A Formal Language toward the Unification of Model Checking and Performance Evaluation"],"prefix":"10.1007","author":[{"given":"Andrew S.","family":"Miner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BFb0023457","volume-title":"STACS 97","author":"L. Alfaro de","year":"1997","unstructured":"de Alfaro, L.: Temporal logics for the specification of performance and reliability. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 165\u2013176. Springer, Heidelberg (1997)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-48320-9_7","volume-title":"CONCUR\u201999. Concurrency Theory","author":"L. Alfaro de","year":"1999","unstructured":"de Alfaro, L.: Computing minimum and maximum reachability times in probabilistic systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 66\u201381. Springer, Heidelberg (1999)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2005.07.033","volume":"345","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. Theor. Comput. Sci.\u00a0345(1), 139\u2013170 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-540-40903-8_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Andova","year":"2004","unstructured":"Andova, S., Hermanns, H., Katoen, J.P.: Discrete\u2013time rewards model\u2013checked. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 88\u2013104. Springer, Heidelberg (2004)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-60045-0_48","volume-title":"Computer Aided Verification","author":"A. Aziz","year":"1995","unstructured":"Aziz, A., Singhal, V., Balarin, F.: It usually works: The temporal logic of stochastic systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 155\u2013165. Springer, Heidelberg (1995)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TSE.2007.36","volume":"33","author":"C. Baier","year":"2007","unstructured":"Baier, C., Cloth, L., Haverkort, B., Kuntz, M., Siegle, M.: Model checking Markov chains with actions and state labels. IEEE Trans. Softw. Eng.\u00a033, 209\u2013224 (2007)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1007\/3-540-45022-X_65","volume-title":"Automata, Languages and Programming","author":"C. Baier","year":"2000","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: On the logical characterisation of performability properties. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 780\u2013792. Springer, Heidelberg (2000)"},{"issue":"6","key":"10_CR8","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., Hermanns, H., Katoen, J.P.: Model\u2013checking algorithms for continuous\u2013time Markov chains. IEEE Trans. Softw. Eng.\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res.\u00a016(3), 580\u2013595 (1991)","journal-title":"Math. Oper. Res."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-48778-6_13","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"G. Clark","year":"1999","unstructured":"Clark, G., Gilmore, S., Hillston, J.: Specifying performance measures for PEPA. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 211\u2013227. Springer, Heidelberg (1999)"},{"key":"10_CR11","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"10_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-0399-0","volume-title":"Measure Theory","author":"D.L. Cohn","year":"1980","unstructured":"Cohn, D.L.: Measure Theory. Birkh\u00e4user, Boston (1980)"},{"issue":"4","key":"10_CR13","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 verificiation. J. ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. Dijkstra","year":"1971","unstructured":"Dijkstra, E.: Hierarchical ordering of sequential processes. Acta Inf.\u00a01, 115\u2013138 (1971)","journal-title":"Acta Inf."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Donatelli, S., Haddad, S., Sproston, J.: CSLTA: an expressive logic for continuous\u2013time Markov chains. In: QEST 2007, pp. 31\u201340 (2007)","DOI":"10.1109\/QEST.2007.40"},{"issue":"5","key":"10_CR16","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 reliability. Formal Aspects of Computing\u00a06(5), 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/511399.511345","volume":"30","author":"P.G. Harrison","year":"2002","unstructured":"Harrison, P.G., Knottenbelt, W.J.: Passage time distributions in large Markov chains. SIGMETRICS Perf. Eval. Rev.\u00a030(1), 77\u201385 (2002)","journal-title":"SIGMETRICS Perf. Eval. Rev."},{"key":"10_CR18","volume-title":"Finite Markov Chains. D.Van Nostrand","author":"J. Kemeny","year":"1960","unstructured":"Kemeny, J., Snell, J.: Finite Markov Chains. D.Van Nostrand, Princeton (1960)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/1287624.1287688","volume-title":"ESEC-FSE 2007","author":"M. Kwiatkowska","year":"2007","unstructured":"Kwiatkowska, M.: Quantitative verification: models techniques and tools. In: ESEC-FSE 2007, pp. 449\u2013458. ACM, New York (2007)"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1530873.1530882","volume":"36","author":"M. Kwiatkowska","year":"2009","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic model checking for performance and reliability analysis. SIGMETRICS Perf. Eval. Rev.\u00a036(4), 40\u201345 (2009)","journal-title":"SIGMETRICS Perf. Eval. Rev."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-40903-8_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M. Kwiatkowska","year":"2004","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 105\u2013120. Springer, Heidelberg (2004)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-31982-5_9","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Laroussinie","year":"2005","unstructured":"Laroussinie, F., Sproston, J.: Model checking durational probabilistic systems. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 140\u2013154. Springer, Heidelberg (2005)"},{"issue":"1\u20134","key":"10_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.peva.2003.07.005","volume":"56","author":"A.S. Miner","year":"2004","unstructured":"Miner, A.S.: Implicit GSPN reachability set generation using decision diagrams. Perf. Eval.\u00a056(1\u20134), 145\u2013165 (2004)","journal-title":"Perf. Eval."},{"key":"10_CR24","unstructured":"Muppala, J.K., Ciardo, G., Trivedi, K.S.: Modeling using stochastic reward nets. In: MASCOTS 1993, pp. 367\u2013372, Society for Computer Simulation (1993)"},{"issue":"3\u20134","key":"10_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0166-5316(99)00010-3","volume":"35","author":"W.D. Obal","year":"1999","unstructured":"Obal, W.D., Sanders, W.H.: State-space support for path-based reward variables. Perf. Eval.\u00a035(3\u20134), 233\u2013251 (1999)","journal-title":"Perf. Eval."},{"key":"10_CR26","volume-title":"Introduction to the Numerical Solution of Markov Chains","author":"W. Stewart","year":"1994","unstructured":"Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, Princeton (1994)"},{"key":"10_CR27","first-page":"41","volume-title":"QEST 2007","author":"T. Suto","year":"2007","unstructured":"Suto, T., Bradley, J.T., Knottenbelt, W.J.: Performance trees: Expressiveness and quantitative semantics. In: QEST 2007, pp. 41\u201350. IEEE Computer Society Press, Los Alamitos (2007)"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modeling Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13568-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:09Z","timestamp":1606167609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13568-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135675","9783642135682"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13568-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}