{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:48:48Z","timestamp":1784180928520,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_57","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"694-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Fair Simulation Relations, Parity Games, and State Space Reduction for B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Wilke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rebecca A.","family":"Schuller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"1","key":"57_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H. Andersen","year":"1994","unstructured":"H. Andersen. Model checking and boolean graphs. TCS, 126(1):3\u201330, 1994.","journal-title":"TCS"},{"key":"57_CR2","unstructured":"D. Bustan and O. Grumberg. Checking for fair simulation in models with B\u00fcchi fairness constraints, Dec. 2000. Tech. Rep. TR-CS-2000-13, Technion."},{"issue":"3","key":"57_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B. Bloom","year":"1995","unstructured":"B. Bloom and R. Paige. Transformational design and implementation of a new effcient solution to the ready simulation problem. Science of Computer Programming, 24(3):189\u2013220, 1995.","journal-title":"Science of Computer Programming"},{"key":"57_CR4","unstructured":"D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In Proceedings of CAV\u201991, pages 329\u2013341, 1991."},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"K. Etessami and G. Holzmann. Optimizing B\u00fcchi automata. In Proc. of 11th Int. Conf on Concurrency Theory (CONCUR), pages 153\u2013167, 2000.","DOI":"10.1007\/3-540-44618-4_13"},{"issue":"3","key":"57_CR6","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"O. Grumberg and D. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843\u2013871, 1994.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In Proc. of 36th IEEE Symp. on Foundations of Comp. Sci. (FOCS\u201995), pages 453\u2013462, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"57_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-63141-0_19","volume-title":"Proc. of 9th Int. Conf. on Concurrency Theory (CONCUR\u201997)","author":"T. Henzinger","year":"1997","unstructured":"T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. of 9th Int. Conf. on Concurrency Theory (CONCUR\u201997), number 1243 in LNCS, pages 273\u2013287, 1997."},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"T. Henzinger and S. Rajamani. Fair bisimulation. In TACAS, 2000.","DOI":"10.1007\/3-540-46419-0_21"},{"key":"57_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000, 17th Symp. on Theoretical Aspects of Computer Science","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"M. Jurdzi\u0144ski. Small progress measures for solving parity games. In STACS 2000, 17th Symp. on Theoretical Aspects of Computer Science, volume 1770 of LNCS, pages 290\u2013301. Springer-Verlag, 2000."},{"key":"57_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0168-0072(94)90086-8","volume":"69","author":"N. Klarlund","year":"1994","unstructured":"N. Klarlund. Progress measures,immediate determinacy, & a subset construction for tree automata. Ann. Pure & Applied Logic, 69:243\u2013268, 1994.","journal-title":"Ann. Pure & Applied Logic"},{"key":"57_CR12","unstructured":"O. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. In Proc. 30th ACM Symp. on Theory of Computing, 1998."},{"key":"57_CR13","unstructured":"R. Milner. Communicatation and Concurrency. Prentice-Hall, 1989."},{"issue":"6","key":"57_CR14","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. E. Tarjan. Three partition-refinement algorithms. SIAM J. of Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM J. of Computing"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"F. Somenzi and R. Bloem. Efficient B\u00fcchi automata from LTL formulae. In Proceedings of 12th Int. Conf. on Computer Aided Verification, 2000.","DOI":"10.1007\/10722167_21"},{"key":"57_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61474-5_58","volume-title":"Computer Aided Verification","author":"I. Walukiewicz","year":"1996","unstructured":"I. Walukiewicz. Pushdown processes: games and model checking. In Computer Aided Verification, LNCS, pages 62\u201375. springer-verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:47Z","timestamp":1737503387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}