{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:34:12Z","timestamp":1725838452622},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662488980"},{"type":"electronic","value":"9783662488997"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_20","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T03:59:28Z","timestamp":1448078368000},"page":"281-296","source":"Crossref","is-referenced-by-count":2,"title":["On CTL* with Graded Path Modalities"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Aminof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482\u2013491. Springer, Heidelberg (2011)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. In: Symposium on Logic in Computer Science, pp. 345\u2013354, IEEE (2011)","DOI":"10.1109\/LICS.2011.50"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ic.2011.10.008","volume":"210","author":"B Aminof","year":"2012","unstructured":"Aminof, B., Kupferman, O., Murano, A.: Improved model checking of hierarchical systems. Inf. Comput. 210, 68\u201386 (2012)","journal-title":"Inf. Comput."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11965893_25","volume-title":"Database Theory \u2013 ICDT 2007","author":"M Arenas","year":"2006","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Combining temporal logics for querying XML documents. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 359\u2013373. Springer, Heidelberg (2006)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bianco, A., Mogavero, F., Murano, A.: Graded computation tree logic. In: Symposium on Logic in Computer Science, pp. 342\u2013351, IEEE (2009)","DOI":"10.1109\/LICS.2009.28"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2287718.2287725","volume":"13","author":"A Bianco","year":"2012","unstructured":"Bianco, A., Mogavero, F., Murano, A.: Graded computation tree logic. ACM Trans. Comput. Log. 13(3), 25 (2012)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(3:11)2008","volume":"4","author":"PA Bonatti","year":"2008","unstructured":"Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched Mu-Calculi. Log. Methods Comput. Sci. 4(3), 1\u201327 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"20_CR8","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: International Joint Conference on Artificial Intelligence, pp. 84\u201389 (1999)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1005245900406","volume":"64","author":"M Rijke de","year":"2000","unstructured":"de Rijke, M.: A note on graded modal logic. Studia Logica 64(2), 271\u2013283 (2000)","journal-title":"Studia Logica"},{"key":"20_CR10","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2009)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45069-6_3","volume-title":"Computer Aided Verification","author":"C Eisner","year":"2003","unstructured":"Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: Reasoning with temporal logic on truncated paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 27\u201339. Springer, Heidelberg (2003)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"EA Emerson","year":"1999","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM J. Comput. 29(1), 132\u2013158 (1999)","journal-title":"SIAM J. Comput."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Sistla, A.P.: Deciding branching time logic, pp. 14\u201324. In: Symposium on Theory of Computing (1984)","DOI":"10.1145\/800057.808661"},{"key":"20_CR14","unstructured":"Ferrante, A., Murano, A., Parente, M.: Enriched $$\\mu $$ -calculi module checking. Log. Methods Comput. Sci. 4(3), 1\u201321 (2008)"},{"issue":"3","key":"20_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3233\/FI-2009-181","volume":"96","author":"A Ferrante","year":"2009","unstructured":"Ferrante, A., Napoli, M., Parente, M.: Model checking for graded CTL. Fundamenta Informaticae 96(3), 323\u2013339 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Log. 13, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Log."},{"key":"20_CR17","unstructured":"Guti\u00e9rrez-Basulto, V., Jung, J.C., Lutz, C.: Complexity of branching temporal description logics. In: European Conference on Artificial Intelligence, pp. 390\u2013395 (2012)"},{"issue":"4","key":"20_CR18","first-page":"331","volume":"28","author":"TA Henzinger","year":"2013","unstructured":"Henzinger, T.A.: Quantitative reactive modeling and verification. Comput. Sci. 28(4), 331\u2013344 (2013)","journal-title":"Comput. Sci."},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-45620-1_34","volume-title":"Automated Deduction - CADE-18","author":"O Kupferman","year":"2002","unstructured":"Kupferman, O., Sattler, U., Vardi, M.Y.: The complexity of the graded $$\\mu $$ -calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 423\u2013437. Springer, Heidelberg (2002)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata theoretic approach to branching-time model checking. J. ACM 47(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Malvone, V., Mogavero, F., Murano, A., Sorrentino, L.: On the counting of strategies. In: International Symposium on Temporal Representation and Reasoning, IEEE (2015, to appear)","DOI":"10.1109\/TIME.2015.19"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0890-5401(03)00104-4","volume":"184","author":"F Moller","year":"2003","unstructured":"Moller, F., Rabinovich, A.: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1), 147\u2013159 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/logcom\/11.1.85","volume":"11","author":"S Tobies","year":"2001","unstructured":"Tobies, S.: PSPACE reasoning for graded modal logics. J. Log. Comput. 11(1), 85\u2013106 (2001)","journal-title":"J. Log. Comput."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Meyer, JJ.Ch.: Graded modalities in epistemic logic. In: Symposium on Logical Foundations of Computer Science, pp. 503\u2013514 (1992)","DOI":"10.1007\/BFb0023902"},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"MY Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1\u201337 (1994)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T17:22:30Z","timestamp":1599844950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}