{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:18Z","timestamp":1759638858205},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_20","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T10:07:40Z","timestamp":1141207660000},"page":"238-249","source":"Crossref","is-referenced-by-count":8,"title":["Deeper Connections Between LTL and Alternating Automata"],"prefix":"10.1007","author":[{"given":"Radek","family":"Pel\u00e1nek","sequence":"first","affiliation":[]},{"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"422","volume-title":"Proceedings of the 3rd IEEE Symposium on Logic in Computer Science (LICS 1988)","author":"D.E. Muller","year":"1988","unstructured":"Muller, D.E., Saoudi, A., Schupp, P.E.: Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In: Proceedings of the 3rd IEEE Symposium on Logic in Computer Science (LICS 1988), pp. 422\u2013427. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"20_CR2","unstructured":"Rohde, S.: Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois at Urbana-Champaign (1997)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44929-9_36","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"C. L\u00f6ding","year":"2000","unstructured":"L\u00f6ding, C., Thomas, W.: Alternating automata and logics over infinite words (extended abstract). In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 2003","author":"I. \u010cern\u00e1","year":"2003","unstructured":"\u010cern\u00e1, I., Pel\u00e1nek, R.: Relating hierarchy of temporal properties to model checking. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, Springer, Heidelberg (2003)"},{"key":"20_CR5","first-page":"185","volume-title":"24th Annual Symposium on Foundations of Computer Science","author":"P. Wolper","year":"1983","unstructured":"Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths (extended abstract). In: 24th Annual Symposium on Foundations of Computer Science, pp. 185\u2013194. IEEE, Los Alamitos (1983)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115, 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"20_CR7","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the First Symposium on Logic in Computer Science, Cambridge, pp. 322\u2013331 (1986)"},{"key":"20_CR8","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. Information and Control\u00a056, 72\u201399 (1983)","journal-title":"Information and Control"},{"key":"20_CR9","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":"20_CR10","unstructured":"Tauriainen, H.: On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science (2003)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-63104-6_19","volume-title":"Automated Deduction - CADE-14","author":"M.Y. Vardi","year":"1997","unstructured":"Vardi, M.Y.: Alternating automata: Unifying truth and validity checking for temporal logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"20_CR12","first-page":"256","volume-title":"37th Annual Symposium on Foundations of Computer Science (FOCS 1996)","author":"D. Th\u00e9rien","year":"1996","unstructured":"Th\u00e9rien, D., Wilke, T.: Temporal logic and semidirect products: An effective characterization of the until hierarchy. In: 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 256\u2013263. IEEE, Los Alamitos (1996)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1006\/inco.1999.2846","volume":"160","author":"K. Etessami","year":"2000","unstructured":"Etessami, K., Wilke, T.: An until hierarchy and other applications of an Ehrenfeucht-Fra\u00efss\u00e9 game for temporal logic. Information and Computation\u00a0160, 88\u2013108 (2000)","journal-title":"Information and Computation"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, A., Strej\u010dek, J.: The stuttering principle revisited. Acta Informatica (to appear, 2005)","DOI":"10.1007\/s00236-005-0164-4"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-30577-4_27","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"A. Ku\u010dera","year":"2005","unstructured":"Ku\u010dera, A., Strej\u010dek, J.: Characteristic patterns for LTL. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 239\u2013249. Springer, Heidelberg (2005)"},{"key":"20_CR16","series-title":"Pure and Applied Mathematics","volume-title":"Infinite words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/93385.93442","volume-title":"Proc. ACM Symposium on Principles of Distributed Computing","author":"Z. Manna","year":"1990","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 377\u2013410. ACM Press, New York (1990)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-55719-9_97","volume-title":"Automata, Languages and Programming","author":"E. Chang","year":"1992","unstructured":"Chang, E., Manna, Z., Pnueli, A.: Characterization of temporal property classes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 474\u2013486. Springer, Heidelberg (1992)"},{"key":"20_CR19","unstructured":"Pel\u00e1nek, R., Strej\u010dek, J.: Deeper connections between ltl and alternating automata. Technical Report FIMU-RS-2004-08, Faculty of Informatics, Masaryk University in Brno (2004), available at http:\/\/www.fi.muni.cz\/reports\/"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:17Z","timestamp":1619492717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11605157_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}