{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:35:11Z","timestamp":1649086511610},"reference-count":21,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.220.3","type":"journal-article","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T03:05:20Z","timestamp":1470193520000},"page":"27-38","source":"Crossref","is-referenced-by-count":0,"title":["Two-Buffer Simulation Games"],"prefix":"10.4204","volume":"220","author":[{"given":"Milka","family":"Hutagalung","sequence":"first","affiliation":[{"name":"University of Kassel, Germany"}]},{"given":"Norbert","family":"Hundeshagen","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}]},{"given":"Dietrich","family":"Kuske","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Ilmenau, Germany"}]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}]},{"given":"Etienne","family":"Lozes","sequence":"additional","affiliation":[{"name":"LSV, ENS Cachan & CNRS, France"}]}],"member":"2720","published-online":{"date-parts":[[2016,7,31]]},"reference":[{"key":"conf\/tacas\/AbdullaBHKV08","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-78800-3_8","article-title":"Computing Simulations over Tree Automata","volume-title":"TACAS'08","volume":"4963","author":"Abdulla","year":"2008"},{"key":"berstel1979transductions","series-title":"Leitf\u00e4den der angewandten Mathematik und Mechanik","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"LICS00*51","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/LICS.2000.855755","article-title":"Automatic Structures","volume-title":"Proc. 15th IEEE Symp. on Logic in Computer Science, LICS'00","author":"Blumensath","year":"2000"},{"issue":"2","key":"BrandZ83","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On Communicating Finite-State Machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"conf\/csr\/Carton10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-13182-0","article-title":"Right-Sequential Functions on Infinite Words","volume-title":"Proc. 5th Int. Conf. on Computer Science in Russia, CSR'10","volume":"6072","author":"Carton","year":"2010"},{"key":"ChambartS08","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-85361-9_28","article-title":"Mixing Lossy and Perfect Fifo Channels","volume-title":"CONCUR'08","volume":"5201","author":"Chambart","year":"2008"},{"key":"MayrC13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/2429069.2429079","article-title":"Advanced automata minimization","volume-title":"POPL'13","author":"Clemente","year":"2013"},{"key":"dm97handbook","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","article-title":"Partial Commutation and Traces","volume-title":"Handbook of Formal Languages","volume":"3","author":"Diekert","year":"1997"},{"key":"lncs575*255","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-55179-4_25","article-title":"Checking for Language Inclusion Using Simulation Preorders","volume-title":"CAV'91","volume":"575","author":"Dill","year":"1992"},{"key":"Emerson96","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-60915-6_3","volume-title":"Automated Temporal Reasoning about Reactive Systems","volume":"1043","author":"Emerson","year":"1996"},{"key":"EL86","first-page":"267","article-title":"Efficient Model Checking in Fragments of the Propositional \u03bc\u2013Calculus","volume-title":"Symposion on Logic in Computer Science","author":"Emerson","year":"1986"},{"key":"conf\/concur\/Etessami02","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45694-5_10","article-title":"A Hierarchy of Polynomial-Time Computable Simulations for Automata","volume-title":"CONCUR'02","volume":"2421","author":"Etessami","year":"2002"},{"key":"EtessamiWS01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-48224-5_57","article-title":"Fair Simulation Relations, Parity Games, and State Space Reduction for B\u00fcchi Automata","volume-title":"ICALP'01","volume":"2076","author":"Etessami","year":"2001"},{"key":"journals\/tcs\/FritzW05","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2005.01.016","article-title":"Simulation relations for alternating B\u00fcchi automata","volume":"338","author":"Fritz","year":"2005","journal-title":"Theor. Comput. Sci"},{"key":"GN84","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02575909","article-title":"Relations rationelles infinitaires","volume":"21","author":"Gire","year":"1984","journal-title":"Calcolo"},{"key":"GurH82","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/800070.802177","article-title":"Trees, Automata, and Games","volume-title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA","author":"Gurevich","year":"1982"},{"key":"HutagalungLL:LATA13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-37064-9_31","article-title":"Revealing vs. Concealing: More Simulation Games for B\u00fcchi Inclusion","volume-title":"LATA'2013","volume":"7810","author":"Hutagalung","year":"2013"},{"key":"DBLP:journals\/corr\/HutagalungLL14","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"286","DOI":"10.4204\/EPTCS.151.20","article-title":"Buffered Simulation Games for B\u00fcchi Automata","volume-title":"AFL'14","volume":"151","author":"Hutagalung","year":"2014"},{"key":"Jurdzinski\/00","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","article-title":"Small progress measures for solving parity games","volume-title":"STACS'00","volume":"1770","author":"Jurdzi\u0144ski","year":"2000"},{"key":"conf\/caap\/Nivat81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-10828-9_54","article-title":"Infinitary Relations","volume-title":"Proc. 6th Coll. on Trees in Algebra and Programming, CAAP'81","volume":"112","author":"Nivat","year":"1981"},{"key":"post46","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","article-title":"A variant of a recursively unsolvable problem","volume":"53","author":"Post","year":"1946","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T03:05:30Z","timestamp":1470193530000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1608.00654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,31]]},"references-count":21,"URL":"https:\/\/doi.org\/10.4204\/eptcs.220.3","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,31]]}}}