{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T21:57:37Z","timestamp":1775512657442,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_11","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"97-109","source":"Crossref","is-referenced-by-count":36,"title":["Linear and Branching Metrics for Quantitative Transition Systems"],"prefix":"10.1007","author":[{"given":"Luca","family":"de Alfaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Faella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-45828-X_22","volume-title":"Embedded Software","author":"P. Caspi","year":"2002","unstructured":"Caspi, P., Benveniste, A.: Toward an approximation theory for computerized control. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol.\u00a02491, pp. 294\u2013304. Springer, Heidelberg (2002)"},{"key":"11_CR2","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)"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/380752.380871","volume-title":"Proceedings STOC","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. In: Proceedings STOC, pp. 675\u2013683. ACM Press, New York (2001)"},{"key":"11_CR4","volume-title":"Finite State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"Derman, C.: Finite State Markovian Decision Processes. Academic Press, London (1970)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Desharnais","year":"1999","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"11_CR6","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"11_CR7","series-title":"Lecture Notes in Pure and Applied Mathematics","volume-title":"Quasi-uniform spaces","author":"P. Fletcher","year":"1982","unstructured":"Fletcher, P., Lindgren, W.F.: Quasi-uniform spaces. Lecture Notes in Pure and Applied Mathematics, vol.\u00a077. Marcel Dekker Inc., New York (1982)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proceedings of LICS, pp. 111\u2013122 (1997)","DOI":"10.1109\/LICS.1997.614940"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kozen, D.: A probabilistic PDL. In: Proc. 15th ACM Symp. Theory of Comp., pp. 291\u2013297 (1983)","DOI":"10.1145\/800061.808758"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design: An International Journal\u00a06(1), 11\u201344 (1995)","journal-title":"Formal Methods in System Design: An International Journal"},{"key":"11_CR11","unstructured":"Majumdar, R.: Symbolic algorithms for verification and control. PhD thesis, University of California, Berkeley (2003)"},{"key":"11_CR12","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1991)"},{"key":"11_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-36078-6_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. McIver","year":"2002","unstructured":"McIver, A., Morgan, C.: Games, probability, and the quantitative \u03bc-calculus qM\u03bc. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 292\u2013310. Springer, Heidelberg (2002)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Universal games of incomplete information. In: 11th Annual ACM Symposium on Theory of Computing, April, Atlanta, Georgia, pp. 288\u2013308 (1979)","DOI":"10.1145\/800135.804422"},{"key":"11_CR15","first-page":"1","volume-title":"Proc. 5th ACM Symp. Theory of Comp.","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. 5th ACM Symp. Theory of Comp., pp. 1\u20139. ACM Press, New York (1973)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44685-0_23","volume-title":"CONCUR 2001 - Concurrency Theory","author":"F. Breugel van","year":"2001","unstructured":"van Breugel, F., Worrel, J.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 336\u2013350. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T10:20:15Z","timestamp":1685787615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}