{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:24:55Z","timestamp":1770272695682,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540439974","type":"print"},{"value":"9783540456575","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_51","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T14:59:43Z","timestamp":1179586783000},"page":"610-623","source":"Crossref","is-referenced-by-count":28,"title":["Fair Simulation Minimization"],"prefix":"10.1007","author":[{"given":"Sankar","family":"Gurumurthy","sequence":"first","affiliation":[]},{"given":"Roderick","family":"Bloem","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Somenzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"51_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/3-540-48683-6_21","volume-title":"Eleventh Conference on Computer Aided Verification (CAV\u201999)","author":"R. Bloem","year":"1999","unstructured":"R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In N. Halbwachs and D. Peled, editors, Eleventh Conference on Computer Aided Verification (CAV\u201999), pages 222\u2013235. Springer-Verlag, Berlin, 1999. LNCS 1633."},{"key":"51_CR2","series-title":"Lect Notes Comput Sci","first-page":"255","volume-title":"Third Workshop on Computer Aided Verification (CAV\u201991)","author":"D. L. Dill","year":"1991","unstructured":"D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In K. G. Larsen and A. Skou, editors, Third Workshop on Computer Aided Verification (CAV\u201991), pages 255\u2013265. Springer, Berlin, July 1991. LNCS 575."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 368\u2013377, October 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"51_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"Proc. 11th International Conference on Concurrency Theory (CONCUR2000)","author":"K. Etessami","year":"2000","unstructured":"K. Etessami and G. J. Holzmann. Optimizing B\u00fcchi automata. In Proc. 11th International Conference on Concurrency Theory (CONCUR2000), pages 153\u2013167. Springer, 2000. LNCS 1877."},{"key":"51_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-48224-5_57","volume-title":"Automata, Languages and Programming: 28th International Colloquium","author":"K. Etessami","year":"2001","unstructured":"K. Etessami, T. Wilke, and A. Schuller. Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Automata, Languages and Programming: 28th International Colloquium, pages 694\u2013707, Crete, Greece, July 2001. Springer. LNCS 2076."},{"key":"51_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-63141-0_19","volume-title":"Proceedings of the 9th International Conference on Concurrency Theory (CONCUR\u201997)","author":"T. Henzinger","year":"1997","unstructured":"T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR\u201997), pages 273\u2013287. Springer-Verlag, 1997. LNCS 1243."},{"key":"51_CR7","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 Annual Symposium 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 Annual Symposium on Theoretical Aspects of Computer Science, pages 290\u2013301, Lille, France, February 2000. Springer. LNCS 1770."},{"key":"51_CR8","volume-title":"Computer-Aided Verification of Coordinating Processes","author":"R. P. Kurshan","year":"1994","unstructured":"R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994."},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97\u2013107, New Orleans, January 1985.","DOI":"10.1145\/318593.318622"},{"key":"51_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ, 1989."},{"key":"51_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Twelfth Conference on Computer Aided Verification (CAV\u201900)","author":"F. Somenzi","year":"2000","unstructured":"F. Somenzi and R. Bloem. Efficient B\u00fcchi automata from LTL formulae. In E. A. Emerson and A. P. Sistla, editors, Twelfth Conference on Computer Aided Verification (CAV\u201900), pages 248\u2013263. Springer-Verlag, Berlin, July 2000. LNCS 1855."},{"key":"51_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science","author":"W. Thomas","year":"1995","unstructured":"W. Thomas. On the synthesis of strategies in infinite games. In Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science, pages 1\u201313. Springer-Verlag, 1995. LNCS 900."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 185\u2013194, 1983.","DOI":"10.1109\/SFCS.1983.51"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:37:30Z","timestamp":1550345850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_51","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}