{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:31:55Z","timestamp":1742923915098,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_32","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T03:29:39Z","timestamp":1308367779000},"page":"404-415","source":"Crossref","is-referenced-by-count":2,"title":["Model Checking the Quantitative \u03bc-Calculus on Linear Hybrid Systems"],"prefix":"10.1007","author":[{"given":"Diana","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science\u00a0138(1), 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"32_CR2","first-page":"70","volume-title":"LICS","author":"T. Colcombet","year":"2010","unstructured":"Colcombet, T., L\u00f6ding, C.: Regular cost functions over finite trees. In: LICS, pp. 70\u201379. IEEE Computer Society, Los Alamitos (2010)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-45187-7_7","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L.: Quantitative verification and control via the mu-calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 103\u2013127. Springer, Heidelberg (2003)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-27836-8_11","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and Branching Metrics for Quantitative Transition Systems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 97\u2013109. Springer, Heidelberg (2004)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermann and primitive-recursive bounds with dickson\u2019s lemma. CoRR, abs\/1007.2989 (2010)","DOI":"10.1109\/LICS.2011.39"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s00224-009-9201-y","volume":"47","author":"D. Fischer","year":"2010","unstructured":"Fischer, D., Gr\u00e4del, E., Kaiser, L.: Model checking games for the quantitative \u03bc-calculus. Theory Comput. Syst.\u00a047(3), 696\u2013719 (2010)","journal-title":"Theory Comput. Syst."},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-75596-8_14","volume-title":"Automated Technology for Verification and Analysis","author":"T. Gawlitza","year":"2007","unstructured":"Gawlitza, T., Seidl, H.: Computing game values for crash games. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol.\u00a04762, pp. 177\u2013191. Springer, Heidelberg (2007)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-48320-9_23","volume-title":"CONCUR\u201999. Concurrency Theory","author":"T.A. Henzinger","year":"1999","unstructured":"Henzinger, T.A., Horowitz, B., Majumdar, R.: Rectangular hybrid games. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 320\u2013335. Springer, Heidelberg (1999)"},{"key":"32_CR9","first-page":"373","volume-title":"Proceedings of STOC 1995","author":"T.A. Henzinger","year":"1995","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? In: Proceedings of STOC 1995, pp. 373\u2013382. ACM, New York (1995)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","volume":"32","author":"K. McAloon","year":"1984","unstructured":"McAloon, K.: Petri nets and large finite sets. Theoretical Computer Science\u00a032, 173\u2013183 (1984)","journal-title":"Theoretical Computer Science"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"McIver, A., Morgan, C.: Results on the quantitative \u03bc-calculus qM\u03bc. ACM Trans. Comput. Log.\u00a08(1) (2007)","DOI":"10.1145\/1182613.1182616"}],"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-642-22012-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:06:50Z","timestamp":1560283610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}