{"author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","last_name":"Toman","full_name":"Toman, Viktor"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"title":"Strategy representation by decision trees in reactive synthesis","abstract":[{"text":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs.","lang":"eng"}],"isi":1,"citation":{"ama":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:<a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">10.1007/978-3-319-89960-2_21</a>","apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., &#38; Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">https://doi.org/10.1007/978-3-319-89960-2_21</a>","ieee":"T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.","ista":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">https://doi.org/10.1007/978-3-319-89960-2_21</a>.","mla":"Brázdil, Tomáš, et al. <i>Strategy Representation by Decision Trees in Reactive Synthesis</i>. Vol. 10805, Springer, 2018, pp. 385–407, doi:<a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">10.1007/978-3-319-89960-2_21</a>.","short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407."},"ddc":["000"],"file":[{"file_id":"5723","relation":"main_file","checksum":"b13874ffb114932ad9cc2586b7469db4","creator":"dernst","file_name":"2018_LNCS_Brazdil.pdf","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-17T16:29:08Z","date_updated":"2020-07-14T12:45:57Z","file_size":1829940}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"conference":{"end_date":"2018-04-20","name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2018-04-14","location":"Thessaloniki, Greece"},"has_accepted_license":"1","volume":10805,"external_id":{"isi":["000546326300021"]},"oa":1,"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","month":"04","intvolume":"     10805","date_published":"2018-04-12T00:00:00Z","date_created":"2018-12-11T11:45:41Z","publist_id":"7584","article_processing_charge":"No","doi":"10.1007/978-3-319-89960-2_21","publisher":"Springer","ec_funded":1,"_id":"297","page":"385 - 407","file_date_updated":"2020-07-14T12:45:57Z","alternative_title":["LNCS"],"year":"2018","type":"conference","day":"12","oa_version":"Published Version","date_updated":"2023-09-19T09:57:08Z","quality_controlled":"1","scopus_import":"1"}