{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:49:08Z","timestamp":1754484548577},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564966"},{"type":"electronic","value":"9783540475729"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56496-9_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:13:15Z","timestamp":1330236795000},"page":"396-409","source":"Crossref","is-referenced-by-count":26,"title":["Efficient \u03c9-regular language containment"],"prefix":"10.1007","author":[{"given":"Ramin","family":"Hojati","sequence":"first","affiliation":[]},{"given":"Herve","family":"Touati","sequence":"additional","affiliation":[]},{"given":"Robert P.","family":"Kurshan","sequence":"additional","affiliation":[]},{"given":"Robert K.","family":"Brayton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"G. Boudel, V. Roy, R. de Simone, D. Vergamini, \u201cProcess Calculi, from Theory to Practice: Verification Tools\u201d, in Automatic Verification Methods for Finite State Systems, Joe Sifakis ed., LNCS 407,1989.","DOI":"10.1007\/3-540-52148-8_1"},{"key":"31_CR2","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, L. J. Hwang, \u201cSymbolic Model Checking: 1020 states and Beyond\u201d. Logic in Computer Science, 1990."},{"key":"31_CR3","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, \u201cTheories of Automata on \u03c9-Tapes: A Simplified Approach\u201d, Journal of Computer and System Sciences 8, 117\u2013141, 1974.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"31_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E A. Emerson, A. P. Sistla. \u201cAutomatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications\u201d, ACM Transactions on Programming Languages and Systems. 8(2):244\u2013263,1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR5","unstructured":"E. A. Emerson, C. L. Lei. \u201cEfficient Model Checking in Fragments of the Prepositional Mu-Calculus\u201d, In Symp. on Logic in Computer Science. IEEE, June 1986."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"E. A. Emerson, C. L. Lei, \u201cModalities for Model Checking: Branching Tune Logic Strikes Back\u201d, Science of Computer Programming 8, 275\u2013306, Elsevier Science Publishers, 1987.","DOI":"10.1016\/0167-6423(87)90036-0"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, I. A. Draghicescu, R. P. Kurshan, \u201cA Unified Approach for Showing Containment and Equivalence Between Various Types of \u03c9-Automata\u201d. In Proceedings of Fifteenth Colloquium on Trees in Algebra and Programming, 1990.","DOI":"10.1007\/3-540-52590-4_43"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Z. Har'El, R. Kurshan. \u201cSoftware for Analytical Development of Communications Protocols\u201d, ATT technical journal, 1990.","DOI":"10.1002\/j.1538-7305.1990.tb00102.x"},{"key":"31_CR9","volume-title":"Memorandum No. UCB\/ERL, M90\/125","author":"T. Kam","year":"1990","unstructured":"T. Kam, R. Brayton. \u201cMulti-valued Decision Diagrams\u201d, Electronics Research Laboratory, University of California, Berkeley, Memorandum No. UCB\/ERL, M90\/125, 1990."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"R. Kurshan. \u201cAnalysis of Discrete Event Coordination\u201d, Lecture Notes in Computer Science, 1990.","DOI":"10.1007\/3-540-52559-9_74"},{"key":"31_CR11","unstructured":"H. Touati, H. Savoj, B. Lin, R. K. Brayton, A. S. Vincentelli, \u201cImplicit State Enumeration of Finite State Machines Using BDD's\u201d, International Conference on ComputerAided Design, 1990."},{"key":"31_CR12","unstructured":"H. Touati, R. Kurshan, R. Bray (on. \u201cTesting Language Containment of \u03c9Automata Using BDDs\u201d, International Workshop on Formal Methods in VLSI Design, 1991."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56496-9_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:05Z","timestamp":1605629045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56496-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564966","9783540475729"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56496-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}