{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:15Z","timestamp":1725455835363},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051659X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026315","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:35:17Z","timestamp":1132396517000},"page":"384-399","source":"Crossref","is-referenced-by-count":0,"title":["On the emptiness problem of tree automata and completeness of modal logics of programs"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Wagner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K.; Kozen, D.C.; Stockmeyer, L.J.: Alternation Journal of the ACM 28, 1981, pp. 114\u2013133","journal-title":"Journal of the ACM"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Automata, Tableaux and Temporal Logics Proc. Workshop on Logics of Programs, LNCS 193, 1985","DOI":"10.1007\/3-540-15648-8_7"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.; Halpern, J.Y.: \u201cSometimes\u201d and \u201cNot Never\u201d Revisited: On Branching versus Linear Time Proc. 10th ACM Symposium on Principles of Programming Languages, 1983","DOI":"10.1145\/567067.567081"},{"key":"24_CR4","unstructured":"Emerson, E.A.; Lei, C.: Temporal Model Checking under Generalized Fairness Constraints Proc. 18th Annual Hawai International Conference on System Sciences, 1985, pp. 277\u2013288"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J.; Ladner, R.E.: Propositional Dynamic Logic of Regular Programs Journal of Computer and System Sciences 18, 1979, pp. 194\u2013211","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Harel, D.: Dynamic Logic in: Handbook of Philosophical Logic (ed. D. Gabbay, F. Guenthner) vol. II, 1984, pp. 497\u2013604","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Hossley, R.; Rackoff, C.W.: The Emptiness Problem for Automata on Infinite Trees Proc. 13th IEEE Symposium on Switching and Automata Theory, 1972, pp. 121\u2013124","DOI":"10.1109\/SWAT.1972.28"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N.D. Jones","year":"1976","unstructured":"Jones, N.D.; Laaser, W.T.: Complete Problems for Deterministic Polynomial Time Theoretical Computer Science 3, 1976, pp. 105\u2013117","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D.C. Kozen","year":"1983","unstructured":"Kozen, D.C.: Results on the Propositional \u03bc-Calculus Theoretical Computer Science 27, 1983, pp. 333\u2013354","journal-title":"Theoretical Computer Science"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D.E. Muller","year":"1987","unstructured":"Muller, D.E.; Schupp, P.E.: Alternating Automata on Infinite Trees Theoretical Computer Science 54, 1987, pp. 267\u2013276","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Parikh, R: Propositional Game Logic Proc. 25th IEEE Symp. on Found. of Computer Science, 1983, pp. 195\u2013200","DOI":"10.1109\/SFCS.1983.47"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Rabin, M.O: Weakly Definable Relations and Special Automata Proc. Symp. Math. Logic and Foundations of Set Theory (Y. Bar-Hilllel, ed.), North-Holland, 1970, pp. 1\u201323","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Street, R.S.: Propositional Dynamic Logic of Looping and Converse Techn. Report MIT\/LCS\/TR-263 Massachusetts Institute of Technology, 1981","DOI":"10.1145\/800076.802492"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.; Stockmeyer, L.: Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report Proc. 17th Annual ACM Symp. on Theory of Computing, 1985, pp. 240\u2013251","DOI":"10.1145\/22145.22173"},{"key":"24_CR15","first-page":"501","volume":"164","author":"M.Y. Vardi","year":"1983","unstructured":"Vardi, M.Y.; Wolper, P.: Yet another Process Logic Proc. Workshop on Logics of Programs, LNCS 164, 1983, pp. 501\u2013512","journal-title":"LNCS"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y.; Wolper, P.: Automata Theoretic Techniques for Modal Logics of Programs Journal of Computer and System Sciences 32, 1986, pp. 183\u2013220","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","CSL '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026315.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T02:20:39Z","timestamp":1626747639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051659X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0026315","relation":{},"subject":[]}}