{"keyword":["computer networks and communications","information systems","software"],"date_created":"2022-01-06T12:37:27Z","date_updated":"2023-08-02T13:49:28Z","month":"10","page":"585-618","volume":59,"title":"Index appearance record with preorders","_id":"10602","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165"},{"last_name":"Waldmann","full_name":"Waldmann, Clara","first_name":"Clara"},{"last_name":"Weininger","full_name":"Weininger, Maximilian","first_name":"Maximilian"}],"ddc":["000"],"year":"2022","type":"journal_article","oa_version":"Published Version","oa":1,"publication_status":"published","article_type":"original","isi":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"acknowledgement":"This work is partially funded by the German Research Foundation (DFG) projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification (No. 383882557), and the Alexander von Humboldt Foundation with funds from the German Federal Ministry of Education and Research. It is an extended version of [21], including all proofs together with further explanations and examples. Moreover, we provide a new, more efficient construction based on (total) preorders, unifying previous optimizations. Experiments are performed with a new, performant implementation, comparing our approach to the current state of the art.","file":[{"file_size":1066082,"checksum":"bf1c195b6aaf59e8530cf9e3a9d731f7","access_level":"open_access","relation":"main_file","success":1,"file_id":"10603","file_name":"2021_ActaInfor_Křetínský.pdf","date_created":"2022-01-07T07:50:31Z","content_type":"application/pdf","date_updated":"2022-01-07T07:50:31Z","creator":"cchlebak"}],"intvolume":"        59","has_accepted_license":"1","publication":"Acta Informatica","quality_controlled":"1","external_id":{"isi":["000735765500001"]},"publication_identifier":{"eissn":["1432-0525"],"issn":["0001-5903"]},"date_published":"2022-10-01T00:00:00Z","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"day":"01","status":"public","citation":{"mla":"Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” <i>Acta Informatica</i>, vol. 59, Springer Nature, 2022, pp. 585–618, doi:<a href=\"https://doi.org/10.1007/s00236-021-00412-y\">10.1007/s00236-021-00412-y</a>.","ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618.","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., &#38; Weininger, M. (2022). Index appearance record with preorders. <i>Acta Informatica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00236-021-00412-y\">https://doi.org/10.1007/s00236-021-00412-y</a>","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. <i>Acta Informatica</i>. 2022;59:585-618. doi:<a href=\"https://doi.org/10.1007/s00236-021-00412-y\">10.1007/s00236-021-00412-y</a>","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” <i>Acta Informatica</i>, vol. 59. Springer Nature, pp. 585–618, 2022.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record with Preorders.” <i>Acta Informatica</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00236-021-00412-y\">https://doi.org/10.1007/s00236-021-00412-y</a>."},"doi":"10.1007/s00236-021-00412-y","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2022-01-07T07:50:31Z","abstract":[{"lang":"eng","text":"Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches."}],"publisher":"Springer Nature","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}]}