{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T04:51:15Z","timestamp":1770699075525,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648963","type":"print"},{"value":"9783540684558","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055622","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"163-178","source":"Crossref","is-referenced-by-count":169,"title":["Alternating refinement relations"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th Symp. on Foundations of Computer Science, pp. 100\u2013109. IEEE Computer Society, 1997. Full version in Compositionality-The Significant Difference. Springer-Verlag Lecture Notes in Computer Science, 1998.","DOI":"10.1007\/3-540-49213-5_2"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balcazar","year":"1992","unstructured":"J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4:638\u2013648, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01784885","volume":"3","author":"J.Y. Halpern","year":"1989","unstructured":"J.Y. Halpern and R. Fagin. Modeling knowledge and action in distributed systems. Distributed Computing, 3:159\u2013179, 1989.","journal-title":"Distributed Computing"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36rd Symp. on Foundations of Computer Science, pp. 453\u2013462. IEEE Computer Society, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N. Immerman","year":"1981","unstructured":"N. Immerman. Number of quantifiers is better than number of tape cells. J. Computer and System Sciences, 22:384\u2013406, 1981.","journal-title":"J. Computer and System Sciences"},{"key":"11_CR6","unstructured":"O. Kupferman and M.Y. Vardi. Verification of fair transition systems. Chicago J. Theoretical Computer Science, 1998(2)."},{"key":"11_CR7","unstructured":"R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481\u2013489. British Computer Society, 1971."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"R. Milner. Operational and algebraic semantics of concurrent processes. In Handbook of Theoretical Computer Science, Vol. B, pp. 1201\u20131242. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90133-2","volume":"54","author":"D.E. Muller","year":"1987","unstructured":"D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267\u2013276, 1987.","journal-title":"Theoretical Computer Science"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D.E. Muller","year":"1995","unstructured":"D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: new results and new proofs of theorems of Rabin, McNaughton, and Safra. Theoretical Computer Science, 141:69\u2013107, 1995.","journal-title":"Theoretical Computer Science"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L.S. Shapley","year":"1953","unstructured":"L.S. Shapley. Stochastic games. In Proc. National Academy of Science, 39:1095\u20131100, 1953.","journal-title":"Proc. National Academy of Science"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. Computer and System Sciences, 32:182\u2013221, 1986.","journal-title":"J. Computer and System Sciences"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1\u201337, 1994.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T10:25:15Z","timestamp":1549880715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0055622","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}