{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:15Z","timestamp":1725663795755},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525905"},{"type":"electronic","value":"9783540470427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52590-4_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:38:49Z","timestamp":1330187929000},"page":"103-116","source":"Crossref","is-referenced-by-count":10,"title":["A unified approach for showing language containment and equivalence between various types of \u03c9-automata"],"prefix":"10.1007","author":[{"given":"E. M.","family":"Clarke","sequence":"first","affiliation":[]},{"given":"I. A.","family":"Browne","sequence":"additional","affiliation":[]},{"given":"R. P.","family":"Kurshan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"D. L. Dill and E. M. Clarke. Automatic verification of asynchronous circuits using temporal logic IEE Proceedings, 133, part E(5), Sep 1986.","DOI":"10.1049\/ip-e.1986.0034"},{"issue":"1","key":"7_CR4","first-page":"1","volume":"30","author":"E. A. Emerson","year":"1985","unstructured":"E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. JCSS, 30(1):1\u201324, 1985.","journal-title":"JCSS"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. L. Lei. Temporal reasoning under generalized fairness constraints. In Springer LNCS 210, STACS86, Orsay, France, January 1986.","DOI":"10.1007\/3-540-16078-7_62"},{"key":"7_CR6","unstructured":"J. R. B\u00fcchi. On a decision method in resticted secon-order arithmetics. In Proceedings, International Congres on Logic Method and Philosophy of Science, 1960, pages 1\u201312, Stanford University Press, 1962."},{"key":"7_CR7","first-page":"59","volume":"35","author":"R. P. Kurshan","year":"1987","unstructured":"R. P. Kurshan. Complementing Deterministic B\u00fcchi Automata in Polynomial Time. JCSS, 35:59\u201371, 1987.","journal-title":"JCSS"},{"key":"7_CR8","unstructured":"R. P. Kurshan. Testing Containment of \u03c9-Regular Languages. Technical Report 1121-861010-33-TM, Bell Laboratories, 1986."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Z. Manna and A.Pnueli. Specification and verification of concurrent programs by \u2200-automata. In Proceedings \u2014 Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987, pages 1\u201312, ACM, 1987.","DOI":"10.1145\/41625.41626"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"D. E. Muller. Infinite sequences and finite machines. In Switching Cicuit Theory and Logical Design: Proceedings, Fourth Annual Symposium, pages 3\u201316, 1963.","DOI":"10.1109\/SWCT.1963.8"},{"key":"7_CR11","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions, American Mathematical Society, 141:1\u201335, (1969).","journal-title":"Transactions, American Mathematical Society"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"S. Safra. On the complexity of \u03c9-automata. In Symposium on Foundations of Computer Science, IEEE, Oct 1988.","DOI":"10.1109\/SFCS.1988.21948"},{"issue":"2","key":"7_CR13","first-page":"733","volume":"32","author":"A. P. Sistla","year":"1986","unstructured":"A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of the Association of Computing Machinery, 32(2):733\u2013749, 1986.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R. S. Streett","year":"1982","unstructured":"R. S. Streett. Propositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121\u2013141, 1982.","journal-title":"Information and Control"},{"key":"7_CR15","unstructured":"M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the Conference on Logic in Computer Science, Boston, Mass., June 1986."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"P. Wolper. Temporal logic can be more expressive. Inf. Control, 56:72\u201379, 1983.","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","CAAP '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52590-4_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:24:45Z","timestamp":1605630285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52590-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525905","9783540470427"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-52590-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}