{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T09:08:07Z","timestamp":1743325687135,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551799"},{"type":"electronic","value":"9783540467632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55179-4_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:51:14Z","timestamp":1330249874000},"page":"255-265","source":"Crossref","is-referenced-by-count":38,"title":["Checking for language inclusion using simulation preorders"],"prefix":"10.1007","author":[{"given":"David L.","family":"Dill","sequence":"first","affiliation":[]},{"given":"Alan J.","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Howard","family":"Wong-Toi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clark, K.L. McMillan, and David L. Dill, \u201cSequential Circuit Verification Using Symbolic Model Checking,\u201d 27th ACM\/IEEE Design Automation Conference, 1990, pp. 46\u201351.","DOI":"10.1145\/123186.123223"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clark, K.L. McMillan, D.L. Dill, and L.J. Hwang, \u201cSymbolic Model Checking: 1020 States and Beyond,\u201d Proceedings of the Conference on Logic in Computer Science, 1990, pp. 428\u2013439.","DOI":"10.1109\/LICS.1990.113767"},{"key":"25_CR3","unstructured":"A.A. Bestavros, \u201cThe input-output timed automaton: a model for real-time parallel computation\u201d, Presentation at Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 1990."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Karl S. Brace, Richard L. Rudell, and Randal E. Bryant, \u201cEfficient Implementation of a BDD Package,\u201d 27th ACM\/IEEE Design Automation Conference, 1990, pp. 40\u201345.","DOI":"10.1145\/123186.123222"},{"issue":"No.8","key":"25_CR5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"Randal E. E. Bryant","year":"1986","unstructured":"Randal E. Bryant, \u201cGraph-Based Algorithms for Boolean Function Manipulation\u201d, IEEE Transactions on Computers, Vol. C-35, No. 8 (August 1986), pp. 677\u2013691.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow. B. Steffen, \u201cThe Concurrency Workbench\u201d, Proceedings of the International Workshop on Automatic Verification of Finite State Systems, June 1989, LNCS 407, J. Sifakis (ed.), Springer-Verlag 1989, pp. 24\u201337.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"A. Ginzburg, \u201cAlgebraic Theory of Automata\u201d, ACM Monograph Series, Academic Press, 1968.","DOI":"10.1016\/B978-1-4832-0013-2.50009-6"},{"key":"25_CR8","unstructured":"N. Klarlund, \u201cProgress Measures and Finite Arguments for Infinite Computations\u201d, Ph.D Thesis, Cornell University, TR 90-1153, September 1990."},{"key":"25_CR9","unstructured":"N. Klarlund and F.B. Schneider, \u201cVerifying safety properties using infinite-state automata\u201d, Technical report. TR-1036, Cornell University, 1989."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"R. Kurshan, \u201cAnalysis of discrete event coordination\u201d, in Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, LNCS 430, J.W. deBakker, W.-P. de Roever, G. Rozenberg (eds.), Springer-Verlag 1990, pp. 414\u2013453.","DOI":"10.1007\/3-540-52559-9_74"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"N.A. Lynch, H. Attiya, \u201cUsing mappings to prove timing properties\u201d, MIT-LCS-TM-412.b, 1989.","DOI":"10.21236\/ADA213967"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Paul Loewenstein and David Dill, \u201cFormal Verification of Cache Systems using Refinement Relations,\u201d IEEE International Conference on Computer Design, 1990, pp. 228\u2013233.","DOI":"10.1109\/ICCD.1990.130211"},{"issue":"4","key":"25_CR13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TSE.1984.5010246","volume":"SE-10","author":"S. S. Lam","year":"1984","unstructured":"S.S. Lam, A.U. Shankar, \u201cProtocol verification via projections\u201d, IEEE Transactions on Software Engineering, SE-10(4):325\u2013342, July 1984.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"N.A. Lynch, M.R. Tuttle, \u201cHierarchical correctness proofs for distributed algorithms\u201d, in Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, 1987, pp. 137\u2013151.","DOI":"10.1145\/41840.41852"},{"key":"25_CR15","unstructured":"R. Milner, \u201cAn algebraic definition of simulation between programs\u201d, Proceedings of the 2nd International Joint Conference on Artificial Intelligence, British Computer Society, 1971, pp. 481\u2013489."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"D.M.R. Park, \u201cConcurrency and automata on infinite sequences\u201d, in Proc. 5th GI conference (P. Deussen. ed.), LNCS 104, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55179-4_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:30:40Z","timestamp":1742592640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}