{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:34:13Z","timestamp":1768908853573,"version":"3.49.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030302801","type":"print"},{"value":"9783030302818","type":"electronic"}],"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_9","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T23:03:54Z","timestamp":1567551834000},"page":"147-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Pranav","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Le Co\u00ebnt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob Haahr","family":"Taankvist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Weininger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ashok, P. K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Co\u00ebnt, A.L., Taankvist, J.H., Weininger, M.: SOS: Safe, optimal and small strategies for hybrid Markov decision processes. Technical report (2019)","DOI":"10.1007\/978-3-030-30281-8_9"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-73368-3_14","volume-title":"Computer Aided Verification","author":"G Behrmann","year":"2007","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: UPPAAL-Tiga: time for playing games!. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 121\u2013125. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_14"},{"key":"9_CR3","first-page":"261","volume":"36","author":"J Bernet","year":"2002","unstructured":"Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. ITA 36, 261\u2013275 (2002)","journal-title":"ITA"},{"issue":"9","key":"9_CR4","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.575","volume":"11","author":"C Boutilier","year":"1999","unstructured":"Boutilier, C., Dean, T.L., Hanks, S.: Decision-theoretic planning: structural assumptions and computational leverage. J. Artif. Intell. Res. 11, 1\u201394 (1999)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR6","unstructured":"Boutilier, C., Dearden, R.: Approximating value trees in structured dynamic programming. In: ICML (1996)"},{"key":"9_CR7","unstructured":"Boutilier, C., Dearden, R., Goldszmidt, M.: Exploiting structure in policy construction. In: IJCAI (1995)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-24372-1_11","volume-title":"Automated Technology for Verification and Analysis","author":"P Bouyer","year":"2011","unstructured":"Bouyer, P., Markey, N., Olschewski, J., Ummels, M.: Measuring permissiveness in parity games: mean-payoff parity games revisited. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 135\u2013149. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_11"},{"key":"9_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. LNCS, vol. 9206, pp. 158\u2013177. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_10"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-89960-2_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Br\u00e1zdil","year":"2018","unstructured":"Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Toman, V.: Strategy representation by decision trees in\u00a0reactive\u00a0synthesis. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 385\u2013407. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_21"},{"key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"2017","unstructured":"Breiman, L.: Classification and Regression Trees. Routledge, Abingdon (2017)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: DAC (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"key":"9_CR13","unstructured":"Chapman, D., Kaelbling, L.P.: Input generalization in delayed reinforcement learning: an algorithm and performance comparisons. In: IJCAI. Morgan Kaufmann (1991)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-44794-6_4","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A Clare","year":"2001","unstructured":"Clare, A., King, R.D.: Knowledge discovery in multi-label phenotype data. In: De Raedt, L., Siebes, A. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 42\u201353. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44794-6_4"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10703-017-0305-8","volume":"53","author":"AL Co\u00ebnt","year":"2018","unstructured":"Co\u00ebnt, A.L., Sandretto, J.A.D., Chapoutot, A., Fribourg, L.: An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods Syst. Design 53(3), 363\u2013383 (2018)","journal-title":"Formal Methods Syst. Design"},{"issue":"12","key":"9_CR16","doi-asserted-by":"publisher","first-page":"2694","DOI":"10.1007\/s11432-012-4742-0","volume":"55","author":"A David","year":"2012","unstructured":"David, A., Du, D., Larsen, K.G., Mikucionis, M., Skou, A.: An evaluation framework for energy aware buildings using statistical model checking. Sci. China Inform. Sci. 55(12), 2694\u20132707 (2012)","journal-title":"Sci. China Inform. Sci."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-11936-6_10","volume-title":"Automated Technology for Verification and Analysis","author":"A David","year":"2014","unstructured":"David, A., et al.: On time with minimal expected cost!. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 129\u2013145. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11936-6_10"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-662-46681-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2015","unstructured":"David, A., Jensen, P.G., Larsen, K.G., Miku\u010dionis, M., Taankvist, J.H.: Uppaal stratego. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 206\u2013211. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_16"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-46419-0_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Alfaro de","year":"2000","unstructured":"de Alfaro, L., Kwiatkowska, M., Norman, G., Parker, D., Segala, R.: Symbolic model checking of probabilistic processes using MTBDDs and the kronecker representation. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 395\u2013410. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_27"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-54862-8_44","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Dr\u00e4ger","year":"2014","unstructured":"Dr\u00e4ger, K., Forejt, V., Kwiatkowska, M., Parker, D., Ujma, M.: Permissive controller synthesis for probabilistic systems. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 531\u2013546. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_44"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-56602-3_135","volume-title":"Machine Learning: ECML-93","author":"F Esposito","year":"1993","unstructured":"Esposito, F., Malerba, D., Semeraro, G.: Decision tree pruning as a search in the state space. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 165\u2013184. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56602-3_135"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-24743-2_22","volume-title":"Hybrid Systems: Computation and Control","author":"A Fehnker","year":"2004","unstructured":"Fehnker, A., Ivan\u010di\u0107, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326\u2013341. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24743-2_22"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-08867-9_5","volume-title":"Computer Aided Verification","author":"P Garg","year":"2014","unstructured":"Garg, P., L\u00f6ding, C., Madhusudan, P., Neider, D.: ICE:\u00a0a\u00a0robust\u00a0framework\u00a0for\u00a0learning\u00a0invariants. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 69\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_5"},{"issue":"5","key":"9_CR24","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.automatica.2012.02.037","volume":"48","author":"A Girard","year":"2012","unstructured":"Girard, A.: Controller synthesis for safety and reachability via approximate bisimulation. Automatica 48(5), 947\u2013953 (2012)","journal-title":"Automatica"},{"key":"9_CR25","first-page":"34","volume":"10","author":"A Girard","year":"2013","unstructured":"Girard, A.: Low-complexity quantized switching controllers using approximate bisimulation. Nonlinear Anal.: Hybrid Syst. 10, 34\u201344 (2013)","journal-title":"Nonlinear Anal.: Hybrid Syst."},{"issue":"4","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1109\/TAC.2011.2168874","volume":"57","author":"A Girard","year":"2012","unstructured":"Girard, A., Martin, S.: Synthesis for constrained nonlinear systems using hybridization and robust controllers on simplices. IEEE Trans. Automat. Control 57(4), 1046\u20131051 (2012)","journal-title":"IEEE Trans. Automat. Control"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Hahn, E.M., Norman, G., Parker, D., Wachter, B., Zhang, L.: Game-based abstraction and controller synthesis for probabilistic hybrid systems. In: QEST (2011)","DOI":"10.1109\/QEST.2011.17"},{"issue":"1\u20132","key":"9_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S1567-8326(02)00066-8","volume":"56","author":"H Hermanns","year":"2003","unstructured":"Hermanns, H., Kwiatkowska, M.Z., Norman, G., Parker, D., Siegle, M.: On the use of mtbdds for performability analysis and verification of stochastic systems. J. Log. Algebr. Program. 56(1\u20132), 23\u201367 (2003)","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR29","unstructured":"Hiskens, I.A.: Stability of limit cycles in hybrid systems. In: HICSS (2001)"},{"key":"9_CR30","unstructured":"Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: stochastic planning using decision diagrams. In: UAI (1999)"},{"key":"9_CR31","unstructured":"Kearns, M., Koller, D.: Efficient reinforcement learning in factored MDPs. In: IJCAI (1999)"},{"key":"9_CR32","unstructured":"Koller, D., Parr, R.: Computing factored value functions for policies in structured MDPs. In: IJCAI (1999)"},{"key":"9_CR33","unstructured":"Kushmerick, N., Hanks, S., Weld, D.: An algorithm for probabilistic least-commitment planning. In: AAAI (1994)"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-23703-5_6","volume-title":"Cyber Physical Systems. Model-Based Design","author":"KG Larsen","year":"2019","unstructured":"Larsen, K.G., Le Co\u00ebnt, A., Miku\u010dionis, M., Taankvist, J.H.: Guaranteed control synthesis for continuous systems in Uppaal Tiga. In: Chamberlain, R., Taha, W., T\u00f6rngren, M. (eds.) CyPhy\/WESE -2018. LNCS, vol. 11615, pp. 113\u2013133. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23703-5_6"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-23506-6_17","volume-title":"Correct System Design","author":"KG Larsen","year":"2015","unstructured":"Larsen, K.G., Miku\u010dionis, M., Taankvist, J.H.: Safe and optimal adaptive cruise control. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 260\u2013277. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_17"},{"key":"9_CR36","unstructured":"Co\u00ebnt, A.L., De Vuyst, F., Chamoin, L., Fribourg, L.: Control synthesis of nonlinear sampled switched systems using Euler\u2019s method. In: SNR (2017)"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Liu, S., Panangadan, A., Talukder, A., Raghavendra, C.S.: Compact representation of coordinated sampling policies for body sensor networks. In: 2010 IEEE Globecom Workshops (2010)","DOI":"10.1109\/GLOCOMW.2010.5700304"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Render, E., Tabuada, P.: Robust discrete synthesis against unspecified disturbances. In: HSCC (2011)","DOI":"10.1145\/1967701.1967732"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24611-4_9","volume-title":"Validation of Stochastic Systems","author":"A Miner","year":"2004","unstructured":"Miner, A., Parker, D.: Symbolic representations and analysis of large probabilistic systems. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 296\u2013338. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24611-4_9"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1022604100933","volume":"4","author":"J Mingers","year":"1989","unstructured":"Mingers, J.: An empirical comparison of pruning methods for decision tree induction. Mach. Learn. 4, 227\u2013243 (1989)","journal-title":"Mach. Learn."},{"key":"9_CR41","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, Inc., New York (1997)"},{"key":"9_CR42","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., VanderPlas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR43","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, Hoboken (1994)"},{"key":"9_CR44","unstructured":"Pyeatt, L.D.: Reinforcement learning with decision trees. Appl. Inform. 26\u201331 (2003)"},{"key":"9_CR45","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1, 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"9_CR46","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"2014","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Elsevier, Amsterdam (2014)"},{"key":"9_CR47","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/08839519408945435","volume":"8","author":"PJ Riddle","year":"1994","unstructured":"Riddle, P.J., Segal, R., Etzioni, O.: Representation design and brut-force induction in a boeingmanufacturing domain. Appl. Artif. Intell. 8, 125\u2013147 (1994)","journal-title":"Appl. Artif. Intell."},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Roy, P., Tabuada, P., Majumdar, R.: Pessoa 2.0: a controller synthesis tool for cyber-physical systems. In: HSCC (2011)","DOI":"10.1145\/1967701.1967748"},{"key":"9_CR49","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: CAD (1993)"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Rungger, M., Zamani, M.: Scots: a tool for the synthesis of symbolic controllers. In: HSCC (2016)","DOI":"10.1145\/2883817.2883834"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Saoud, A., Girard, A., Fribourg, L.: On the composition of discrete and continuous-time assume-guarantee contracts for invariance. In: ECC (2018)","DOI":"10.23919\/ECC.2018.8550622"},{"key":"9_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-38856-9_21","volume-title":"Static Analysis","author":"R Sharma","year":"2013","unstructured":"Sharma, R., Gupta, S., Hariharan, B., Aiken, A., Nori, A.V.: Verification as learning geometric concepts. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 388\u2013411. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_21"},{"key":"9_CR53","unstructured":"Somenzi, F.: CUDD: CU decision diagram package-release 2.4. 2 (2009). http:\/\/vlsi.colorado.edu\/~fabio\/CUDD"},{"key":"9_CR54","first-page":"230","volume":"23","author":"M Svore\u0148ov\u00e1","year":"2017","unstructured":"Svore\u0148ov\u00e1, M., K\u0159et\u00ednsk\u1ef3, J., Chmel\u00edk, M., Chatterjee, K., \u010cern\u00e1, I., Belta, C.: Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Anal.: Hybrid Syst. 23, 230\u2013253 (2017)","journal-title":"Nonlinear Anal.: Hybrid Syst."},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Wimmer, R., et al.: Symblicit calculation of long-run averages for concurrent probabilistic systems. In: QEST (2010)","DOI":"10.1109\/QEST.2010.12"},{"issue":"16","key":"9_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ifacol.2018.08.001","volume":"51","author":"Ivan S. Zapreev","year":"2018","unstructured":"Zapreev, I.S., Verdier, C., Mazo, M.: Optimal symbolic controllers determinization for BDD storage. In: ADHS (2018)","journal-title":"IFAC-PapersOnLine"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T12:57:00Z","timestamp":1575637020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30281-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302801","9783030302818"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30281-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}