{"publist_id":"7995","type":"book_chapter","publication_status":"published","scopus_import":1,"publisher":"Springer","citation":{"apa":"Bloem, R., Chatterjee, K., &#38; Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, &#38; R. Bloem (Eds.), <i>Handbook of Model Checking</i> (1st ed., pp. 921–962). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">https://doi.org/10.1007/978-3-319-10575-8_27</a>","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">https://doi.org/10.1007/978-3-319-10575-8_27</a>.","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. <i>Handbook of Model Checking</i>. 1st ed. Springer; 2018:921-962. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">10.1007/978-3-319-10575-8_27</a>","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in <i>Handbook of Model Checking</i>, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_27\">10.1007/978-3-319-10575-8_27</a>."},"publication":"Handbook of Model Checking","month":"05","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches."}],"status":"public","date_published":"2018-05-19T00:00:00Z","oa_version":"None","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"publication_identifier":{"isbn":["978-3-319-10574-1"]},"date_updated":"2021-01-12T08:05:10Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:24Z","editor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Clarke","first_name":"Edmund M.","full_name":"Clarke, Edmund M."},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"}],"title":"Graph games and reactive synthesis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"921 - 962","_id":"59","edition":"1","day":"19","year":"2018","doi":"10.1007/978-3-319-10575-8_27","quality_controlled":"1"}