{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:35:11Z","timestamp":1768523711022,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319681665","type":"print"},{"value":"9783319681672","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68167-2_10","type":"book-chapter","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T23:50:53Z","timestamp":1506383453000},"page":"139-155","source":"Crossref","is-referenced-by-count":4,"title":["The Density of Linear-Time Properties"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazem","family":"Torfah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Asarin, E., Blockelet, M., Degorre, A., Dima, C., Mu, C.: Asymptotic behaviour in temporal logic. In: LICS 2014. ACM, New York (2014)","DOI":"10.1145\/2603088.2603158"},{"key":"10_CR2","series-title":"Representation and Mind Series","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. Representation and Mind Series. The MIT Press, Cambridge (2008)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-24698-5_30","volume-title":"LATIN 2004: Theoretical Informatics","author":"M Bodirsky","year":"2004","unstructured":"Bodirsky, M., G\u00e4rtner, T., von Oertzen, T., Schwinghammer, J.: Efficiently computing the density of regular languages. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 262\u2013270. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24698-5_30"},{"issue":"2","key":"10_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite state languages. Inf. Control 1(2), 91\u2013112 (1958)","journal-title":"Inf. Control"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E Clarke","year":"2001","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Form. Methods Syst. Des. 19(1), 7\u201334 (2001)","journal-title":"Form. Methods Syst. Des."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/S0304-3975(03)00286-X","volume":"304","author":"ED Demaine","year":"2003","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: On universally easy classes for NP-complete problems. Theoret. Comput. Sci. 304, 471\u2013476 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","unstructured":"Eisman, G., Ravikumar, B.: Approximate recognition of non-regular languages by finite automata. In: Proceedings of the 28th Australasian Conference on Computer Science, ACSC 2005, Darlinghurst, Australia, vol. 38 (2005)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-24953-7_13","volume-title":"Automated Technology for Verification and Analysis","author":"R Faran","year":"2015","unstructured":"Faran, R., Kupferman, O.: Spanning the spectrum from safety to liveness. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 183\u2013200. Springer, Cham (2015). doi:\n10.1007\/978-3-319-24953-7_13"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-04921-2_29","volume-title":"Language and Automata Theory and Applications","author":"B Finkbeiner","year":"2014","unstructured":"Finkbeiner, B., Torfah, H.: Counting models of linear-time temporal logic. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 360\u2013371. Springer, Cham (2014). doi:\n10.1007\/978-3-319-04921-2_29"},{"issue":"23","key":"10_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(87)90011-9","volume":"49","author":"P Flajolet","year":"1987","unstructured":"Flajolet, P.: Analytic models and ambiguity of context-free languages. Theoret. Comput. Sci. 49(23), 283\u2013309 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-31980-1_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Grosu","year":"2005","unstructured":"Grosu, R., Smolka, S.A.: Monte Carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 271\u2013286. Springer, Heidelberg (2005). doi:\n10.1007\/978-3-540-31980-1_18"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-14031-0_35","volume-title":"Computing and Combinatorics","author":"M Hartwig","year":"2010","unstructured":"Hartwig, M.: On the density of regular and context-free languages. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 318\u2013327. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14031-0_35"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02930-1_20","volume-title":"Automata, Languages and Programming","author":"L Kuhtz","year":"2009","unstructured":"Kuhtz, L., Finkbeiner, B.: LTL path checking is efficiently parallelizable. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 235\u2013246. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-02930-1_20"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-45187-7_17","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N Markey","year":"2003","unstructured":"Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 251\u2013265. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-45187-7_17"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual Symposium on Switching and Automata Theory, SWAT 1972. IEEE, Washington, DC (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"10_CR16","unstructured":"Patrizi, F., Lipovetzky, N., De Giacomo, G., Geffner, H.: Computing infinite plans for LTL goals using a classical planner. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, 16\u201322 July 2011. IJCAI\/AAAI (2011)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic b\u00fcchi and streett automata to deterministic parity automata. In: 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 255\u2013264 (2006)","DOI":"10.1109\/LICS.2006.28"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-73370-6_11","volume-title":"Model Checking Software","author":"KY Rozier","year":"2007","unstructured":"Rozier, K.Y., Vardi, M.Y.: LTL satisfiability checking. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 149\u2013167. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-73370-6_11"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11901914_20","volume-title":"Automated Technology for Verification and Analysis","author":"S Schewe","year":"2006","unstructured":"Schewe, S.: Synthesis for probabilistic environments. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 245\u2013259. Springer, Heidelberg (2006). doi:\n10.1007\/11901914_20"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992). doi:\n10.1007\/3-540-55808-X_48"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00596-1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"W Thomas","year":"2009","unstructured":"Thomas, W.: Facets of synthesis: revisiting church\u2019s problem. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 1\u201314. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-00596-1_1"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Torfah, H., Zimmermann, M.: The complexity of counting models of linear-time temporal logic. Acta Inform. pp. 1\u201322 (2016)","DOI":"10.1007\/s00236-016-0284-z"},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."}],"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-68167-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T03:50:57Z","timestamp":1507002657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68167-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319681665","9783319681672"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68167-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}