{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:28:42Z","timestamp":1747888122545,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466803"},{"type":"electronic","value":"9783662466810"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46681-0_57","type":"book-chapter","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T22:56:36Z","timestamp":1427756196000},"page":"628-642","source":"Crossref","is-referenced-by-count":14,"title":["Limit Deterministic and Probabilistic Automata for LTL \u2216 GU"],"prefix":"10.1007","author":[{"given":"Dileep","family":"Kini","sequence":"first","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"57_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R. Alur","year":"2004","unstructured":"Alur, R., Torre, S.L.: Deterministic generators and games for ltl fragments. ACM Trans. Comput. Logic\u00a05(1), 1\u201325 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-02444-8_4","volume-title":"Automated Technology for Verification and Analysis","author":"T. Babiak","year":"2013","unstructured":"Babiak, T., Blahoudek, F., K\u0159et\u00ednsk\u00fd, M., Strej\u010dek, J.: Effective translation of LTL to deterministic Rabin automata: Beyond the (F,G)-fragment. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 24\u201339. Springer, Heidelberg (2013)"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing omega-regular languages with probabilistic automata. In: LICS, pp. 137\u2013146 (2005)","DOI":"10.1109\/LICS.2005.41"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. J. ACM\u00a056(5), 26:1\u201326:44 (2009)","DOI":"10.1145\/1552285.1552287"},{"issue":"4","key":"57_CR5","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"57_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-08867-9_13","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2014","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J.: From LTL to deterministic automata: A safraless compositional approach. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol.\u00a08559, pp. 192\u2013208. Springer, Heidelberg (2014)"},{"key":"57_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P. Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to b\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 53\u201365. Springer, Heidelberg (2001)"},{"key":"57_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-54013-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Kini","year":"2014","unstructured":"Kini, D., Viswanathan, M.: Probabilistic automata for safety LTL specifications. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol.\u00a08318, pp. 118\u2013136. Springer, Heidelberg (2014)"},{"key":"57_CR9","unstructured":"Kini, D., Viswanathan, M.: Probabilistic b\u00fcchi automata for LTL\u2216GU. Technical Report University of Illinois at Urbana-Champaign (2015), http:\/\/hdl.handle.net\/2142\/72686"},{"issue":"2","key":"57_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tcs.2006.07.022","volume":"363","author":"J. Klein","year":"2006","unstructured":"Klein, J., Baier, C.: Experiments with deterministic \u03c9-automata for formulas of linear temporal logic. Theoretical Computer Science\u00a0363(2), 182\u2013195 (2006)","journal-title":"Theoretical Computer Science"},{"key":"57_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-31424-7_7","volume-title":"Computer Aided Verification","author":"J. K\u0159et\u00ednsk\u00fd","year":"2012","unstructured":"K\u0159et\u00ednsk\u00fd, J., Esparza, J.: Deterministic automata for the (F,G)-fragment of LTL. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 7\u201322. Springer, Heidelberg (2012)"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-02444-8_32","volume-title":"Automated Technology for Verification and Analysis","author":"J. K\u0159et\u00ednsk\u00fd","year":"2013","unstructured":"K\u0159et\u00ednsk\u00fd, J., Garza, R.L.: Rabinizer 2: Small deterministic automata for LTL\u2216 GU. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 446\u2013450. Springer, Heidelberg (2013)"},{"key":"57_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-78163-9_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Morgenstern","year":"2008","unstructured":"Morgenstern, A., Schneider, K.: From LTL to symbolically represented deterministic automata. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 279\u2013293. Springer, Heidelberg (2008)"},{"key":"57_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11609773_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 364\u2013380. Springer, Heidelberg (2006)"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Zaks, A.: On the merits of temporal testers. In: 25 Years of Model Checking, pp. 172\u2013195 (2008)","DOI":"10.1007\/978-3-540-69850-0_11"},{"key":"57_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 248\u2013263. Springer, Heidelberg (2000)"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M., Wolper, P., Sistla, A.P.: Reasoning about infinite computation paths. In: FOCS (1983)","DOI":"10.1109\/SFCS.1983.51"},{"key":"57_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46681-0_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:25:58Z","timestamp":1747855558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46681-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466803","9783662466810"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46681-0_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}