{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:27:41Z","timestamp":1746001661473,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030908690"},{"type":"electronic","value":"9783030908706"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90870-6_9","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"163-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Omega-Regular Energy Games"],"prefix":"10.1007","author":[{"given":"Gal","family":"Amram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Maoz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Or","family":"Pistiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Oliver","family":"Ringert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"key":"9_CR1","unstructured":"Spectra Website. http:\/\/smlab.cs.tau.ac.il\/syntech\/spectra\/"},{"key":"9_CR2","unstructured":"Supporting Materials Website. http:\/\/smlab.cs.tau.ac.il\/syntech\/energyefficient\/"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L de Alfaro","year":"2009","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Softw. Eng. 35(2), 258\u2013273 (2009). https:\/\/doi.org\/10.1109\/TSE.2008.106","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: From verification to control: dynamic programs for omega-regular objectives. In: 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, USA, 16\u201319 June 2001, Proceedings, pp. 279\u2013290. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/LICS.2001.932504","DOI":"10.1109\/LICS.2001.932504"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Kwiatkowska, M.Z., Norman, G., Parker, D., Segala, R.: Symbolic model checking of probabilistic processes using mtbdds and the kronecker representation. In: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, 25 March\u20132 April 2000, Proceedings, pp. 395\u2013410 (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_27","DOI":"10.1007\/3-540-46419-0_27"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. J. Comput. Syst. Sci. 68(2), 374\u2013397 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.009","DOI":"10.1016\/j.jcss.2003.07.009"},{"key":"9_CR7","unstructured":"Amram, G., Maoz, S., Pistiner, O., Ringert, J.O.: Energy mu-calculus: symbolic fixed-point algorithms for omega-regular energy games. CoRR abs\/2005.00641 (2020). https:\/\/arxiv.org\/abs\/2005.00641"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bahar, R.I., et al.: Algebraic decision diagrams and their applications. Formal Methods Syst. Des. 10(2\/3), 171\u2013206 (1997). https:\/\/doi.org\/10.1023\/A:1008699807402","DOI":"10.1023\/A:1008699807402"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M.Z., Ryan, M.: Symbolic model checking for probabilistic processes. In: Automata, Languages and Programming, 24th International Colloquium, ICALP 1997, Bologna, Italy, 7\u201311 July 1997, Proceedings, pp. 430\u2013440 (1997). https:\/\/doi.org\/10.1007\/3-540-63165-8_199","DOI":"10.1007\/3-540-63165-8_199"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of Reactive(1) Designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.08.007","DOI":"10.1016\/j.jcss.2011.08.007"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85778-5_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33\u201347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85778-5_4"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bradfield, J., Stirling, C.: 12 modal mu-calculi. In: Patrick Blackburn, J.V.B., Wolter, F. (eds.) Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3, pp. 721\u2013756. Elsevier (2007). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570246407800152","DOI":"10.1016\/S1570-2464(07)80015-2"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97\u2013118 (2011). https:\/\/doi.org\/10.1007\/s10703-010-0105-x","journal-title":"Formal Methods Syst. Des."},{"issue":"1\u20132","key":"9_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(96)00228-9","volume":"178","author":"A Browne","year":"1997","unstructured":"Browne, A., Clarke, E.M., Jha, S., Long, D.E., Marrero, W.R.: An improved algorithm for the evaluation of fixpoint expressions. Theor. Comput. Sci. 178(1\u20132), 237\u2013255 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00228-9","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-27836-8_26","volume-title":"Automata, Languages and Programming","author":"G Bruns","year":"2004","unstructured":"Bruns, G., Godefroid, P.: Model checking with multi-valued logics. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 281\u2013293. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_26"},{"issue":"8","key":"9_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293\u2013318 (1992). https:\/\/doi.org\/10.1145\/136035.136043","journal-title":"ACM Comput. Surv."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Bustan, D., Kupferman, O., Vardi, M.Y.: A measured collapse of the modal $$\\rm \\mu $$-calculus alternation hierarchy. In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 25\u201327 March 2004, Proceedings, pp. 522\u2013533 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_46","DOI":"10.1007\/978-3-540-24749-4_46"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-45212-6_9","volume-title":"Embedded Software","author":"A Chakrabarti","year":"2003","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 117\u2013133. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45212-6_9"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theor. Comput. Sci. 458, 49\u201360 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.038","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"9_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00236-013-0182-6","volume":"51","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Randour, M., Raskin, J.: Strategy synthesis for multi-dimensional quantitative objectives. Acta Inf. 51(3\u20134), 129\u2013163 (2014). https:\/\/doi.org\/10.1007\/s00236-013-0182-6","journal-title":"Acta Inf."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-41540-6_18","volume-title":"Computer Aided Verification","author":"R Ehlers","year":"2016","unstructured":"Ehlers, R., Raman, V.: Slugs: extensible GR(1) synthesis. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 333\u2013339. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_18"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1\u20134 October 1991, pp. 368\u2013377. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/SFCS.1991.185392","DOI":"10.1109\/SFCS.1991.185392"},{"key":"9_CR24","unstructured":"Emerson, E.A., Lei, C.: Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In: Proceedings of the Symposium on Logic in Computer Science (LICS 1986), Cambridge, Massachusetts, USA, 16\u201318 June 1986, pp. 267\u2013278. IEEE Computer Society (1986). http:\/\/dblp2.uni-trier.de\/rec\/bib\/conf\/lics\/EmersonL86"},{"issue":"1\u20132","key":"9_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00236-019-00351-9","volume":"57","author":"E Firman","year":"2020","unstructured":"Firman, E., Maoz, S., Ringert, J.O.: Performance heuristics for GR(1) synthesis and related algorithms. Acta Informatica 57(1\u20132), 37\u201379 (2020). https:\/\/doi.org\/10.1007\/s00236-019-00351-9","journal-title":"Acta Informatica"},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s00224-009-9201-y","volume":"47","author":"D Fischer","year":"2010","unstructured":"Fischer, D., Gr\u00e4del, E., Kaiser, \u0141: Model checking games for the quantitative $$\\mu $$-calculus. Theory Comput. Syst. 47(3), 696\u2013719 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9201-y","journal-title":"Theory Comput. Syst."},{"issue":"2\/3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Methods Syst. Des. 10(2\/3), 149\u2013169 (1997). https:\/\/doi.org\/10.1023\/A:1008647823331","journal-title":"Formal Methods Syst. Des."},{"issue":"12","key":"9_CR28","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robotics Auton. Syst. 61(12), 1258\u20131276 (2013). https:\/\/doi.org\/10.1016\/j.robot.2013.09.004","journal-title":"Robotics Auton. Syst."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-30579-8_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O Grumberg","year":"2005","unstructured":"Grumberg, O., Lange, M., Leucker, M., Shoham, S.: Don\u2019t know in the $${\\mu }$$-calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 233\u2013249. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_16"},{"issue":"8","key":"9_CR31","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1016\/j.ic.2006.10.009","volume":"205","author":"O Grumberg","year":"2007","unstructured":"Grumberg, O., Lange, M., Leucker, M., Shoham, S.: When not losing is better than winning: abstraction and refinement for the full $$\\mu $$-calculus. Inf. Comput. 205(8), 1130\u20131148 (2007). https:\/\/doi.org\/10.1016\/j.ic.2006.10.009","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"9_CR32","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). https:\/\/doi.org\/10.1016\/S1567-8326(02)00066-8","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_24"},{"issue":"5\u20136","key":"9_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10009-011-0221-y","volume":"15","author":"R K\u00f6nighofer","year":"2013","unstructured":"K\u00f6nighofer, R., Hofferek, G., Bloem, R.: Debugging formal specifications: a practical approach using model-based diagnosis and counterstrategies. STTT 15(5\u20136), 563\u2013583 (2013). https:\/\/doi.org\/10.1007\/s10009-011-0221-y","journal-title":"STTT"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. In: Proceedings of the 9th Colloquium on Automata, Languages and Programming, pp. 348\u2013359. Springer, London (1982). http:\/\/dl.acm.org\/citation.cfm?id=646236.682866","DOI":"10.1007\/BFb0012782"},{"issue":"2","key":"9_CR36","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10009-004-0140-2","volume":"6","author":"MZ Kwiatkowska","year":"2004","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: a hybrid approach. STTT 6(2), 128\u2013142 (2004). https:\/\/doi.org\/10.1007\/s10009-004-0140-2","journal-title":"STTT"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Maoz, S., Pistiner, O., Ringert, J.O.: Symbolic BDD and ADD algorithms for energy games. In: Piskac, R., Dimitrova, R. (eds.) Proceedings Fifth Workshop on Synthesis, SYNT@CAV 2016, Toronto, Canada, 17\u201318 July 2016. EPTCS, vol. 229, pp. 35\u201354 (2016). https:\/\/doi.org\/10.4204\/EPTCS.229.5","DOI":"10.4204\/EPTCS.229.5"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Maoz, S., Ringert, J.O.: Spectra: a specification language for reactive systems. Softw. Syst. Model. (2021). http:\/\/link.springer.com\/article\/10.1007\/s10270-021-00868-z","DOI":"10.1007\/s10270-021-00868-z"},{"key":"9_CR40","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":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, Languages and Programming","author":"D Niwi\u0144ski","year":"1986","unstructured":"Niwi\u0144ski, D.: On fixed-point clones. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 464\u2013473. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16761-7_96"},{"key":"9_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11609773_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"N Piterman","year":"2005","unstructured":"Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 364\u2013380. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11609773_24"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 46\u201357. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Raskin, J., Chatterjee, K., Doyen, L., Henzinger, T.A.: Algorithms for omega-regular games with imperfect information. Logical Methods Comput. Sci. 3(3) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(3:4)2007","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"9_CR45","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package Release 3.0.0 (2015). http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cudd.pdf"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:08:48Z","timestamp":1636502928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","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":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","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":"131","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":"40","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":"31% - 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":"9","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)"}},{"value":"Additionally, this includes 4 invited full papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}