{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:39:50Z","timestamp":1755999590897},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302801"},{"type":"electronic","value":"9783030302818"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30281-8_7","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T23:03:14Z","timestamp":1567551794000},"page":"109-128","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Strategy Representation by Decision Trees with Linear Classifiers"],"prefix":"10.1007","author":[{"given":"Pranav","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph H.","family":"Lampert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Toman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: ICALP, pp. 1\u201317 (1989)","DOI":"10.1007\/BFb0035748"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C\u201327","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C\u201327(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. In: Dependable Software Systems Engineering, pp. 1\u201325 (2015)","DOI":"10.1109\/MEMCOD.2015.7340460"},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ashok, P., Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Lampert, C.H., Toman, V.: Strategy representation by decision trees with linear classifiers. arXiv.org.1906.08178 (2019)","DOI":"10.1007\/978-3-030-30281-8_7"},{"key":"7_CR6","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, New York (2008)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., Veanes, M.: Play to test. In: FATES, pp. 32\u201346 (2005)","DOI":"10.1007\/11759744_3"},{"key":"7_CR8","unstructured":"Boutilier, C., Dearden, R.: Approximate value trees in structured dynamic programming. In: ICML, pp. 54\u201362 (1996)"},{"key":"7_CR9","unstructured":"Boutilier, C., Dearden, R., Goldszmidt, M.: Exploiting structure in policy construction. In: IJCAI, pp. 1104\u20131113 (1995)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-21690-4_10","volume-title":"Computer Aided Verification","author":"Tom\u00e1\u0161 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: CAV, pp. 158\u2013177 (2015)"},{"key":"7_CR11","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":"7_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. In: TACAS, pp. 385\u2013407 (2018)","DOI":"10.1007\/978-3-319-89960-2_21"},{"key":"7_CR13","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Chapman and Hall\/CRC, Boca Raton (1984)"},{"issue":"8","key":"7_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"R Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR15","unstructured":"B\u00fcchi, J.: On a decision method in restricted second-order arithmetic. In: International Congress on Logic, Methodology, and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"7_CR16","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"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2699430","volume":"62","author":"K Chatterjee","year":"2015","unstructured":"Chatterjee, K., Henzinger, T.A., Jobstmann, B., Singh, R.: Measuring and synthesizing systems in probabilistic environments. J. ACM 62(1), 9:1\u20139:34 (2015)","journal-title":"J. ACM"},{"key":"7_CR18","unstructured":"Church, A.: Logic, arithmetic, and automata. In: International Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.: Interface automata. In: FSE, pp. 109\u2013120 (2001)","DOI":"10.1145\/503271.503226"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T., Mang, F.: Detecting errors before reaching them. In: CAV, pp. 186\u2013201 (2000)","DOI":"10.1007\/10722167_17"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Dehnert, C., Junges, S., Katoen, J., Volk, M.: A storm is coming: a modern probabilistic model checker. In: CAV, pp. 592\u2013600 (2017)","DOI":"10.1007\/978-3-319-63390-9_31"},{"key":"7_CR22","doi-asserted-by":"publisher","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. MIT Press, Cambridge (1989)"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0022-0000(76)80051-7","volume":"13","author":"DP Dobkin","year":"1976","unstructured":"Dobkin, D.P.: A nonlinear lower bound on linear search tree programs for solving knapsack problems. J. Comput. Syst. Sci. 13(1), 69\u201373 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, E., Xu, L.: Spot 2.0 - a framework for LTL and $$\\omega $$ -automata manipulation. In: ATVA, pp. 122\u2013129 (2016)","DOI":"10.1007\/978-3-319-46520-3_8"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1007421302149","volume":"32","author":"E Frank","year":"1998","unstructured":"Frank, E., Wang, Y., Inglis, S., Holmes, G., Witten, I.H.: Using model trees for classification. Mach. Learn. 32(1), 63\u201376 (1998)","journal-title":"Mach. Learn."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: POPL, pp. 499\u2013512 (2016)","DOI":"10.1145\/2914770.2837664"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC, pp. 60\u201365 (1982)","DOI":"10.1145\/800070.802177"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1006\/inco.2001.3085","volume":"173","author":"T Henzinger","year":"2002","unstructured":"Henzinger, T., Kupferman, O., Rajamani, S.: Fair simulation. Inf. Comput. 173, 64\u201381 (2002)","journal-title":"Inf. Comput."},{"key":"7_CR29","unstructured":"Jacobs, S.: Extended AIGER format for synthesis. CoRR, abs\/1405.5793 (2014)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"S. Jacobs, et al.: The second reactive synthesis competition (SYNTCOMP 2015). In: SYNT, pp. 27\u201357 (2015)","DOI":"10.4204\/EPTCS.202.4"},{"key":"7_CR31","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-319-11936-6_17"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Kontschieder, P., Fiterau, M., Criminisi, A., Bul\u00f2, S.R.: Deep neural decision forests. In: IJCAI, pp. 4190\u20134194 (2016)","DOI":"10.1109\/ICCV.2015.172"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: TOOLS, pp. 200\u2013204 (2002)","DOI":"10.1007\/3-540-46029-2_13"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: QEST, pp. 203\u2013204 (2012)","DOI":"10.1109\/QEST.2012.14"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-39857-8_23","volume-title":"Machine Learning: ECML 2003","author":"Niels Landwehr","year":"2003","unstructured":"Landwehr, N., Hall, M., Frank, E.: Logistic model trees. In: ECML, pp. 241\u2013252 (2003)"},{"key":"7_CR36","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: Advances in Communication and Networks, pp. 6\u201310 (2010)","DOI":"10.1109\/GLOCOMW.2010.5700304"},{"key":"7_CR37","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. Kluwer Academic, Norwell (1992)"},{"key":"7_CR38","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. Logic 65, 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR39","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw Hill, Maidenhead (1997)"},{"key":"7_CR40","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":"7_CR41","doi-asserted-by":"crossref","unstructured":"Neider, D., Saha, S., Madhusudan, P.: Synthesizing piece-wise functions by learning classifiers. In: TACAS, pp. 186\u2013203 (2016)","DOI":"10.1007\/978-3-662-49674-9_11"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Neider, D., Topcu, U.: An automaton learning approach to solving safety games over infinite graphs. In: TACAS, pp. 204\u2013221 (2016)","DOI":"10.1007\/978-3-662-49674-9_12"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"7_CR45","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":"7_CR46","unstructured":"Quinlan, J.R.: Learning with continuous classes. In: Australian Joint Conference on Artificial Intelligence, pp. 343\u2013348 (1992)"},{"key":"7_CR47","unstructured":"Rabin, M.: Automata on infinite objects and Church\u2019s problem. In: Conference Series in Mathematics (1969)"},{"issue":"1","key":"7_CR48","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. Control Optim. 25(1), 206\u2013230 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"Wolfgang Thomas","year":"1997","unstructured":"Thomas, Wolfgang: Languages, automata, and logic. In: Rozenberg, Grzegorz, Salomaa, Arto (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"R. Wimmer, et al.: Symblicit calculation of long-run averages for concurrent probabilistic systems. In: QEST, pp. 27\u201336 (2010)","DOI":"10.1109\/QEST.2010.12"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30281-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T12:54:51Z","timestamp":1575636891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30281-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302801","9783030302818"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30281-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.qest.org\/qest2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}