{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:09Z","timestamp":1725549189479},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_15","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T20:07:56Z","timestamp":1267992476000},"page":"206-220","source":"Crossref","is-referenced-by-count":5,"title":["Counting CTL"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Laroussinie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eudes","family":"Petonnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/772062.772064","volume":"4","author":"M. Adler","year":"2003","unstructured":"Adler, M., Immerman, N.: An n! lower bound on formula size. ACM Transactions on Computational Logic\u00a04(3), 296\u2013314 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Inf. Comput.\u00a0104(1), 2\u201334 (1993)","journal-title":"Inf. Comput."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-58179-0_50","volume-title":"Computer Aided Verification","author":"O. Bernholtz","year":"1994","unstructured":"Bernholtz, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model-checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 142\u2013155. Springer, Heidelberg (1994)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"15_CR5","first-page":"123","volume-title":"Proc. 10th LICS","author":"A. Bouajjani","year":"1995","unstructured":"Bouajjani, A., Echahed, R., Habermehl, P.: On the verification problem of nonregular properties for nonregular processes. In: Proc. 10th LICS, pp. 123\u2013133. IEEE Comp. Soc. Press, Los Alamitos (1995)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Echahed, R., Habermehl, P.: Verifying infinite state processes with sequential and parallel composition. In: Proc. 22nd POPL, pp. 95\u2013106 (1995)","DOI":"10.1145\/199448.199470"},{"key":"15_CR7","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":"15_CR8","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, vol.\u00a0B, ch. 16, pp. 995\u20131072. Elsevier, Amsterdam (1990)"},{"issue":"4","key":"15_CR9","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., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. Real-Time Systems\u00a04(4), 331\u2013352 (1992)","journal-title":"Real-Time Systems"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0030596","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"E.A. Emerson","year":"1997","unstructured":"Emerson, E.A., Trefler, R.J.: Generalized quantitative temporal reasoning: An automata-theoretic approach. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 189\u2013200. Springer, Heidelberg (1997)"},{"key":"15_CR11","first-page":"336","volume-title":"Proc. 14th LICS","author":"E.A. Emerson","year":"1999","unstructured":"Emerson, E.A., Trefler, R.J.: Parametric quantitative temporal reasoning. In: Proc. 14th LICS, pp. 336\u2013343. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45315-6_21","volume-title":"Foundations of Software Science and Computation Structures","author":"F. Laroussinie","year":"2001","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking CTL\n                  \u2009+\u2009 and FCTL is hard. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 318\u2013331. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2005.11.020","volume":"353","author":"F. Laroussinie","year":"2006","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Efficient timed model checking for discrete-time systems. Theor. Comput. Sci.\u00a0353(1-3), 249\u2013271 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1\/2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/inco.1999.2817","volume":"156","author":"F. Laroussinie","year":"2000","unstructured":"Laroussinie, F., Schnoebelen, P.: Specification in CTL+Past for verification in CTL. Inf. Comput.\u00a0156(1\/2), 236\u2013263 (2000)","journal-title":"Inf. Comput."},{"issue":"1-3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(02)00644-8","volume":"297","author":"F. Laroussinie","year":"2003","unstructured":"Laroussinie, F., Schnoebelen, P., Turuani, M.: On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci.\u00a0297(1-3), 297\u2013315 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR16","first-page":"46","volume-title":"Proc. 18th FOCS","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th FOCS, pp. 46\u201357. IEEE Comp. Soc. Press, Los Alamitos (1977)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46691-6_9","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"T. Wilke","year":"1999","unstructured":"Wilke, T.: CTL\u2009+\u2009 is exponentially more succinct than CTL. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 110\u2013121. Springer, Heidelberg (1999)"},{"issue":"1\/2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Inf. and Control\u00a056(1\/2), 72\u201399 (1983)","journal-title":"Inf. and Control"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1145\/244795.244803","volume":"19","author":"J. Yang","year":"1997","unstructured":"Yang, J., Mok, A.K., Wang, F.: Symbolic model checking for event-driven real-time systems. ACM Transactions on Programming Languages and Systems\u00a019(2), 386\u2013412 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:32:07Z","timestamp":1558272727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}