{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:15:11Z","timestamp":1784873711447,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603856","type":"print"},{"value":"9783540455165","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60385-9_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:24:04Z","timestamp":1330280644000},"page":"261-277","source":"Crossref","is-referenced-by-count":17,"title":["Language containment of non-deterministic \u03a9-automata"],"prefix":"10.1007","author":[{"given":"Serdar","family":"Ta\u015eiran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramin","family":"Hojati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert K.","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Y. Choueka. Theories of Automata on \u03a9-Tapes: A Simplified Approach. Journal of Computer and System Sciences, 8:117\u2013141, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"A.P. Sistla, M.Y. Vardi and P. Wolper. The Complementation Problem for B\u00fcchi Automata with Applications to Temporal Logic. Theoretical Computer Science, 49:217\u2013237, 1987.","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","first-page":"19","volume":"103","author":"R. P. Kurshan","year":"1987","unstructured":"R. P. Kurshan. Reducibility in Analysis of Coordination. In Discrete Events Systems: Models and Applications, volume 103 of LINCS, pages 19\u201339, 1987","journal-title":"LINCS"},{"key":"16_CR4","volume-title":"Ph.D. thesis","author":"B. Lin","year":"1991","unstructured":"B. Lin. Synthesis of VLSI Designs with Symbolic Techniques. Ph.D. thesis, University of California, Berkeley, 1991."},{"key":"16_CR5","volume-title":"Ph.D. thesis","author":"S. Safra","year":"1989","unstructured":"S. Safra. Complexity of Automata on Infinite Objects. Ph.D. thesis, The Weizman Institute of Science, Rehovot, Israel, March 1989."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"S. Safra. On the Complexity of \u03a9-Automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319\u2013327, 1988.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"S. Safra, and M.Y. Vardi On \u03a9-Automata and Temporal Logic. In Proc. 21st ACM Symp. on Theory of Computing, 1989.","DOI":"10.1145\/73007.73019"},{"key":"16_CR8","unstructured":"R. P. Kurshan Automata-Theoretic Verification of Coordinating Processes. UC Berkeley Lecture Notes, 1992."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"S. Safra. Exponential Determinization for \u03a9-Automata with Strong-Fairness Acceptance Conditions. In Proc. 24th ACM Symposium on Theory of Computing, 1992.","DOI":"10.1145\/129712.129739"},{"key":"16_CR10","unstructured":"S. Safra. Private Communication."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"E. Cerny. Verification of I\/O Trace Set Inclusion for a Class of Nondeterministic Finite State Machines. In Proc. Int'l Conference on Computer Design, Cambridge, pages 526\u2013529, October 1992.","DOI":"10.1109\/ICCD.1992.276231"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"D. L. Dill, A. J. Hu and H. Wong-Toi Checking for Language Inclusion Using Simulation Preorders. In Proc. of the Third Workshop on Computer-Aided Verification, 1991.","DOI":"10.1007\/3-540-55179-4_25"},{"key":"16_CR13","unstructured":"R. Hojati and R. K. Brayton Computing Fair Simulation Relations. Unpublished manuscript."},{"key":"16_CR14","unstructured":"A. Aziz, F. Balarin, R. K. Brayton, S.-T. Cheng, R. Hojati, T. Kam, S. C. Krishnan, R. K. Ranjan A. L. Sangiovanni-Vincentelli T. R. Shiple V. Singhal, S. Ta\u015eiran, H.-Y. Wang. HSIS: A BDD-Based Environment for Formal Verification. In Proc. of the Design Automation Conf., June 1994."},{"key":"16_CR15","volume-title":"M.S. thesis","author":"S. Ta\u015eiran","year":"1995","unstructured":"S. Ta\u015eiran Language Containment Using Non-deterministic \u03a9-Automata. M.S. thesis, University of California, Berkeley, 1995."}],"container-title":["Lecture Notes in Computer Science","Correct Hardware Design and Verification Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60385-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:02:18Z","timestamp":1742598138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60385-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603856","9783540455165"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60385-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}