{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:12:48Z","timestamp":1725808368998},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119359"},{"type":"electronic","value":"9783319119366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11936-6_6","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:11:50Z","timestamp":1414177910000},"page":"64-80","source":"Crossref","is-referenced-by-count":2,"title":["Quantitative Verification of Weighted Kripke Structures"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Gardy","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM\u00a041(1), 181\u2013203 (1994)","journal-title":"Journal of the ACM"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-36742-7_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Bohy","year":"2013","unstructured":"Bohy, A., Bruy\u00e8re, V., Filiot, E., Raskin, J.-F.: Synthesis from ltl specifications with mean-payoff objectives. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol.\u00a07795, pp. 169\u2013184. Springer, Heidelberg (2013)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. In: LICS 2011, pp. 43\u201352. IEEE Comp. Soc. Press (2011)","DOI":"10.1109\/LICS.2011.33"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85778-5_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 33\u201347. Springer, Heidelberg (2008)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.peva.2013.11.002","volume":"73","author":"P. Bouyer","year":"2014","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Lower-bound constrained runs in weighted timed automata. Performance Evaluation\u00a073, 91\u2013109 (2014)","journal-title":"Performance Evaluation"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-45069-6_13","volume-title":"Computer Aided Verification","author":"D. Beyer","year":"2003","unstructured":"Beyer, D., Lewerentz, C., Noack, A.: Rabbit: A tool for BDD-based verification of real-time systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 122\u2013125. Springer, Heidelberg (2003)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-24372-1_11","volume-title":"Automated Technology for Verification and Analysis","author":"P. Bouyer","year":"2011","unstructured":"Bouyer, P., Markey, N., Olschewski, J., Ummels, M.: Measuring permissiveness in parity games: Mean-payoff parity games revisited. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 135\u2013149. Springer, Heidelberg (2011)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Campos, S.V.A., Clarke, E.M.: Real-time symbolic model checking for discrete time models. In: Real-Time Symbolic Model Checking for Discrete Time Models. AMAST Series in Computing, vol.\u00a02, pp. 129\u2013145. World Scientific (1995)","DOI":"10.1142\/9789812831583_0005"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44622-2_17","volume-title":"Computer Science Logic","author":"H. Comon","year":"2000","unstructured":"Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 262\u2013276. Springer, Heidelberg (2000)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K. Chatterjee","year":"2012","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theoretical Computer Science\u00a0458, 49\u201360 (2012)","journal-title":"Theoretical Computer Science"},{"key":"6_CR11","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS 2010. Leibniz International Proceedings in Informatics, vol.\u00a08, Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"6_CR13","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press (2000)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-32940-1_10","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"K. Chatterjee","year":"2012","unstructured":"Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 115\u2013131. Springer, Heidelberg (2012)"},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1093\/logcom\/exp037","volume":"19","author":"S. Demri","year":"2009","unstructured":"Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. Journal of Logic and Computation\u00a019(6), 1541\u20131575 (2009)","journal-title":"Journal of Logic and Computation"},{"issue":"22-24","key":"6_CR16","doi-asserted-by":"publisher","first-page":"2298","DOI":"10.1016\/j.tcs.2010.02.021","volume":"411","author":"S. Demri","year":"2010","unstructured":"Demri, S., Lazi\u0107, R., Sangnier, A.: Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science\u00a0411(22-24), 2298\u20132316 (2010)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF00355298","volume":"4","author":"E.A. Emerson","year":"1992","unstructured":"Emerson, E.A., Mok, A.K.-L., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. Real-Time Systems\u00a04, 331\u2013352 (1992)","journal-title":"Real-Time Systems"},{"key":"6_CR18","first-page":"244","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bulletin of the EATCS\u00a052, 244\u2013262 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-14162-1_48","volume-title":"Automata, Languages and Programming","author":"S. G\u00f6ller","year":"2010","unstructured":"G\u00f6ller, S., Haase, C., Ouaknine, J., Worrell, J.: Model checking succinct and parametric one-counter automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 575\u2013586. Springer, Heidelberg (2010)"},{"key":"6_CR20","unstructured":"G\u00f6ller, S., Lohrey, M.: Branching-time model checking of one-counter processes. In: STACS 2010. Leibniz International Proceedings in Informatics, vol.\u00a020, pp. 405\u2013416. Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"6_CR21","unstructured":"Haase, C.: On the Complexity of Model Checking Counter Automata. PhD thesis, University of Oxford, UK (2012)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-04081-8_25","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C. Haase","year":"2009","unstructured":"Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 369\u2013383. Springer, Heidelberg (2009)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-39176-7_12","volume-title":"Model Checking Software","author":"J.F. Jensen","year":"2013","unstructured":"Jensen, J.F., Larsen, K.G., Srba, J., Oestergaard, L.K.: Local model checking of weighted CTL with upper-bound constraints. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol.\u00a07976, pp. 178\u2013195. Springer, Heidelberg (2013)"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of Post\u2019s problem of \u201dtag\u201d and other topics in theory of Turing machines. Annals of Mathematics\u00a074(3), 437\u2013455 (1961)","journal-title":"Annals of Mathematics"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46\u201357. IEEE Comp. Soc. Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J.-P. Queille","year":"1982","unstructured":"Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11690634_23","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Serre","year":"2006","unstructured":"Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 337\u2013351. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"6_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoretical Computer Science\u00a0158(1-2), 343\u2013359 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11936-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T08:38:54Z","timestamp":1559032734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11936-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119359","9783319119366"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11936-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}