{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:26:07Z","timestamp":1762298767658,"version":"3.41.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899596"},{"type":"electronic","value":"9783319899602"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89960-2_21","type":"book-chapter","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T14:14:43Z","timestamp":1523456083000},"page":"385-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Strategy Representation by Decision Trees in\u00a0Reactive\u00a0Synthesis"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8122-2881","authenticated-orcid":false,"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9036-063X","authenticated-orcid":false,"given":"Viktor","family":"Toman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0035748","volume-title":"Automata, Languages and Programming","author":"M Abadi","year":"1989","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 1\u201317. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035748"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C-27(6), 509\u2013516 (1978)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. J. ACM 49, 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-319-21690-4_31","volume-title":"Computer Aided Verification","author":"T Babiak","year":"2015","unstructured":"Babiak, T., Blahoudek, F., Duret-Lutz, A., Klein, J., K\u0159et\u00ednsk\u00fd, J., M\u00fcller, D., Parker, D., Strej\u010dek, J.: The Hanoi omega-automata format. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015, Part I. LNCS, vol. 9206, pp. 479\u2013486. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_31"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., Veanes, M.: Play to test. In: FATES 2005 (2005)","DOI":"10.1007\/11759744_3"},{"key":"21_CR6","unstructured":"Bollig, B., Lbbing, M., Wegener, I.: Simulated annealing to improve variable orderings for OBDDs. Presented at the International Workshop on Logic Synthesis, Granlibakken, CA (1995)"},{"key":"21_CR7","unstructured":"Boutilier, C., Dearden, R.: Approximate value trees in structured dynamic programming. In: Saitta, L. (ed.) ICML, pp. 54\u201362. Morgan Kaufmann (1996)"},{"key":"21_CR8","unstructured":"Boutilier, C., Dearden, R., Goldszmidt, M.: Exploiting structure in policy construction. In: IJCAI, pp. 1104\u20131113. Morgan Kaufmann (1995)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-21690-4_10","volume-title":"Computer Aided Verification","author":"T Br\u00e1zdil","year":"2015","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmel\u00edk, M., Fellner, A., K\u0159et\u00ednsk\u00fd, J.: Counterexample explanation by learning small strategies in Markov decision processes. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015, Part I. LNCS, vol. 9206, pp. 158\u2013177. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_10"},{"key":"21_CR10","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmel\u00edk, M., Gupta, A., Novotn\u00fd, P.: Stochastic shortest path with energy constraints in POMDPs: (extended abstract). In: AAMAS, pp. 1465\u20131466 (2016)"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Toman, V.: Artifact and instructions to generate experimental results for TACAS 2018 paper Strategy Representation by Decision Trees in Reactive Synthesis. Figshare (2018). https:\/\/doi.org\/10.6084\/m9.figshare.5923915.v1","DOI":"10.6084\/m9.figshare.5923915.v1"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Toman, V.: Strategy representation by decision trees in reactive synthesis. arXiv.org:1802.00758 (2018)","DOI":"10.1007\/978-3-319-89960-2_21"},{"issue":"8","key":"21_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR14","unstructured":"B\u00fcchi, J.: On a decision method in restricted second-order arithmetic. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proceedings of the First International Congress on Logic, Methodology, and Philosophy of Science 1960, pp. 1\u201311. Stanford University Press (1962)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295\u2013311 (1969)","journal-title":"Trans. AMS"},{"key":"21_CR16","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 252\u2013263. ACM (2017). https:\/\/dblp.org\/rec\/bib\/conf\/stoc\/2017"},{"key":"21_CR17","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335. Institut Mittag-Leffler (1962)"},{"key":"21_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","year":"2017","unstructured":"Clarke, E., Henzinger, T., Veith, H. (eds.): Handbook of Model Checking. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-10575-8 . Chapter: Games and Synthesis"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.: Interface automata. In: FSE 2001, pp. 109\u2013120. ACM (2001)","DOI":"10.1145\/503271.503226"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T., Mang, F.: Detecting errors before reaching them. In: CAV 2000, pp. 186\u2013201 (2000)","DOI":"10.1007\/10722167_17"},{"key":"21_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6874.001.0001","volume-title":"Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits","author":"D Dill","year":"1989","unstructured":"Dill, D.: Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. The MIT Press, Cambridge (1989)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Drechsler, R., Becker, B., Gockel, N.: Genetic algorithm for variable ordering of OBDDs. Presented at the International Workshop on Logic Synthesis, Granlibakken, CA (1995)","DOI":"10.1049\/ip-cdt:19960789"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-46520-3_8","volume-title":"Automated Technology for Verification and Analysis","author":"Alexandre Duret-Lutz","year":"2016","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, E., Xu, L.: Spot 2.0 - a framework for LTL and $$\\omega $$ \u03c9 -automata manipulation. In: ATVA, pp. 122\u2013129 (2016)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-39592-8_63","volume-title":"Foundations of Intelligent Systems","author":"T Elomaa","year":"2003","unstructured":"Elomaa, T., Malinen, T.: On lookahead heuristics in decision tree learning. In: Zhong, N., Ra\u015b, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 445\u2013453. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39592-8_63"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"21_CR26","unstructured":"Fujita, M., Matsunaga, Y., Kakuda, T.: On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. In: EURO-DAC, pp. 50\u201354 (1991)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: POPL (2016)","DOI":"10.1145\/2837614.2837664"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC 1982, pp. 60\u201365. ACM Press (1982)","DOI":"10.1145\/800070.802177"},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"MA Hall","year":"2009","unstructured":"Hall, M.A., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explor. 11(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor."},{"key":"21_CR30","first-page":"64","volume":"173","author":"T Henzinger","year":"2002","unstructured":"Henzinger, T., Kupferman, O., Rajamani, S.: Fair simulation. I&C 173, 64\u201381 (2002)","journal-title":"I&C"},{"key":"21_CR31","unstructured":"Jacobs, S.: Extended AIGER format for synthesis. CoRR, abs\/1405.5793 (2014)"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4204\/EPTCS.202.4","volume":"202","author":"Swen Jacobs","year":"2016","unstructured":"Jacobs, S., Bloem, R., Brenguier, R., K\u00f6nighofer, R., P\u00e9rez, G.A., Raskin, J., Ryzhyk, L., Sankur, O., Seidl, M., Tentrup, L., Walker, A.: The second reactive synthesis competition (SYNTCOMP 2015). In: SYNT, pp. 27\u201357 (2015)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"21_CR33","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-319-11936-6_17","volume-title":"Automated Technology for Verification and Analysis","author":"Zuzana Kom\u00e1rkov\u00e1","year":"2014","unstructured":"Kom\u00e1rkov\u00e1, Z., K\u0159et\u00ednsk\u00fd, J.: Rabinizer 3: safraless translation of LTL to small deterministic automata. In: ATVA, pp. 235\u2013241 (2014)"},{"key":"21_CR34","unstructured":"Krishna, S., Puhrsch, C., Wies, T.: Learning invariants using decision trees. CoRR, abs\/1501.04725 (2015)"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Liu, S., Panangadan, A., Raghavendra, C.S., Talukder, A.: Compact representation of coordinated sampling policies for body sensor networks. In: Proceedings of Workshop on Advances in Communication and Networks (Smart Homes for Tele-Health), pp. 6\u201310. IEEE (2010)","DOI":"10.1109\/GLOCOMW.2010.5700304"},{"key":"21_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4612-0931-7"},{"key":"21_CR37","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Log. 65, 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"21_CR38","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning, 1st edn. McGraw-Hill Inc., New York (1997)","edition":"1"},{"key":"21_CR39","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-24372-1_22","volume-title":"Automated Technology for Verification and Analysis","author":"Daniel Neider","year":"2011","unstructured":"Neider, D.: Small strategies for safety games. In: ATVA, pp. 306\u2013320 (2011)"},{"key":"21_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-662-49674-9_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Neider","year":"2016","unstructured":"Neider, D., Saha, S., Madhusudan, P.: Synthesizing piece-wise functions by learning classifiers. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 186\u2013203. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_11"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-662-49674-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Neider","year":"2016","unstructured":"Neider, D., Topcu, U.: An automaton learning approach to solving safety games over infinite graphs. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 204\u2013221. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_12"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"21_CR43","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"21_CR44","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"21_CR45","unstructured":"Rabin, M.: Automata on Infinite Objects and Church\u2019s Problem. Number 13 in Conference Series in Mathematics. American Mathematical Society, Providence (1969)"},{"issue":"1","key":"21_CR46","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P Ramadge","year":"1987","unstructured":"Ramadge, P., Wonham, W.: Supervisory control of a class of discrete-event processes. SIAM J. Contr. Opt. 25(1), 206\u2013230 (1987)","journal-title":"SIAM J. Contr. Opt."},{"key":"21_CR47","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: ICCAD, pp. 42\u201347. IEEE Computer Society Press (1993)"},{"key":"21_CR48","first-page":"243","volume":"84","author":"S Schewe","year":"2017","unstructured":"Schewe, S.: Solving parity games in big steps. JCSS 84, 243\u2013262 (2017)","journal-title":"JCSS"},{"key":"21_CR49","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0.0 (2015)"},{"key":"21_CR50","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"key":"21_CR51","doi-asserted-by":"crossref","unstructured":"Wimmer, R., Braitling, B., Becker, B., Hahn, E.M., Crouzen, P., Hermanns, H., Dhama, A., Theel, O.: Symblicit calculation of long-run averages for concurrent probabilistic systems. In: QEST, pp. 27\u201336. IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/QEST.2010.12"},{"issue":"1\u20132","key":"21_CR52","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1\u20132), 135\u2013183 (1998)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89960-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T15:51:34Z","timestamp":1751557894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89960-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899596","9783319899602"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89960-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/index.php\/2018\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}