{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T09:10:43Z","timestamp":1774775443131,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031131875","type":"print"},{"value":"9783031131882","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":217,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Spot is a C++17 library for LTL and<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\omega $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03c9<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-automata manipulation, with command-line utilities, and Python bindings. This paper summarizes its evolution over the past six years, since the release of Spot 2.0, which was the first version to support<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\omega $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03c9<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-automata with arbitrary acceptance conditions, and the last version presented at a conference. Since then, Spot has been extended with several features such as acceptance transformations, alternating automata, games, LTL synthesis, and more. We also shed some lights on the data-structure used to store automata.<\/jats:p><jats:p><jats:bold>Artifact:<\/jats:bold><jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/zenodo.org\/record\/6521395\">https:\/\/zenodo.org\/record\/6521395<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/978-3-031-13188-2_9","type":"book-chapter","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:16:57Z","timestamp":1659687417000},"page":"174-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["From Spot 2.0 to Spot 2.10: What\u2019s New?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6623-2512","authenticated-orcid":false,"given":"Alexandre","family":"Duret-Lutz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-4413","authenticated-orcid":false,"given":"Etienne","family":"Renault","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4769-3302","authenticated-orcid":false,"given":"Maximilien","family":"Colange","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5066-1726","authenticated-orcid":false,"given":"Florian","family":"Renkin","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Gbaguidi Aisse","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6611-9659","authenticated-orcid":false,"given":"Philipp","family":"Schlehuber-Caissier","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Medioni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3263-7669","authenticated-orcid":false,"given":"Antoine","family":"Martin","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Dubois","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9ment","family":"Gillard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5422-5884","authenticated-orcid":false,"given":"Henrich","family":"Lauko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"key":"9_CR1","unstructured":"1800-2017 - IEEE Standard for SystemVerilog-Unified Hardware Design, Specification, and Verification Language. IEEE (2018)"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B Alpern","year":"1987","unstructured":"Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distrib. Comput. 2(3), 117\u2013126 (1987)","journal-title":"Distrib. Comput."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-662-43613-4_17","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"S Baarir","year":"2014","unstructured":"Baarir, S., Duret-Lutz, A.: Mechanizing the minimization of deterministic generalized B\u00fcchi automata. In: \u00c1brah\u00e1m, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol. 8461, pp. 266\u2013283. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43613-4_17"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-662-48899-7_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S Baarir","year":"2015","unstructured":"Baarir, S., Duret-Lutz, A.: SAT-based minimization of deterministic $$\\omega $$-automata. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 79\u201387. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_6"},{"key":"9_CR5","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., et al.: The Hanoi omega-automata format. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 479\u2013486. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_31"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-31784-3_26","volume-title":"Automated Technology for Verification and Analysis","author":"C Baier","year":"2019","unstructured":"Baier, C., Blahoudek, F., Duret-Lutz, A., Klein, J., M\u00fcller, D., Strej\u010dek, J.: Generic emptiness check for fun and profit. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 445\u2013461. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_26"},{"key":"9_CR7","unstructured":"Biere, A., Heljanko, K., Wieringa, S.: AIGER 1.9 and beyond. Technical Report 11\/2, Institute for Formal Models and Verification, Johannes Kepler University, Altenbergerstr. 69, 4040 Linz, Austria (2011)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1007\/978-3-662-49674-9_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Blahoudek","year":"2016","unstructured":"Blahoudek, F., Heizmann, M., Schewe, S., Strej\u010dek, J., Tsai, M.-H.: Complementing semi-deterministic B\u00fcchi automata. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 770\u2013787. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_49"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10009-019-00508-4","volume":"21","author":"V Bloemen","year":"2019","unstructured":"Bloemen, V., Duret-Lutz, A., van de Pol, J.: Model checking with generalized Rabin and Fin-less automata. Int. J. Soft. Tools Technol. Transfer 21(3), 307\u2013324 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00508-4","journal-title":"Int. J. Soft. Tools Technol. Transfer"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-19805-2_13","volume-title":"Foundations of Software Science and Computational Structures","author":"U Boker","year":"2011","unstructured":"Boker, U., Kupferman, O.: Co-B\u00fcching them all. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 184\u2013198. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19805-2_13"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-14162-1_7","volume-title":"Automata, Languages and Programming","author":"U Boker","year":"2010","unstructured":"Boker, U., Kupferman, O., Rosenberg, A.: Alternation removal in B\u00fcchi automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 76\u201387. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_7"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-35182-2_25","volume-title":"Programming Languages and Systems","author":"J Brotherston","year":"2012","unstructured":"Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 350\u2013367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"key":"9_CR13","unstructured":"Bruy\u00e8re, V., Raskin, J.-F., Tamines, C.: Pareto-rational verification (2022). https:\/\/arxiv.org\/abs\/2202.13485"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Carton, O., Maceiras, R.: Computing the Rabin index of a parity automaton. Informatique th\u00e9orique et applications 33(6), 495\u2013505 (1999). http:\/\/www.numdam.org\/item\/ITA_1999__33_6_495_0\/","DOI":"10.1051\/ita:1999129"},{"key":"9_CR15","unstructured":"Casares, A., Colcombet, T., Fijalkow, N.: Optimal transformations of games and automata using Muller conditions. In: ICALP 2021, vol. 198, pp. 1\u201314 (2021)"},{"key":"9_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-99527-0_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2022","author":"A Casares","year":"2022","unstructured":"Casares, A., Duret-Lutz, A., Meyer, K.J., Renkin, F., Sickert, S.: Practical applications of the alternating cycle decomposition. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2022. LNCS, vol. 13244, pp. 99\u2013117. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_6"},{"key":"9_CR17","unstructured":"Conda-Forge Community: The conda-forge project: community-based software distribution built on the conda package format and ecosystem, July 2015. https:\/\/doi.org\/10.5281\/zenodo.4774216"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Doveri, K., Ganty, P., Mazzocchi, N.: FORQ-based language inclusion formal testing. In: Shoham, S., Vizel, Y. (eds.) CAV 2022, LNAI, vol. 13372, pp. yy\u2013zz (2022). https:\/\/doi.org\/10.1007\/978-3-031-13188-2_9","DOI":"10.1007\/978-3-031-13188-2_9"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-319-02444-8_31","volume-title":"Automated Technology for Verification and Analysis","author":"A Duret-Lutz","year":"2013","unstructured":"Duret-Lutz, A.: Manipulating LTL formulas using spot 1.0. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 442\u2013445. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_31"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Duret-Lutz, A., Poitrenaud, D.: SPOT: an extensible model checking library using transition-based generalized B\u00fcchi automata. In: MASCOTS 2004, pp. 76\u201383. IEEE Computer Society Press (2004)","DOI":"10.1109\/MASCOT.2004.1348184"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","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":"A Duret-Lutz","year":"2016","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0\u2014a framework for LTL and $$\\omega $$-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"EA Emerson","year":"1987","unstructured":"Emerson, E.A., Lei, C.-L.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8(3), 275\u2013306 (1987)","journal-title":"Sci. Comput. Program."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53\u201365. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_6"},{"key":"9_CR24","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI 2013, pp. 854\u2013860 (2013)"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Complementing B\u00fcchi automata with Ranker. In: Shoham, S., Vizel, Y. (eds.) CAV 2022, LNAI, vol. 13372, pp. yy\u2013zz (2022). https:\/\/doi.org\/10.1007\/978-3-031-13188-2_9","DOI":"10.1007\/978-3-031-13188-2_9"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-030-17502-3_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Jasper","year":"2019","unstructured":"Jasper, M., et al.: RERS 2019: combining synthesis with real-world models. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 101\u2013115. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_7"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-76336-9_7","volume-title":"Implementation and Application of Automata","author":"J Klein","year":"2007","unstructured":"Klein, J., Baier, C.: On-the-fly stuttering in the construction of deterministic $$\\omega $$-automata. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 51\u201361. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76336-9_7"},{"key":"9_CR28","unstructured":"Kordon, F., et al.: Complete results for the 2021 edition of the model checking contest, June 2021. http:\/\/mcc.lip6.fr\/2021\/results.php"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-31424-7_7","volume-title":"Computer Aided Verification","author":"J K\u0159et\u00ednsk\u00fd","year":"2012","unstructured":"K\u0159et\u00ednsk\u00fd, J., Esparza, J.: Deterministic automata for the (F, G)-fragment of LTL. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 7\u201322. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_7"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-030-01090-4_34","volume-title":"Automated Technology for Verification and Analysis","author":"J K\u0159et\u00ednsk\u00fd","year":"2018","unstructured":"K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T., Sickert, S.: Owl: a Library for $$\\omega $$-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543\u2013550. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_34"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-58325-4_202","volume-title":"Algorithms and Computation","author":"SC Krishnan","year":"1994","unstructured":"Krishnan, S.C., Puri, A., Brayton, R.K.: Deterministic $$\\omega $$ automata vis-a-vis deterministic Buchi automata. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 378\u2013386. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58325-4_202"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T., Waldmann, C., Weininger, M.: Index appearance record with preorders. Acta Informatica, 1\u201334 (2021). https:\/\/doi.org\/10.1007\/s00236-021-00412-y","DOI":"10.1007\/s00236-021-00412-y"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-31784-3_18","volume-title":"Automated Technology for Verification and Analysis","author":"C L\u00f6ding","year":"2019","unstructured":"L\u00f6ding, C., Pirogov, A.: New optimizations and heuristics for determinization of B\u00fcchi automata. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 317\u2013333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_18"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC 1990, pp. 377\u2013410. ACM (1990)","DOI":"10.1145\/93385.93442"},{"key":"9_CR35","unstructured":"Michaud, T., Colange, M.: Reactive synthesis from LTL specification with spot. In: SYNT 2018 (2018). http:\/\/www.lrde.epita.fr\/dload\/papers\/michaud.18.synt.pdf"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-23404-5_7","volume-title":"Model Checking Software","author":"T Michaud","year":"2015","unstructured":"Michaud, T., Duret-Lutz, A.: Practical stutter-invariance checks for $$\\omega $$-regular languages. In: Fischer, B., Geldenhuys, J. (eds.) SPIN 2015. LNCS, vol. 9232, pp. 84\u2013101. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23404-5_7"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on $$\\omega $$-words. Theoret. Comput. Sci. 32, 321\u2013330 (1984)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"9_CR38","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10009-016-0422-5","volume":"19","author":"E Renault","year":"2017","unstructured":"Renault, E., Duret-Lutz, A., Kordon, F., Poitrenaud, D.: Variations on parallel explicit model checking for generalized B\u00fcchi automata. Int. J. Softw. Tools Technol. Transfer (STTT) 19(6), 653\u2013673 (2017)","journal-title":"Int. J. Softw. Tools Technol. Transfer (STTT)"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-59152-6_7","volume-title":"Automated Technology for Verification and Analysis","author":"F Renkin","year":"2020","unstructured":"Renkin, F., Duret-Lutz, A., Pommellet, A.: Practical \u201cparitizing\u2019\u2019 of emerson-Lei automata. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 127\u2013143. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_7"},{"key":"9_CR40","unstructured":"Renkin, F., Schlehuber, P., Duret-Lutz, A., Pommellet, A.: Improvements to ltlsynt. Presented at the SYNT 2021 Workshop, Without Proceedings, July 2021. https:\/\/www.lrde.epita.fr\/~adl\/dl\/adl\/renkin.21.synt.pdf"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Safra, S., Vardi, M.Y.: On $$\\omega $$-automata and temporal logic. In: STOC 1989, pp. 127\u2013137. ACM (1989)","DOI":"10.1145\/73007.73019"},{"key":"9_CR42","unstructured":"Tauriainen, H.: A randomized testbench for algorithms translating linear temporal logic formul\u00e6 into B\u00fcchi automata. In: CS &P 1999, pp. 251\u2013262 (1999)"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/978-3-642-39799-8_62","volume-title":"Computer Aided Verification","author":"M-H Tsai","year":"2013","unstructured":"Tsai, M.-H., Tsay, Y.-K., Hwang, Y.-S.: GOAL for games, omega-automata, and logics. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 883\u2013889. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_62"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13188-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T20:21:29Z","timestamp":1727727689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13188-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031131875","9783031131882"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13188-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"209","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":"11","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":"19% - 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.9","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.7","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)"}}]}}