{"intvolume":"       386","extern":1,"date_created":"2018-12-11T12:09:49Z","publist_id":"81","date_updated":"2021-01-12T08:00:37Z","_id":"4626","issue":"3","date_published":"2007-11-01T00:00:00Z","quality_controlled":0,"month":"11","doi":"10.1016/j.tcs.2007.07.008","publication_status":"published","author":[{"last_name":"De Alfaro","first_name":"Luca","full_name":"de Alfaro, Luca"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"publication":"Theoretical Computer Science","abstract":[{"lang":"eng","text":"We consider concurrent two-player games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states; the objective of player 2 is to prevent this. These are zero-sum games, and the reachability objective is one of the most basic objectives: determining the set of states from which player 1 can win the game is a fundamental problem in control theory and system verification. There are three types of winning states, according to the degree of certainty with which player 1 can reach the target. From type-1 states, player 1 has a deterministic strategy to always reach the target. From type-2 states, player 1 has a randomized strategy to reach the target with probability 1. From type-3 states, player 1 has for every real ε&gt;0 a randomized strategy to reach the target with probability greater than 1−ε. We show that for finite state spaces, all three sets of winning states can be computed in polynomial time: type-1 states in linear time, and type-2 and type-3 states in quadratic time. The algorithms to compute the three sets of winning states also enable the construction of the winning and spoiling strategies."}],"publisher":"Elsevier","type":"journal_article","page":"188 - 217","title":"Concurrent reachability games","year":"2007","volume":386,"status":"public","citation":{"ieee":"L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability games,” <i>Theoretical Computer Science</i>, vol. 386, no. 3. Elsevier, pp. 188–217, 2007.","mla":"De Alfaro, Luca, et al. “Concurrent Reachability Games.” <i>Theoretical Computer Science</i>, vol. 386, no. 3, Elsevier, 2007, pp. 188–217, doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">10.1016/j.tcs.2007.07.008</a>.","ista":"De Alfaro L, Henzinger TA, Kupferman O. 2007. Concurrent reachability games. Theoretical Computer Science. 386(3), 188–217.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Orna Kupferman. “Concurrent Reachability Games.” <i>Theoretical Computer Science</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">https://doi.org/10.1016/j.tcs.2007.07.008</a>.","ama":"De Alfaro L, Henzinger TA, Kupferman O. Concurrent reachability games. <i>Theoretical Computer Science</i>. 2007;386(3):188-217. doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">10.1016/j.tcs.2007.07.008</a>","apa":"De Alfaro, L., Henzinger, T. A., &#38; Kupferman, O. (2007). Concurrent reachability games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">https://doi.org/10.1016/j.tcs.2007.07.008</a>","short":"L. De Alfaro, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 386 (2007) 188–217."},"day":"01"}