{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:40:55Z","timestamp":1725550855402},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008989"},{"type":"electronic","value":"9783540365778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36577-x_26","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"363-378","source":"Crossref","is-referenced-by-count":8,"title":["Modular Strategies for Recursive Game Graphs"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Salvatore La","family":"Torre","sequence":"additional","affiliation":[]},{"given":"Parthasarathy","family":"Madhusudan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Analysis of recursive state machines","author":"R. Alur","year":"2001","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of the 13th International Conference on Computer Aided Verification, CAV\u201901, LNCS 2102, pages 207\u2013220. Springer, 2001."},{"issue":"5","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):1\u201342, 2002.","journal-title":"Journal of the ACM"},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"Bebop: A symbolic model checker for boolean programs","author":"T. Ball","year":"2000","unstructured":"T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In Proceedings of the SPIN 2000 Workshop on Model Checking of Software, LNCS 1885, pages 113\u2013130. Springer, 2000."},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"Reachability analysis of pushdown automata: Application to model-checking","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Conference on Concurrency Theory, volume 1243 of LNCS, pages 135\u2013150, Warsaw, July 1997. Springer."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J. B\u00fcchi","year":"1969","unstructured":"J. B\u00fcchi and L. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295\u2013311, 1969.","journal-title":"Trans. AMS"},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1007\/3-540-45465-9_60","volume-title":"Symbolic strategy synthesis for games on pushdown graphs","author":"T. Cachat","year":"2002","unstructured":"T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Automata, Languages and Programming, 29th Int\u2019l Coll., ICALP, Malaga, Spain, July 8\u201313, 2002, Proceedings, volume 2380 of LNCS, pages 704\u2013715. Springer."},{"key":"26_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-45657-0_35","volume-title":"Interface compatibility checking for software modules","author":"A. Chakrabarti","year":"2002","unstructured":"A. Chakrabarti, L. de Alfaro, T. Henzinger, M. Jurdzinski, and F. Mang. Interface compatibility checking for software modules. In Proceedings of the 14th Int\u2019l Conf. on Computer-Aided Verification, LNCS 2404, pages 428\u2013441. Springer, 2002."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"L. de Alfaro and T. A. Henzinger. Interface automata. In Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE), pages 109\u2013120. ACM Press, 2001.","DOI":"10.1145\/503209.503226"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"E. A. Emerson. Model checking and the mu-calculus. In N. Immerman and P. Kolaitis, editors, Proceedings of the DIMACS Symposium on Descriptive Complexity and Finite Models, pages 185\u2013214. American Mathematical Society Press, 1997.","DOI":"10.1090\/dimacs\/031\/06"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O. Kupferman","year":"1999","unstructured":"O. Kupferman and M. Vardi. Church\u2019s problem revisited. The Bulletin of Symbolic Logic, 5(2):245\u2013263, June 1999.","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/inco.2000.2893","volume":"164","author":"O. Kupferman","year":"2001","unstructured":"O. Kupferman, M. Vardi, and P. Wolper. Module checking. Information and Computation, 164(2):322\u2013344, 2001.","journal-title":"Information and Computation"},{"key":"26_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-45694-5_11","volume-title":"A decidable class of asynchronous distributed controllers","author":"P. Madhusudan","year":"2002","unstructured":"P. Madhusudan and P. S. Thiagarajan. A decidable class of asynchronous distributed controllers. In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR\u2019 02), LNCS 2421, pages 145\u2013160. Springer, 2002."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"G. Peterson and J. Reif. Multiple-person alternation. In Proc. 20st IEEE Symposium on Foundation of Computer Science, pages 348\u2013363, 1979.","DOI":"10.1109\/SFCS.1979.25"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, Austin, January 1989.","DOI":"10.1145\/75277.75293"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symposium on Foundation of Computer Sc., pages 746\u2013757, 1990.","DOI":"10.1109\/FSCS.1990.89597"},{"issue":"11","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.1109\/9.173140","volume":"37","author":"K. Rudie","year":"1992","unstructured":"K. Rudie and W. Wonham. Think globally, act locally: Decentralized supervisory control. IEEE Transactions on Automatic Control, 37(11):1692\u20131708, 1992.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"26_CR18","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume":"III","author":"W. Thomas","year":"1997","unstructured":"W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389\u2013455, 1997.","journal-title":"Handbook of Formal Language Theory"},{"key":"26_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Infinite games and verification","author":"W. Thomas","year":"2002","unstructured":"W. Thomas. Infinite games and verification. In Proceedings of the International Conference on Computer Aided Verification CAV\u201902, volume 2404 of Lecture Notes in Computer Science, pages 58\u201364. Springer, 2002."},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234\u2013263, January 2001.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36577-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T14:08:15Z","timestamp":1551017295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36577-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008989","9783540365778"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36577-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}