[{"oa":1,"file":[{"creator":"dernst","file_name":"2024_PLoSCompBio_Chintaluri.pdf","file_id":"19897","date_updated":"2025-06-25T05:47:36Z","success":1,"access_level":"open_access","content_type":"application/pdf","date_created":"2025-06-25T05:47:36Z","checksum":"c09718d0d09614642d877d0716ce32e8","file_size":2540277,"relation":"main_file"}],"isi":1,"date_updated":"2026-10-21T11:22:14Z","das_tickbox":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/Neuroinflab/kCSD-python"}]},"intvolume":"        20","file_date_updated":"2025-06-25T05:47:36Z","oa_version":"Published Version","publication":"PLoS Computational Biology","month":"03","dataavailabilitystatement":"kCSD-python package, an implementation of the kernel Current Source Density method (https://doi.org/10.1162/NECO_a_00236) and its two variants ((https://doi.org/10.1007/s12021-015-9265-6) and (https://doi.org/10.7554/eLife.29384)) is available under the modified BSD License (3-Clause BSD) on GitHub (https://github.com/Neuroinflab/kCSD-python).","DOAJ_listed":"1","_id":"15169","article_type":"original","department":[{"_id":"TiVo"}],"date_created":"2024-03-24T23:00:59Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"kCSD-python, reliable current source density estimation with quality control","abstract":[{"lang":"eng","text":"Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results."}],"acknowledgement":"The Python implementation of kCSD was started by Grzegorz Parka during Google Summer of Code project through the International Neuroinformatics Coordinating Facility. Jan Mąka implemented the first Python version of skCSD class. This work was supported by the Polish National Science Centre (2013/08/W/NZ4/00691 to DKW; 2015/17/B/ST7/04123 to DKW). ","publisher":"Public Library of Science","status":"public","issue":"3","license":"https://creativecommons.org/licenses/by/4.0/","quality_controlled":"1","OA_type":"gold","doi":"10.1371/journal.pcbi.1011941","year":"2024","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"yes","volume":20,"citation":{"ieee":"C. Chintaluri <i>et al.</i>, “kCSD-python, reliable current source density estimation with quality control,” <i>PLoS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","short":"C. Chintaluri, M. Bejtka, W. Sredniawa, M. Czerwinski, J.M. Dzik, J. Jedrzejewska-Szmek, D.K. Wojciki, PLoS Computational Biology 20 (2024).","apa":"Chintaluri, C., Bejtka, M., Sredniawa, W., Czerwinski, M., Dzik, J. M., Jedrzejewska-Szmek, J., &#38; Wojciki, D. K. (2024). kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>","chicago":"Chintaluri, Chaitanya, Marta Bejtka, Wladyslaw Sredniawa, Michal Czerwinski, Jakub M. Dzik, Joanna Jedrzejewska-Szmek, and Daniel K. Wojciki. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>.","mla":"Chintaluri, Chaitanya, et al. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>, vol. 20, no. 3, e1011941, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>.","ama":"Chintaluri C, Bejtka M, Sredniawa W, et al. kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>","ista":"Chintaluri C, Bejtka M, Sredniawa W, Czerwinski M, Dzik JM, Jedrzejewska-Szmek J, Wojciki DK. 2024. kCSD-python, reliable current source density estimation with quality control. PLoS Computational Biology. 20(3), e1011941."},"OA_place":"publisher","publication_status":"published","language":[{"iso":"eng"}],"pmid":1,"external_id":{"pmid":["38484020"],"isi":["001190689800001"]},"date_published":"2024-03-14T00:00:00Z","fulldoi":"https://doi.org/10.1371/journal.pcbi.1011941","ddc":["000","570"],"has_accepted_license":"1","article_processing_charge":"Yes","type":"journal_article","day":"14","author":[{"orcid":"0000-0003-4252-1608","last_name":"Chintaluri","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","first_name":"Chaitanya","full_name":"Chintaluri, Chaitanya"},{"full_name":"Bejtka, Marta","first_name":"Marta","last_name":"Bejtka"},{"last_name":"Sredniawa","first_name":"Wladyslaw","full_name":"Sredniawa, Wladyslaw"},{"full_name":"Czerwinski, Michal","first_name":"Michal","last_name":"Czerwinski"},{"first_name":"Jakub M.","full_name":"Dzik, Jakub M.","last_name":"Dzik"},{"last_name":"Jedrzejewska-Szmek","first_name":"Joanna","full_name":"Jedrzejewska-Szmek, Joanna"},{"first_name":"Daniel K.","full_name":"Wojciki, Daniel K.","last_name":"Wojciki"}],"publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"scopus_import":"1","supplementarymaterial":"yes","article_number":"e1011941","corr_author":"1"},{"has_accepted_license":"1","fulldoi":"https://doi.org/10.1523/JNEUROSCI.0846-23.2024","ddc":["570"],"date_published":"2024-05-22T00:00:00Z","pmid":1,"external_id":{"pmid":["38561228"],"isi":["001249681000008"]},"language":[{"iso":"eng"}],"article_number":"e0846232024","supplementarymaterial":"no","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"scopus_import":"1","author":[{"first_name":"Geoffroy","full_name":"Delamare, Geoffroy","last_name":"Delamare"},{"last_name":"Feitosa Tomé","id":"0eed2d40-3d48-11ec-8d38-f789cc2e40b2","first_name":"Douglas","full_name":"Feitosa Tomé, Douglas"},{"last_name":"Clopath","first_name":"Claudia","full_name":"Clopath, Claudia"}],"day":"22","type":"journal_article","article_processing_charge":"Yes (in subscription journal)","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-06-02T22:00:57Z","article_type":"original","department":[{"_id":"TiVo"}],"_id":"17092","month":"05","oa_version":"Published Version","publication":"Journal of Neuroscience","intvolume":"        44","file_date_updated":"2024-06-03T06:34:21Z","das_tickbox":"0","oa":1,"date_updated":"2026-10-21T11:07:11Z","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2024-06-03T06:34:21Z","checksum":"4e19159800db605b802c721e4d4b1ffe","file_size":920354,"relation":"main_file","creator":"dernst","file_name":"2024_JourNeuroscience_Delamare.pdf","date_updated":"2024-06-03T06:34:21Z","file_id":"17095","success":1}],"isi":1,"citation":{"short":"G. Delamare, D. Feitosa Tomé, C. Clopath, Journal of Neuroscience 44 (2024).","ieee":"G. Delamare, D. Feitosa Tomé, and C. Clopath, “Intrinsic neural excitability biases allocation and overlap of memory engrams,” <i>Journal of Neuroscience</i>, vol. 44, no. 21. Society for Neuroscience, 2024.","chicago":"Delamare, Geoffroy, Douglas Feitosa Tomé, and Claudia Clopath. “Intrinsic Neural Excitability Biases Allocation and Overlap of Memory Engrams.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2024. <a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">https://doi.org/10.1523/JNEUROSCI.0846-23.2024</a>.","apa":"Delamare, G., Feitosa Tomé, D., &#38; Clopath, C. (2024). Intrinsic neural excitability biases allocation and overlap of memory engrams. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">https://doi.org/10.1523/JNEUROSCI.0846-23.2024</a>","ama":"Delamare G, Feitosa Tomé D, Clopath C. Intrinsic neural excitability biases allocation and overlap of memory engrams. <i>Journal of Neuroscience</i>. 2024;44(21). doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">10.1523/JNEUROSCI.0846-23.2024</a>","mla":"Delamare, Geoffroy, et al. “Intrinsic Neural Excitability Biases Allocation and Overlap of Memory Engrams.” <i>Journal of Neuroscience</i>, vol. 44, no. 21, e0846232024, Society for Neuroscience, 2024, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">10.1523/JNEUROSCI.0846-23.2024</a>.","ista":"Delamare G, Feitosa Tomé D, Clopath C. 2024. Intrinsic neural excitability biases allocation and overlap of memory engrams. Journal of Neuroscience. 44(21), e0846232024."},"publication_status":"published","year":"2024","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":44,"researchdata_availability":"no","doi":"10.1523/JNEUROSCI.0846-23.2024","quality_controlled":"1","publisher":"Society for Neuroscience","status":"public","issue":"21","acknowledgement":"We thank Sadra Sadeh and Inês Completo Guerreiro for helpful comments on the manuscript, Yosif Zaki and Denise J. Cai for useful feedback and members of the Clopath lab for discussion and support. This work was supported by Biotechnology and Biological Sciences Research Council (BB/N013956/1 awarded to C.C.), Wellcome Trust (200790/Z/16/Z awarded to C.C.), the Simons Foundation (564408 awarded to C.C.), and Engineering and Physical Sciences Research Council (EP/R035806/1 awarded to C.C.).","abstract":[{"text":"Memories are thought to be stored in neural ensembles known as engrams that are specifically reactivated during memory recall. Recent studies have found that memory engrams of two events that happened close in time tend to overlap in the hippocampus and the amygdala, and these overlaps have been shown to support memory linking. It has been hypothesized that engram overlaps arise from the mechanisms that regulate memory allocation itself, involving neural excitability, but the exact process remains unclear. Indeed, most theoretical studies focus on synaptic plasticity and little is known about the role of intrinsic plasticity, which could be mediated by neural excitability and serve as a complementary mechanism for forming memory engrams. Here, we developed a rate-based recurrent neural network that includes both synaptic plasticity and neural excitability. We obtained structural and functional overlap of memory engrams for contexts that are presented close in time, consistent with experimental and computational studies. We then investigated the role of excitability in memory allocation at the network level and unveiled competitive mechanisms driven by inhibition. This work suggests mechanisms underlying the role of intrinsic excitability in memory allocation and linking, and yields predictions regarding the formation and the overlap of memory engrams.","lang":"eng"}],"title":"Intrinsic neural excitability biases allocation and overlap of memory engrams"},{"article_type":"original","department":[{"_id":"TiBr"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-01-28T06:55:31Z","month":"12","_id":"18930","intvolume":"        75","file_date_updated":"2025-01-28T07:03:51Z","oa_version":"Published Version","publication":"The Quarterly Journal of Mathematics","oa":1,"isi":1,"date_updated":"2026-10-21T11:06:48Z","file":[{"file_name":"2024_QuarterlyJourMath_Elsholtz.pdf","creator":"dernst","success":1,"date_updated":"2025-01-28T07:03:51Z","file_id":"18931","access_level":"open_access","date_created":"2025-01-28T07:03:51Z","content_type":"application/pdf","file_size":424645,"checksum":"1a06e052761d3f1e873463d6f529dd82","relation":"main_file"}],"das_tickbox":"0","researchdata_availability":"no","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2024","volume":75,"publication_status":"published","citation":{"ista":"Elsholtz C, Wurzinger L. 2024. Sumsets in the set of squares. The Quarterly Journal of Mathematics. 75(4), 1243–1254.","mla":"Elsholtz, Christian, and Lena Wurzinger. “Sumsets in the Set of Squares.” <i>The Quarterly Journal of Mathematics</i>, vol. 75, no. 4, Oxford University Press, 2024, pp. 1243–54, doi:<a href=\"https://doi.org/10.1093/qmath/haae044\">10.1093/qmath/haae044</a>.","ama":"Elsholtz C, Wurzinger L. Sumsets in the set of squares. <i>The Quarterly Journal of Mathematics</i>. 2024;75(4):1243-1254. doi:<a href=\"https://doi.org/10.1093/qmath/haae044\">10.1093/qmath/haae044</a>","apa":"Elsholtz, C., &#38; Wurzinger, L. (2024). Sumsets in the set of squares. <i>The Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haae044\">https://doi.org/10.1093/qmath/haae044</a>","chicago":"Elsholtz, Christian, and Lena Wurzinger. “Sumsets in the Set of Squares.” <i>The Quarterly Journal of Mathematics</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/qmath/haae044\">https://doi.org/10.1093/qmath/haae044</a>.","ieee":"C. Elsholtz and L. Wurzinger, “Sumsets in the set of squares,” <i>The Quarterly Journal of Mathematics</i>, vol. 75, no. 4. Oxford University Press, pp. 1243–1254, 2024.","short":"C. Elsholtz, L. Wurzinger, The Quarterly Journal of Mathematics 75 (2024) 1243–1254."},"OA_place":"publisher","OA_type":"hybrid","doi":"10.1093/qmath/haae044","publisher":"Oxford University Press","status":"public","issue":"4","quality_controlled":"1","title":"Sumsets in the set of squares","abstract":[{"lang":"eng","text":"We study sumsets 𝒜 + ℬ in the set of squares 𝒮 (and, more generally, in the set of kth powers 𝒮k, where k ≥2 is an integer). It is known by a result of Gyarmati that 𝒜 + ℬ ⊂ 𝒮k ∩[1,N] implies that min(|𝒜|,|ℬ|) =Ok(logN). Here, we study how the upper bound on |ℬ| decreases, when the size of |𝒜| increases (or vice versa). In particular, if |𝒜| ≥ Ck1m m(logN)1m , then |ℬ| = Ok(m2logN), for sufficiently large N, a positive integer m and an explicit constant C > 0. For example, with m ∼ loglogN this gives: If |𝒜| ≥ CkloglogN,then |ℬ| = Ok(logN(loglogN)2)."}],"acknowledgement":"This manuscript grew out of the second author’s MSc Thesis at Graz University of Technology [34]. C. Elsholtz is supported by a joint FWF-ANR project ArithRand, grant numbers FWF I 4945-N and ANR-20-CE91-0006. Both authors would like to thank Igor Shparlinski for drawing our attention to related character sum estimates. Furthermore, we would like to thank the referee for a careful reading of the paper.","fulldoi":"https://doi.org/10.1093/qmath/haae044","ddc":["510"],"has_accepted_license":"1","date_published":"2024-12-01T00:00:00Z","external_id":{"isi":["001304396600001"]},"language":[{"iso":"eng"}],"supplementarymaterial":"no","page":"1243-1254","corr_author":"1","author":[{"first_name":"Christian","full_name":"Elsholtz, Christian","last_name":"Elsholtz"},{"last_name":"Wurzinger","orcid":"0009-0004-5360-0074","full_name":"Wurzinger, Lena","first_name":"Lena","id":"50c57d72-32a8-11ee-aeea-d652094d2ccd"}],"scopus_import":"1","publication_identifier":{"eissn":["1464-3847"],"issn":["0033-5606"]},"day":"01","article_processing_charge":"Yes (via OA deal)","PlanS_conform":"1","type":"journal_article"},{"supplementarymaterial":"no","corr_author":"1","article_number":"2","author":[{"first_name":"Filip","full_name":"Cano, Filip","last_name":"Cano"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"last_name":"Könighofer","full_name":"Könighofer, Bettina","first_name":"Bettina"},{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","last_name":"Kueffner"},{"orcid":"0000-0001-9864-7475","last_name":"Mallik","full_name":"Mallik, Kaushik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773232"]},"day":"01","article_processing_charge":"Yes","type":"conference","ddc":["000"],"fulldoi":"https://doi.org/10.4230/LIPIcs.FSCD.2024.2","has_accepted_license":"1","alternative_title":["LIPIcs"],"external_id":{"isi":["001587746100002"]},"date_published":"2024-07-01T00:00:00Z","language":[{"iso":"eng"}],"volume":299,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"no","year":"2024","citation":{"apa":"Cano, F., Henzinger, T. A., Könighofer, B., Kueffner, K., &#38; Mallik, K. (2024). Abstraction-based decision making for statistical properties. In <i>9th International Conference on Formal Structures for Computation and Deduction</i> (Vol. 299). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">https://doi.org/10.4230/LIPIcs.FSCD.2024.2</a>","chicago":"Cano, Filip, Thomas A Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik. “Abstraction-Based Decision Making for Statistical Properties.” In <i>9th International Conference on Formal Structures for Computation and Deduction</i>, Vol. 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">https://doi.org/10.4230/LIPIcs.FSCD.2024.2</a>.","ieee":"F. Cano, T. A. Henzinger, B. Könighofer, K. Kueffner, and K. Mallik, “Abstraction-based decision making for statistical properties,” in <i>9th International Conference on Formal Structures for Computation and Deduction</i>, Tallinn, Estonia, 2024, vol. 299.","short":"F. Cano, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, 9th International Conference on Formal Structures for Computation and Deduction, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. 2024. Abstraction-based decision making for statistical properties. 9th International Conference on Formal Structures for Computation and Deduction. FSCD: Conference on Formal Structures for Computation and Deduction, LIPIcs, vol. 299, 2.","mla":"Cano, Filip, et al. “Abstraction-Based Decision Making for Statistical Properties.” <i>9th International Conference on Formal Structures for Computation and Deduction</i>, vol. 299, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">10.4230/LIPIcs.FSCD.2024.2</a>.","ama":"Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. Abstraction-based decision making for statistical properties. In: <i>9th International Conference on Formal Structures for Computation and Deduction</i>. Vol 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">10.4230/LIPIcs.FSCD.2024.2</a>"},"publication_status":"published","doi":"10.4230/LIPIcs.FSCD.2024.2","status":"public","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","abstract":[{"text":"Sequential decision-making in probabilistic environments is a fundamental problem with many applications in AI and economics. In this paper, we present an algorithm for synthesizing sequential decision-making agents that optimize statistical properties such as maximum and average response times. In the general setting of sequential decision-making, the environment is modeled as a random process that generates inputs. The agent responds to each input, aiming to maximize rewards and minimize costs within a specified time horizon. The corresponding synthesis problem is known to be PSPACE-hard. We consider the special case where the input distribution, reward, and cost depend on input-output statistics specified by counter automata. For such problems, this paper presents the first PTIME synthesis algorithms. We introduce the notion of statistical abstraction, which clusters statistically indistinguishable input-output sequences into equivalence classes. This abstraction allows for a dynamic programming algorithm whose complexity grows polynomially with the considered horizon, making the statistical case exponentially more efficient than the general case. We evaluate our algorithm on three different application scenarios of a client-server protocol, where multiple clients compete via bidding to gain access to the service offered by the server. The synthesized policies optimize profit while guaranteeing that none of the server’s clients is disproportionately starved of the service.","lang":"eng"}],"title":"Abstraction-based decision making for statistical properties","acknowledgement":"This work is partly supported by the European Research Council under Grant No.: ERC2020-AdG 101020093. It is also partially supported by the State Government of Styria, Austria –\r\nDepartment Zukunftsfonds Steiermark.","department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-07-28T22:01:09Z","month":"07","ec_funded":1,"_id":"17327","conference":{"name":"FSCD: Conference on Formal Structures for Computation and Deduction","end_date":"2024-07-13","location":"Tallinn, Estonia","start_date":"2024-07-10"},"file_date_updated":"2024-07-29T11:15:59Z","intvolume":"       299","publication":"9th International Conference on Formal Structures for Computation and Deduction","oa_version":"Published Version","isi":1,"date_updated":"2026-10-21T12:02:55Z","file":[{"relation":"main_file","file_size":1391381,"checksum":"cc6bb89be0eaa404a6ce019392cd293e","date_created":"2024-07-29T11:15:59Z","content_type":"application/pdf","access_level":"open_access","success":1,"date_updated":"2024-07-29T11:15:59Z","file_id":"17341","creator":"dernst","file_name":"2024_LIPICs_Cano.pdf"}],"oa":1,"das_tickbox":"0"},{"title":"The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks","abstract":[{"text":"Thin pancake-like neuronal networks cultured on top of a planar microelectrode array have been extensively tried out in neuroengineering, as a substrate for the mobile robot’s control unit, i.e., as a cyborg’s brain. Most of these attempts failed due to intricate self-organizing dynamics in the neuronal systems. In particular, the networks may exhibit an emergent spatial map of steady nucleation sites (“n-sites”) of spontaneous population spikes. Being unpredictable and independent of the surface electrode locations, the n-sites drastically change local ability of the network to generate spikes. Here, using a spiking neuronal network model with generative spatially-embedded connectome, we systematically show in simulations that the number, location, and relative activity of spontaneously formed n-sites (“the vitals”) crucially depend on the samplings of three distributions: (1) the network distribution of neuronal excitability, (2) the distribution of connections between neurons of the network, and (3) the distribution of maximal amplitudes of a single synaptic current pulse. Moreover, blocking the dynamics of a small fraction (about 4%) of non-pacemaker neurons having the highest excitability was enough to completely suppress the occurrence of population spikes and their n-sites. This key result is explained theoretically. Remarkably, the n-sites occur taking into account only short-term synaptic plasticity, i.e., without a Hebbian-type plasticity. As the spiking network model used in this study is strictly deterministic, all simulation results can be accurately reproduced. The model, which has already demonstrated a very high richness-to-complexity ratio, can also be directly extended into the three-dimensional case, e.g., for targeting peculiarities of spiking dynamics in cerebral (or brain) organoids. We recommend the model as an excellent illustrative tool for teaching network-level computational neuroscience, complementing a few benchmark models.","lang":"eng"}],"acknowledgement":"A.P. is grateful to Chaitanya Chintaluri, Douglas Feitosa Tomé, and Tim P. Vogels for useful discussions. This work was supported by a European Research Council Consolidator Grant (SYNAPSEEK, 819603, to Tim P. Vogels).","status":"public","publisher":"Elsevier","project":[{"call_identifier":"H2020","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning."}],"quality_controlled":"1","OA_type":"hybrid","doi":"10.1016/j.neunet.2024.106589","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"yes","year":"2024","volume":180,"publication_status":"published","citation":{"ista":"Zendrikov D, Paraskevov A. 2024. The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. Neural Networks. 180, 106589.","ama":"Zendrikov D, Paraskevov A. The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. <i>Neural Networks</i>. 2024;180. doi:<a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">10.1016/j.neunet.2024.106589</a>","mla":"Zendrikov, Dmitrii, and Alexander Paraskevov. “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.” <i>Neural Networks</i>, vol. 180, 106589, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">10.1016/j.neunet.2024.106589</a>.","chicago":"Zendrikov, Dmitrii, and Alexander Paraskevov. “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.” <i>Neural Networks</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">https://doi.org/10.1016/j.neunet.2024.106589</a>.","apa":"Zendrikov, D., &#38; Paraskevov, A. (2024). The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. <i>Neural Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">https://doi.org/10.1016/j.neunet.2024.106589</a>","short":"D. Zendrikov, A. Paraskevov, Neural Networks 180 (2024).","ieee":"D. Zendrikov and A. Paraskevov, “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks,” <i>Neural Networks</i>, vol. 180. Elsevier, 2024."},"OA_place":"publisher","isi":1,"file":[{"creator":"dernst","file_name":"2024_NeuralNetworks_Zendrikov.pdf","success":1,"file_id":"18825","date_updated":"2025-01-13T08:26:08Z","date_created":"2025-01-13T08:26:08Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"6a194323234e01d4ae725f674529cdb1","file_size":6162281}],"date_updated":"2026-10-21T11:57:08Z","oa":1,"related_material":{"record":[{"relation":"research_data","status":"public","id":"23182"}]},"das_tickbox":"1","file_date_updated":"2025-01-13T08:26:08Z","intvolume":"       180","oa_version":"Published Version","publication":"Neural Networks","dataavailabilitystatement":"The attached Supplementary Material for this article contains four Figures, S1–S4, and two Videos. The simulation data and program codes required for reproducing all results of this study are available online at https://doi.org/10.6084/m9.figshare.24527848","month":"12","ec_funded":1,"_id":"17886","department":[{"_id":"TiVo"}],"article_type":"original","date_created":"2024-09-08T22:01:10Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","type":"journal_article","day":"01","author":[{"first_name":"Dmitrii","full_name":"Zendrikov, Dmitrii","last_name":"Zendrikov"},{"last_name":"Paraskevov","first_name":"Alexander","id":"d05e3c56-9262-11ed-9231-be692464e5ac","full_name":"Paraskevov, Alexander"}],"publication_identifier":{"issn":["0893-6080"],"eissn":["1879-2782"]},"scopus_import":"1","supplementarymaterial":"yes","corr_author":"1","article_number":"106589","language":[{"iso":"eng"}],"external_id":{"pmid":["39217864"],"isi":["001316474600001"]},"date_published":"2024-12-01T00:00:00Z","pmid":1,"ddc":["570"],"fulldoi":"https://doi.org/10.1016/j.neunet.2024.106589","has_accepted_license":"1"},{"oa":1,"file":[{"checksum":"4eab70274d1004ea411f7f0e74c033ac","file_size":1787569,"relation":"main_file","access_level":"open_access","date_created":"2024-07-16T10:26:41Z","content_type":"application/pdf","success":1,"date_updated":"2024-07-16T10:26:41Z","file_id":"17258","file_name":"2024_NonlinearAnalysis_Majumdar.pdf","creator":"dernst"}],"date_updated":"2026-10-21T12:00:53Z","isi":1,"das_tickbox":"1","intvolume":"        51","file_date_updated":"2024-07-16T10:26:41Z","oa_version":"Published Version","publication":"Nonlinear Analysis: Hybrid Systems","month":"02","dataavailabilitystatement":"No data was used for the research described in the article.\r\n","ec_funded":1,"_id":"14400","article_type":"original","department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2023-10-08T22:01:15Z","abstract":[{"text":"We consider the problem of computing the maximal probability of satisfying an \r\n-regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region.\r\nThe heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a \r\n-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract -player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve \r\n-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability.\r\nWe have implemented the abstraction-based algorithm in Mascot-SDS, where we combined the outlined abstraction step with our tool Genie (Majumdar et al., 2023) that solves \r\n-player parity games (through a reduction to Rabin games) more efficiently than existing algorithms. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We show empirically that the lower bound on the winning region computed by our approach is precise, by comparing against an over-approximation of the qualitative winning region. Moreover, our implementation outperforms a recently proposed tool for solving this problem by a large margin.","lang":"eng"}],"title":"Symbolic control for stochastic systems via finite parity games","acknowledgement":"We thank Daniel Hausmann and Nir Piterman for their valuable comments on an earlier version of the manuscript of our other paper [22] where we present, among other things, the parity fixpoint for 2 1/2-player games (for a slightly more general class of games) with a different and indirect proof of correctness. Based on their comments we observed that, unlike the other fixpoints that we present in [22], the parity fixpoint does not follow the exact same structure as its counterpart for 2-player games, which we also use int his paper.\r\nWe also thank Thejaswini Raghavan for observing that our symbolic parity fixpoint algorithm can be solved in quasi-polynomial time using recent improved algorithms for solving \r\n-calculus expressions. This significantly improved the complexity bounds of our algorithm in this paper.\r\nThe work of R. Majumdar and A.-K. Schmuck are partially supported by DFG, Germany project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG, Germany project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093. S. Soudjani is supported by the following projects: EPSRC EP/V043676/1, EIC 101070802, and ERC 101089047.","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publisher":"Elsevier","issue":"2","status":"public","quality_controlled":"1","doi":"10.1016/j.nahs.2023.101430","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"not applicable","year":"2024","volume":51,"citation":{"apa":"Majumdar, R., Mallik, K., Schmuck, A. K., &#38; Soudjani, S. (2024). Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>","chicago":"Majumdar, Rupak, Kaushik Mallik, Anne Kathrin Schmuck, and Sadegh Soudjani. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>.","ieee":"R. Majumdar, K. Mallik, A. K. Schmuck, and S. Soudjani, “Symbolic control for stochastic systems via finite parity games,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51, no. 2. Elsevier, 2024.","short":"R. Majumdar, K. Mallik, A.K. Schmuck, S. Soudjani, Nonlinear Analysis: Hybrid Systems 51 (2024).","ista":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. 2024. Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems. 51(2), 101430.","mla":"Majumdar, Rupak, et al. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51, no. 2, 101430, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>.","ama":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. 2024;51(2). doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>"},"publication_status":"published","language":[{"iso":"eng"}],"arxiv":1,"external_id":{"arxiv":["2101.00834"],"isi":["001093188100001"]},"date_published":"2024-02-01T00:00:00Z","fulldoi":"https://doi.org/10.1016/j.nahs.2023.101430","ddc":["000"],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","type":"journal_article","day":"01","author":[{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"},{"last_name":"Mallik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"last_name":"Schmuck","full_name":"Schmuck, Anne Kathrin","first_name":"Anne Kathrin"},{"first_name":"Sadegh","full_name":"Soudjani, Sadegh","last_name":"Soudjani"}],"scopus_import":"1","publication_identifier":{"issn":["1751-570X"]},"supplementarymaterial":"yes","article_number":"101430","corr_author":"1"},{"ddc":["000"],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1011797","has_accepted_license":"1","language":[{"iso":"eng"}],"pmid":1,"date_published":"2024-03-01T00:00:00Z","external_id":{"isi":["001181690200005"],"pmid":["38427633"]},"author":[{"last_name":"Hall","first_name":"Siobhan Mackenzie","full_name":"Hall, Siobhan Mackenzie"},{"last_name":"Kochin","first_name":"Daniel","full_name":"Kochin, Daniel"},{"full_name":"Carne, Carmel","first_name":"Carmel","last_name":"Carne"},{"last_name":"Herterich","full_name":"Herterich, Patricia","first_name":"Patricia"},{"full_name":"Lewers, Kristen Lenay","first_name":"Kristen Lenay","last_name":"Lewers"},{"last_name":"Abdelhack","first_name":"Mohamed","full_name":"Abdelhack, Mohamed"},{"first_name":"Arun","full_name":"Ramasubramanian, Arun","last_name":"Ramasubramanian"},{"first_name":"Juno Felecia","full_name":"Michael Alphonse, Juno Felecia","last_name":"Michael Alphonse"},{"first_name":"Visotheary","full_name":"Ung, Visotheary","last_name":"Ung"},{"full_name":"El-Gebali, Sara","first_name":"Sara","last_name":"El-Gebali"},{"first_name":"Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","full_name":"Currin, Christopher","orcid":"0000-0002-4809-5059","last_name":"Currin"},{"last_name":"Plomp","first_name":"Esther","full_name":"Plomp, Esther"},{"first_name":"Rachel","full_name":"Thompson, Rachel","last_name":"Thompson"},{"first_name":"Malvika","full_name":"Sharan, Malvika","last_name":"Sharan"}],"publication_identifier":{"issn":["1553-7358"]},"scopus_import":"1","supplementarymaterial":"yes","article_number":"e1011797","article_processing_charge":"Yes","type":"journal_article","day":"01","month":"03","_id":"15258","DOAJ_listed":"1","department":[{"_id":"TiVo"}],"article_type":"original","date_created":"2024-04-02T11:37:32Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_updated":"2026-10-21T11:23:24Z","file":[{"creator":"dernst","file_name":"2024_PloS_Hall.pdf","file_id":"15289","date_updated":"2024-04-03T13:29:36Z","success":1,"content_type":"application/pdf","date_created":"2024-04-03T13:29:36Z","access_level":"open_access","relation":"main_file","checksum":"1f0f837c5b4341f54f6347370ed8c1b7","file_size":858521}],"oa":1,"das_tickbox":"0","file_date_updated":"2024-04-03T13:29:36Z","intvolume":"        20","publication":"PLOS Computational Biology","oa_version":"Published Version","OA_type":"gold","doi":"10.1371/journal.pcbi.1011797","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"no","year":"2024","volume":20,"citation":{"apa":"Hall, S. M., Kochin, D., Carne, C., Herterich, P., Lewers, K. L., Abdelhack, M., … Sharan, M. (2024). Ten simple rules for pushing boundaries of inclusion at academic events. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">https://doi.org/10.1371/journal.pcbi.1011797</a>","chicago":"Hall, Siobhan Mackenzie, Daniel Kochin, Carmel Carne, Patricia Herterich, Kristen Lenay Lewers, Mohamed Abdelhack, Arun Ramasubramanian, et al. “Ten Simple Rules for Pushing Boundaries of Inclusion at Academic Events.” <i>PLOS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">https://doi.org/10.1371/journal.pcbi.1011797</a>.","ieee":"S. M. Hall <i>et al.</i>, “Ten simple rules for pushing boundaries of inclusion at academic events,” <i>PLOS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","short":"S.M. Hall, D. Kochin, C. Carne, P. Herterich, K.L. Lewers, M. Abdelhack, A. Ramasubramanian, J.F. Michael Alphonse, V. Ung, S. El-Gebali, C. Currin, E. Plomp, R. Thompson, M. Sharan, PLOS Computational Biology 20 (2024).","ista":"Hall SM, Kochin D, Carne C, Herterich P, Lewers KL, Abdelhack M, Ramasubramanian A, Michael Alphonse JF, Ung V, El-Gebali S, Currin C, Plomp E, Thompson R, Sharan M. 2024. Ten simple rules for pushing boundaries of inclusion at academic events. PLOS Computational Biology. 20(3), e1011797.","mla":"Hall, Siobhan Mackenzie, et al. “Ten Simple Rules for Pushing Boundaries of Inclusion at Academic Events.” <i>PLOS Computational Biology</i>, vol. 20, no. 3, e1011797, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">10.1371/journal.pcbi.1011797</a>.","ama":"Hall SM, Kochin D, Carne C, et al. Ten simple rules for pushing boundaries of inclusion at academic events. <i>PLOS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">10.1371/journal.pcbi.1011797</a>"},"OA_place":"publisher","publication_status":"published","abstract":[{"text":"Inclusion at academic events is facing increased scrutiny as the communities these events serve raise their expectations for who can practically attend. Active efforts in recent years to bring more diversity to academic events have brought progress and created momentum. However, we must reflect on these efforts and determine which underrepresented groups are being disadvantaged. Inclusion at academic events is important to ensure diversity of discourse and opinion, to help build networks, and to avoid academic siloing. All of these contribute to the development of a robust and resilient academic field. We have developed these Ten Simple Rules both to amplify the voices that have been speaking out and to celebrate the progress of many Equity, Diversity, and Inclusivity practices that continue to drive the organisation of academic events. The Rules aim to raise awareness as well as provide actionable suggestions and tools to support these initiatives further. This aims to support academic organisations such as the Deep Learning Indaba, Neuromatch Academy, the IBRO-Simons Computational Neuroscience Imbizo, Biodiversity Information Standards (TDWG), Arabs in Neuroscience, FAIRPoints, and OLS (formerly Open Life Science). This article is a call to action for organisers to reevaluate the impact and reach of their inclusive practices.","lang":"eng"}],"title":"Ten simple rules for pushing boundaries of inclusion at academic events","acknowledgement":"We would like to recognise the feedback and ideas shared with us by all attendees during the\r\nfocus groups that contributed to the development of this paper. Acknowledgements are given\r\nto Elisee Jafsia, Umar Farouk Ahmad, Zohra Slim, Mizanur Rahman, Rev. Katie Tupling,\r\nChristopher Emmanuel, Abdalrhman Mostafa, Pradeep Eranti, Toby Hodges, Avishkar\r\nBhoopchand, and Carolyn Dickson. We would like to thank our community members and\r\nacknowledge their bravery for sharing their stories that shaped the narrative of these Ten Simple\r\nRules. The stories shared with us formed the case studies, and while they are anonymous\r\nfor privacy and protection reasons, it is these stories that were on our mind during the entire\r\nprocess and kept us going. We acknowledge the efforts of the organisers that contribute to the\r\nhighly successful events that are the inspiration for the ideas presented here: the Deep\r\nLearning Indaba, Neuromatch Academy, the IBRO Simons Computational Neuroscience\r\nImbizo, and OLS. OLS also supported this project through their mentorship programme,\r\nOpen Seeds.","issue":"3","status":"public","publisher":"Public Library of Science","quality_controlled":"1"},{"article_number":"152479","supplementarymaterial":"no","publication_identifier":{"eissn":["1532-8384"],"issn":["0010-440X"]},"scopus_import":"1","author":[{"last_name":"Beyer","first_name":"Chad","full_name":"Beyer, Chad"},{"first_name":"Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","full_name":"Currin, Christopher","orcid":"0000-0002-4809-5059","last_name":"Currin"},{"last_name":"Williams","full_name":"Williams, Taryn","first_name":"Taryn"},{"last_name":"Stein","full_name":"Stein, Dan J.","first_name":"Dan J."}],"day":"01","type":"journal_article","article_processing_charge":"Yes","has_accepted_license":"1","fulldoi":"https://doi.org/10.1016/j.comppsych.2024.152479","ddc":["570"],"external_id":{"isi":["001221136000001"],"pmid":["38564872"]},"date_published":"2024-07-01T00:00:00Z","pmid":1,"language":[{"iso":"eng"}],"citation":{"ista":"Beyer C, Currin C, Williams T, Stein DJ. 2024. Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. Comprehensive Psychiatry. 132, 152479.","ama":"Beyer C, Currin C, Williams T, Stein DJ. Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. <i>Comprehensive Psychiatry</i>. 2024;132. doi:<a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">10.1016/j.comppsych.2024.152479</a>","mla":"Beyer, Chad, et al. “Meta-Analysis of the Comparative Efficacy of Benzodiazepines and Antidepressants for Psychic versus Somatic Symptoms of Generalized Anxiety Disorder.” <i>Comprehensive Psychiatry</i>, vol. 132, 152479, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">10.1016/j.comppsych.2024.152479</a>.","chicago":"Beyer, Chad, Christopher Currin, Taryn Williams, and Dan J. Stein. “Meta-Analysis of the Comparative Efficacy of Benzodiazepines and Antidepressants for Psychic versus Somatic Symptoms of Generalized Anxiety Disorder.” <i>Comprehensive Psychiatry</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">https://doi.org/10.1016/j.comppsych.2024.152479</a>.","apa":"Beyer, C., Currin, C., Williams, T., &#38; Stein, D. J. (2024). Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. <i>Comprehensive Psychiatry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">https://doi.org/10.1016/j.comppsych.2024.152479</a>","short":"C. Beyer, C. Currin, T. Williams, D.J. Stein, Comprehensive Psychiatry 132 (2024).","ieee":"C. Beyer, C. Currin, T. Williams, and D. J. Stein, “Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder,” <i>Comprehensive Psychiatry</i>, vol. 132. Elsevier, 2024."},"publication_status":"published","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"year":"2024","researchdata_availability":"no","volume":132,"doi":"10.1016/j.comppsych.2024.152479","OA_type":"gold","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","quality_controlled":"1","publisher":"Elsevier","status":"public","title":"Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder","abstract":[{"text":"Background: Benzodiazepines and antidepressants are effective agents for the treatment of generalized anxiety disorder (GAD), with the HAM-A frequently used as a primary outcome measure. The GAD literature is inconsistent regarding which medications are more effective for somatic versus psychic symptoms of GAD, and treatment guidelines do not advocate for prescribing based on subtype. This meta-analysis aimed to determine whether benzodiazepines and antidepressants have a differential impact on the somatic versus psychic subscales of the HAM-A in GAD.\r\n\r\nMethods: An electronic search was undertaken for randomized controlled trials of either benzodiazepines or antidepressants for GAD that reported treatment response using the HAM-A subscales. Data were extracted by independent reviewers. A random effects assessment of weighted mean difference with 95% confidence intervals and subgroup difference was applied. All analysis was done on SPSS 26. An assessment of bias, and of quality of evidence was performed.\r\n\r\nResults: 24 randomized controlled trials met the inclusion criteria: 18 antidepressant trials, 5 benzodiazepine trials and 1 of both. 14 studies were assessed as having between some and high risk of bias, while 10 were assessed as having low risk of bias. Benzodiazepines (WMD of 1.81 [CI 1.03, 2.58]) were significantly more effective than antidepressants (WMD of 0.83 [CI 0.64, 1.02]) for reducing somatic symptoms of GAD (Chi2 = 5.81, p = 0.02), and were also more effective (WMD of 2.46 [CI 1.83, 3.09]) in reducing psychic symptoms than antidepressants (WMD of 1.83 [CI 1.55, 2.10]), although this comparison did not reach statistical significance (Chi2 = 3.31, p = 0.07).\r\n\r\nConclusion: The finding that benzodiazepines were significantly more effective than antidepressants for somatic symptoms needs to be weighed up against potential benefits of antidepressants over benzodiazepines. It may be useful for future treatment guidelines for GAD to explicitly consider symptom subtype.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-04-07T22:00:55Z","article_type":"original","department":[{"_id":"TiVo"}],"DOAJ_listed":"1","_id":"15295","month":"07","publication":"Comprehensive Psychiatry","oa_version":"Published Version","intvolume":"       132","file_date_updated":"2025-01-13T10:47:20Z","das_tickbox":"0","oa":1,"isi":1,"file":[{"date_updated":"2025-01-13T10:47:20Z","file_id":"18839","success":1,"file_name":"2024_ComprehensivePsychiatry_Beyer.pdf","creator":"dernst","checksum":"aadb57448b5f170761ed72cbcc31ba16","file_size":2874425,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2025-01-13T10:47:20Z"}],"date_updated":"2026-10-21T12:00:08Z"},{"language":[{"iso":"eng"}],"date_published":"2024-02-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://cca.informatik.uni-freiburg.de/papers/FroleyksYuBiere-MBMV24.pdf"}],"publication_identifier":{"isbn":["9783800762682"]},"scopus_import":"1","author":[{"full_name":"Froleyks, Nils","first_name":"Nils","last_name":"Froleyks"},{"full_name":"Yu, Zhengqi","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","last_name":"Yu","orcid":"0000-0002-4993-773X"},{"last_name":"Biere","full_name":"Biere, Armin","first_name":"Armin"}],"page":"148-151","supplementarymaterial":"unclear","type":"conference","article_processing_charge":"No","day":"01","ec_funded":1,"_id":"17053","conference":{"start_date":"2024-02-14","name":"MBMV: Methods and Description Languages for Modeling and Verification of Circuits and Systems","end_date":"2024-02-15","location":"Kaiserslautern, Germany"},"month":"02","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-05-26T22:00:58Z","department":[{"_id":"ToHe"}],"das_tickbox":"1","date_updated":"2026-10-21T12:01:13Z","oa":1,"publication":"27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems","oa_version":"Submitted Version","OA_type":"green","OA_place":"repository","citation":{"chicago":"Froleyks, Nils, Emily Yu, and Armin Biere. “Ternary Simulation as Abstract Interpretation (Work in Progress).” In <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, 148–51. VDE Verlag, 2024.","apa":"Froleyks, N., Yu, E., &#38; Biere, A. (2024). Ternary simulation as abstract interpretation (Work in Progress). In <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i> (pp. 148–151). Kaiserslautern, Germany: VDE Verlag.","short":"N. Froleyks, E. Yu, A. Biere, in:, 27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems, VDE Verlag, 2024, pp. 148–151.","ieee":"N. Froleyks, E. Yu, and A. Biere, “Ternary simulation as abstract interpretation (Work in Progress),” in <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, Kaiserslautern, Germany, 2024, pp. 148–151.","ista":"Froleyks N, Yu E, Biere A. 2024. Ternary simulation as abstract interpretation (Work in Progress). 27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems. MBMV: Methods and Description Languages for Modeling and Verification of Circuits and Systems, 148–151.","ama":"Froleyks N, Yu E, Biere A. Ternary simulation as abstract interpretation (Work in Progress). In: <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>. VDE Verlag; 2024:148-151.","mla":"Froleyks, Nils, et al. “Ternary Simulation as Abstract Interpretation (Work in Progress).” <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, VDE Verlag, 2024, pp. 148–51."},"publication_status":"published","year":"2024","researchdata_availability":"unclear","acknowledgement":"This work is supported by the Austrian Science Fund (FWF) under the project W1255-N23, the LIT AI Lab funded by the State of Upper Austria, the ERC-2020-AdG 101020093 and by a gift from Intel Corporation.","abstract":[{"lang":"eng","text":"We introduce a formalization of ternary simulation as abstract interpretation along with a widening operator to speed up convergence. With the same goal, we present a subsumption algorithm that can determine termination earlier than the usual approach using hash sets. Additionally, we introduce a narrowing operator that utilizes recent advances in backbone extraction, allowing to increase the overapproximation precision in simulation at any time. The experiments evaluate the presented techniques in the context of hardware model checking."}],"title":"Ternary simulation as abstract interpretation (Work in Progress)","quality_controlled":"1","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publisher":"VDE Verlag"},{"oa":1,"date_updated":"2026-10-21T11:57:09Z","related_material":{"record":[{"status":"public","id":"17886","relation":"used_in_publication"}]},"date_published":"2024-05-01T00:00:00Z","oa_version":"None","month":"05","fulldoi":"https://doi.org/10.6084/m9.figshare.24527848","ddc":["570"],"_id":"23182","department":[{"_id":"TiVo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2026-10-21T11:57:04Z","title":"Supplementary Material for the article entitled \"The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks\"","abstract":[{"lang":"eng","text":"This online resource contains the simulation data and program codes required for reproducing all results of the study described in the article, and Supplementary Figures and Videos."}],"article_processing_charge":"No","type":"research_data_reference","day":"01","publisher":"Figshare","status":"public","OA_type":"green","author":[{"last_name":"Zendrikov","first_name":"Dmitrii","full_name":"Zendrikov, Dmitrii"},{"full_name":"Paraskevov, Alexander","first_name":"Alexander","last_name":"Paraskevov"}],"doi":"10.6084/m9.figshare.24527848","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.24527848","open_access":"1"}],"year":"2024","OA_place":"repository","citation":{"ista":"Zendrikov D, Paraskevov A. 2024. Supplementary Material for the article entitled ‘The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks’, Figshare, <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>.","ama":"Zendrikov D, Paraskevov A. Supplementary Material for the article entitled “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.” 2024. doi:<a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>","mla":"Zendrikov, Dmitrii, and Alexander Paraskevov. <i>Supplementary Material for the Article Entitled “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.”</i> Figshare, 2024, doi:<a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>.","chicago":"Zendrikov, Dmitrii, and Alexander Paraskevov. “Supplementary Material for the Article Entitled ‘The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.’” Figshare, 2024. <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">https://doi.org/10.6084/m9.figshare.24527848</a>.","apa":"Zendrikov, D., &#38; Paraskevov, A. (2024). Supplementary Material for the article entitled “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.” Figshare. <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">https://doi.org/10.6084/m9.figshare.24527848</a>","short":"D. Zendrikov, A. Paraskevov, (2024).","ieee":"D. Zendrikov and A. Paraskevov, “Supplementary Material for the article entitled ‘The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.’” Figshare, 2024."}},{"day":"01","article_processing_charge":"Yes","type":"conference","supplementarymaterial":"no","corr_author":"1","article_number":"8","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475"}],"scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"arxiv":1,"alternative_title":["LIPIcs"],"external_id":{"isi":["001556847400008"],"arxiv":["2407.06288"]},"date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"ddc":["000"],"fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8","has_accepted_license":"1","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"quality_controlled":"1","title":"Bidding games with charging","abstract":[{"text":"Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to pre-determined rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite path (aka play) traversed by the token from a given initial position. In bidding games, the players initially get some monetary budgets which they need to use to bid for the privilege of moving the token at each step. Each round of bidding affects the players' available budgets, which is the only form of update that the budgets experience. We introduce bidding games with charging where the players can additionally improve their budgets during the game by collecting vertex-dependent monetary rewards, aka the \"charges.\" Unlike traditional bidding games (where all charges are zero), bidding games with charging allow non-trivial recurrent behaviors. For example, a reachability objective may require multiple detours to vertices with high charges to earn additional budget. We show that, nonetheless, the central property of traditional bidding games generalizes to bidding games with charging: For each vertex there exists a threshold ratio, which is the necessary and sufficient fraction of the total budget for winning the game from that vertex. While the thresholds of traditional bidding games correspond to unique fixed points of linear systems of equations, in games with charging, these fixed points are no longer unique. This significantly complicates the proof of existence and the algorithmic computation of thresholds for infinite-duration objectives. We also provide the lower complexity bounds for computing thresholds for Rabin and Streett objectives, which are the first known lower bounds in any form of bidding games (with or without charging), and we solve the following repair problem for safety and reachability games that have unsatisfiable objectives: Can we distribute a given amount of charge to the players in a way such that the objective can be satisfied?","lang":"eng"}],"acknowledgement":"This work was supported in part by the ERC projects ERC-2020-AdG 101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":311,"year":"2024","researchdata_availability":"no","citation":{"short":"G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","chicago":"Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>.","apa":"Avni, G., Goharshady, E. K., Henzinger, T. A., &#38; Mallik, K. (2024). Bidding games with charging. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>","ama":"Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>","mla":"Avni, Guy, et al. “Bidding Games with Charging.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>.","ista":"Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 8."},"publication_status":"published","doi":"10.4230/LIPIcs.CONCUR.2024.8","file_date_updated":"2024-09-17T09:35:03Z","intvolume":"       311","oa_version":"Published Version","publication":"35th International Conference on Concurrency Theory","date_updated":"2026-10-21T12:17:18Z","isi":1,"file":[{"file_name":"2024_LIPICS_Avni.pdf","creator":"dernst","success":1,"file_id":"18083","date_updated":"2024-09-17T09:35:03Z","access_level":"open_access","date_created":"2024-09-17T09:35:03Z","content_type":"application/pdf","checksum":"cb6f2254b84922cd7bf224f550b73f4a","file_size":854430,"relation":"main_file"}],"oa":1,"das_tickbox":"0","department":[{"_id":"ToHe"}],"date_created":"2024-09-15T22:01:39Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","ec_funded":1,"_id":"18066","conference":{"location":"Calgary, Canada","name":"CONCUR: Conference on Concurrency Theory","end_date":"2024-09-13","start_date":"2024-09-09"}},{"day":"01","article_processing_charge":"No","type":"conference","supplementarymaterial":"no","article_number":"12","corr_author":"1","author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Lehtinen","first_name":"Karoliina","full_name":"Lehtinen, Karoliina"},{"last_name":"Prakash","full_name":"Prakash, Aditya","first_name":"Aditya"}],"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"scopus_import":"1","arxiv":1,"external_id":{"isi":["001556847400012"],"arxiv":["2407.08620"]},"alternative_title":["LIPIcs"],"date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12","ddc":["000"],"has_accepted_license":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","quality_controlled":"1","abstract":[{"text":"An automaton 𝒜 is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis problems. An automaton 𝒜 is guidable with respect to a class C of automata if it can fairly simulate every automaton in C, whose language is contained in that of 𝒜. In other words, guidable automata are those for which inclusion and simulation coincide, making them particularly interesting for model-checking. We study the connection between these two notions, and specifically the question of when they coincide. For classes of automata on which they do, deciding guidability, an otherwise challenging decision problem, reduces to deciding history-determinism, a problem that is starting to be well-understood for many classes. We provide a selection of sufficient criteria for a class of automata to guarantee the coincidence of the notions, and use them to show that the notions coincide for the most common automata classes, among which are ω-regular automata and many infinite-state automata with safety and reachability acceptance conditions, including vector addition systems with states, one-counter nets, pushdown-, Parikh-, and timed-automata. We also demonstrate that history-determinism and guidability do not always coincide, for example, for the classes of timed automata with a fixed number of clocks.","lang":"eng"}],"title":"History-determinism vs fair simulation","acknowledgement":"Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A. Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya Prakash: Chancellors’ International Scholarship from the University of Warwick and Centre for Discrete Mathematics and Its Applications (DIMAP)","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2024","volume":311,"researchdata_availability":"no","citation":{"apa":"Boker, U., Henzinger, T. A., Lehtinen, K., &#38; Prakash, A. (2024). History-determinism vs fair simulation. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>","chicago":"Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>.","ieee":"U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism vs fair simulation,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","short":"U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs fair simulation. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 12.","mla":"Boker, Udi, et al. “History-Determinism vs Fair Simulation.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>.","ama":"Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>"},"publication_status":"published","doi":"10.4230/LIPIcs.CONCUR.2024.12","intvolume":"       311","file_date_updated":"2024-09-17T07:31:18Z","oa_version":"Published Version","publication":"35th International Conference on Concurrency Theory","oa":1,"date_updated":"2026-10-21T12:17:34Z","file":[{"file_size":766902,"checksum":"66db11ef8e600a434079c278050c3f09","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2024-09-17T07:31:18Z","date_updated":"2024-09-17T07:31:18Z","file_id":"18080","success":1,"creator":"dernst","file_name":"2024_LIPICS_Boker.pdf"}],"isi":1,"das_tickbox":"0","department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-15T22:01:40Z","month":"09","conference":{"start_date":"2024-09-09","name":"CONCUR: Conference on Concurrency Theory","end_date":"2024-09-13","location":"Calgary, Canada"},"ec_funded":1,"_id":"18067"},{"doi":"10.1007/978-3-031-57256-2_8","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2024","researchdata_availability":"no","volume":14572,"citation":{"ista":"Avni G, Mallik K, Sadhukhan S. 2024. Auction-based scheduling. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 153–172.","ama":"Avni G, Mallik K, Sadhukhan S. Auction-based scheduling. In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:153-172. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>","mla":"Avni, Guy, et al. “Auction-Based Scheduling.” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 153–72, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>.","chicago":"Avni, Guy, Kaushik Mallik, and Suman Sadhukhan. “Auction-Based Scheduling.” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:153–72. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>.","apa":"Avni, G., Mallik, K., &#38; Sadhukhan, S. (2024). Auction-based scheduling. In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 153–172). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>","short":"G. Avni, K. Mallik, S. Sadhukhan, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 153–172.","ieee":"G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172."},"publication_status":"published","title":"Auction-based scheduling","abstract":[{"lang":"eng","text":"Sequential decision-making tasks often require satisfaction of multiple, partially-contradictory objectives. Existing approaches are monolithic, where a single policy fulfills all objectives. We present auction-based scheduling, a decentralized framework for multi-objective sequential decision making. Each objective is fulfilled using a separate and independent policy. Composition of policies is performed at runtime, where at each step, the policies simultaneously bid from pre-allocated budgets for the privilege of choosing the next action. The framework allows policies to be independently created, modified, and replaced. We study path planning problems on finite graphs with two temporal objectives and present algorithms to synthesize policies together with bidding policies in a decentralized manner. We consider three categories of decentralized synthesis problems, parameterized by the assumptions that the policies make on each other. We identify a class of assumptions called assume-admissible for which synthesis is always possible for graphs whose every vertex has at most two outgoing edges."}],"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and by ISF grant no. 1679/21.","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publisher":"Springer Nature","status":"public","quality_controlled":"1","month":"04","conference":{"start_date":"2024-04-06","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2024-04-11","location":"Luxembourg City, Luxembourg"},"ec_funded":1,"_id":"15376","department":[{"_id":"ToHe"}],"date_created":"2024-05-12T22:01:02Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"file":[{"date_created":"2024-05-22T07:09:24Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"dbeb123510997886d11925aedbf9c400","file_size":508191,"creator":"dernst","file_name":"2024_LNCS_Avni.pdf","success":1,"date_updated":"2024-05-22T07:09:24Z","file_id":"15414"}],"date_updated":"2026-10-21T12:16:28Z","isi":1,"das_tickbox":"0","intvolume":"     14572","file_date_updated":"2024-05-22T07:09:24Z","publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","oa_version":"Published Version","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"orcid":"0000-0001-9864-7475","last_name":"Mallik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik"},{"full_name":"Sadhukhan, Suman","first_name":"Suman","last_name":"Sadhukhan"}],"scopus_import":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031572555"],"eissn":["1611-3349"]},"supplementarymaterial":"no","page":"153-172","corr_author":"1","article_processing_charge":"Yes (in subscription journal)","type":"conference","day":"05","fulldoi":"https://doi.org/10.1007/978-3-031-57256-2_8","ddc":["000"],"has_accepted_license":"1","language":[{"iso":"eng"}],"arxiv":1,"alternative_title":["LNCS"],"date_published":"2024-04-05T00:00:00Z","external_id":{"arxiv":["2310.11798"],"isi":["001284187100008"]}},{"article_processing_charge":"Yes (in subscription journal)","type":"conference","day":"01","author":[{"last_name":"Froleyks","full_name":"Froleyks, Nils","first_name":"Nils"},{"orcid":"0000-0002-4993-773X","last_name":"Yu","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi","full_name":"Yu, Zhengqi"},{"first_name":"Armin","full_name":"Biere, Armin","last_name":"Biere"},{"full_name":"Heljanko, Keijo","first_name":"Keijo","last_name":"Heljanko"}],"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031634970"],"issn":["0302-9743"]},"supplementarymaterial":"no","page":"284-303","language":[{"iso":"eng"}],"arxiv":1,"date_published":"2024-07-01T00:00:00Z","external_id":{"arxiv":["2405.04297"],"isi":["001273489700017"]},"alternative_title":["LNCS"],"ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-031-63498-7_17","has_accepted_license":"1","title":"Certifying phase abstraction","abstract":[{"lang":"eng","text":"Certification helps to increase trust in formal verification of safety-critical systems which require assurance on their correctness. In hardware model checking, a widely used formal verification technique, phase abstraction is considered one of the most commonly used preprocessing techniques. We present an approach to certify an extended form of phase abstraction using a generic certificate format. As in earlier works our approach involves constructing a witness circuit with an inductive invariant property that certifies the correctness of the entire model checking process, which is then validated by an independent certificate checker. We have implemented and evaluated the proposed approach including certification for various preprocessing configurations on hardware model checking competition benchmarks. As an improvement on previous work in this area, the proposed method is able to efficiently complete certification with an overhead of a fraction of model checking time."}],"acknowledgement":"This work is supported by the Austrian Science Fund (FWF) under the project W1255-N23, the LIT AI Lab funded by the State of Upper Austria, the ERC-2020-AdG 101020093, the Academy of Finland under the project 336092 and by a gift from Intel Corporation.","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"publisher":"Springer Nature","quality_controlled":"1","doi":"10.1007/978-3-031-63498-7_17","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":14739,"year":"2024","researchdata_availability":"no","citation":{"ieee":"N. Froleyks, E. Yu, A. Biere, and K. Heljanko, “Certifying phase abstraction,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Nancy, France, 2024, vol. 14739, pp. 284–303.","short":"N. Froleyks, E. Yu, A. Biere, K. Heljanko, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 284–303.","apa":"Froleyks, N., Yu, E., Biere, A., &#38; Heljanko, K. (2024). Certifying phase abstraction. In <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 14739, pp. 284–303). Nancy, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">https://doi.org/10.1007/978-3-031-63498-7_17</a>","chicago":"Froleyks, Nils, Emily Yu, Armin Biere, and Keijo Heljanko. “Certifying Phase Abstraction.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, 14739:284–303. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">https://doi.org/10.1007/978-3-031-63498-7_17</a>.","mla":"Froleyks, Nils, et al. “Certifying Phase Abstraction.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 14739, Springer Nature, 2024, pp. 284–303, doi:<a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">10.1007/978-3-031-63498-7_17</a>.","ama":"Froleyks N, Yu E, Biere A, Heljanko K. Certifying phase abstraction. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 14739. Springer Nature; 2024:284-303. doi:<a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">10.1007/978-3-031-63498-7_17</a>","ista":"Froleyks N, Yu E, Biere A, Heljanko K. 2024. Certifying phase abstraction. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 14739, 284–303."},"publication_status":"published","file":[{"checksum":"7d7839fc8c5c680ea3ac09f40a66e55d","file_size":556902,"relation":"main_file","access_level":"open_access","date_created":"2024-08-12T06:53:39Z","content_type":"application/pdf","success":1,"date_updated":"2024-08-12T06:53:39Z","file_id":"17414","creator":"dernst","file_name":"2024_LNCS_Froleyks.pdf"}],"isi":1,"date_updated":"2026-10-21T12:03:11Z","oa":1,"das_tickbox":"0","file_date_updated":"2024-08-12T06:53:39Z","intvolume":"     14739","oa_version":"Published Version","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","month":"07","ec_funded":1,"_id":"17413","conference":{"location":"Nancy, France","end_date":"2024-07-06","name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2024-07-03"},"department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-08-11T22:01:13Z"},{"status":"public","publisher":"Springer Nature","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","title":"Bubaak-SpLit: Split what you cannot verify (Competition contribution)","abstract":[{"lang":"eng","text":"BUBAAK-SpLit is a tool for dynamically splitting verification tasks into parts that can then be analyzed in parallel. It is built on top of BUBAAK, a tool designed for running combinations of verifiers in parallel. In contrast to BUBAAK, that directly invokes verifiers on the inputs, BUBAAK-SpLit first starts by splitting the input program into multiple modified versions called program splits. During the splitting process, BUBAAK-SpLit utilizes a weak verifier (in our case symbolic execution with a short timelimit) to analyze each generated program split. If the weak verifier fails on a program split, we split this program split again and start the verification process again on the generated program splits. We run the splitting process until a predefined number of hard-to-verify program splits is generated or a splitting limit is reached. During the main verification phase, we run a combination of BUBAAK-LEE and SLOWBEAST in parallel on the remaining unsolved parts of the verification task."}],"acknowledgement":"This work was partially supported by the ERC-2020-AdG 10102009 grant.","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":14572,"researchdata_availability":"yes","year":"2024","publication_status":"published","citation":{"mla":"Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 353–358, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">10.1007/978-3-031-57256-2_20</a>.","ama":"Chalupa M, Richter C. Bubaak-SpLit: Split what you cannot verify (Competition contribution). In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:353–358. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">10.1007/978-3-031-57256-2_20</a>","ista":"Chalupa M, Richter C. 2024. Bubaak-SpLit: Split what you cannot verify (Competition contribution). 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 353–358.","ieee":"M. Chalupa and C. Richter, “Bubaak-SpLit: Split what you cannot verify (Competition contribution),” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 353–358.","short":"M. Chalupa, C. Richter, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 353–358.","apa":"Chalupa, M., &#38; Richter, C. (2024). Bubaak-SpLit: Split what you cannot verify (Competition contribution). In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 353–358). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">https://doi.org/10.1007/978-3-031-57256-2_20</a>","chicago":"Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:353–358. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">https://doi.org/10.1007/978-3-031-57256-2_20</a>."},"doi":"10.1007/978-3-031-57256-2_20","file_date_updated":"2024-04-26T11:27:26Z","intvolume":"     14572","oa_version":"Published Version","publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","file":[{"creator":"cchlebak","file_name":"2024_LNCS_Chalupa.pdf","date_updated":"2024-04-26T11:27:26Z","file_id":"15347","success":1,"access_level":"open_access","content_type":"application/pdf","date_created":"2024-04-26T11:27:26Z","file_size":577128,"checksum":"208c855c60824bec936b8d01d0396474","relation":"main_file"}],"isi":1,"date_updated":"2026-10-21T12:12:16Z","oa":1,"das_tickbox":"1","related_material":{"record":[{"relation":"research_data","id":"23183","status":"public"}]},"department":[{"_id":"ToHe"}],"date_created":"2024-04-20T18:14:06Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","dataavailabilitystatement":"The submitted version of our tool contribution is archived and available at Zenodo [2] https://zenodo.org/records/10202207. The source code is also available on GitLab [3] https://gitlab.com/mchalupa/bubaak","month":"04","ec_funded":1,"_id":"15333","conference":{"start_date":"2024-04-06","location":"Luxembourg City, Luxembourg","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2024-04-11"},"day":"05","article_processing_charge":"Yes (in subscription journal)","type":"conference","supplementarymaterial":"no","page":"353–358","corr_author":"1","author":[{"last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"first_name":"Cedric","full_name":"Richter, Cedric","last_name":"Richter"}],"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031572562"],"eissn":["1611-3349"],"isbn":["9783031572555"]},"scopus_import":"1","alternative_title":["LNCS"],"date_published":"2024-04-05T00:00:00Z","external_id":{"isi":["001284187100020"]},"language":[{"iso":"eng"}],"ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-031-57256-2_20","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"arxiv":1,"alternative_title":["LNCS"],"external_id":{"isi":["001284187100011"],"arxiv":["2401.07548"]},"date_published":"2024-04-06T00:00:00Z","ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-031-57256-2_11","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","type":"conference","day":"06","author":[{"full_name":"Majumdar, Rupak","first_name":"Rupak","last_name":"Majumdar"},{"first_name":"Irmak","full_name":"Sağlam, Irmak","last_name":"Sağlam"},{"last_name":"Thejaswini","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031572555"],"eissn":["1611-3349"]},"scopus_import":"1","supplementarymaterial":"no","page":"213-231","corr_author":"1","date_updated":"2026-10-21T12:16:56Z","file":[{"creator":"dernst","file_name":"2024_LNCS_Majumdar.pdf","success":1,"file_id":"15415","date_updated":"2024-05-22T07:24:45Z","access_level":"open_access","date_created":"2024-05-22T07:24:45Z","content_type":"application/pdf","file_size":462173,"checksum":"492be74f69cd6ea42d38681082d0b521","relation":"main_file"}],"isi":1,"oa":1,"das_tickbox":"0","file_date_updated":"2024-05-22T07:24:45Z","intvolume":"     14572","oa_version":"Published Version","publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","month":"04","_id":"15377","ec_funded":1,"department":[{"_id":"ToHe"}],"date_created":"2024-05-12T22:01:02Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"We provide an algorithmto solve Rabin and Streett games over graphs\r\nwith n vertices,m edges, and k colours that runs in ˜O³mn(k!)1+o(1)´time and\r\nO(nk logk logn) space, where ˜O hides poly-logarithmic factors. Our algorithm\r\nis an improvement by a super quadratic dependence on k! from the currently\r\nbest known run time of O³mn2(k!)2+o(1)´, obtained by converting a Rabin\r\ngameinto a parity game,while simultaneously improving its exponential space\r\nrequirement.\r\nOur main technical ingredient is a characterisation of progress measures for\r\nRabin games using colourful trees and a combinatorial construction of succinctlyrepresented,\r\nuniversal colourful trees. Colourful universal trees are generalisations\r\nof universal trees used by Jurdzi´nski and Lazi´c (2017) to solve parity\r\ngames, as well as of Rabin progress measures of Klarlund and Kozen (1991).\r\nOur algorithm for Rabin games is a progress measure lifting algorithm where\r\nthe lifting is performed on succinct, colourful, universal trees.","lang":"eng"}],"title":"Rabin games and colourful universal trees","acknowledgement":"This work is a part of the project VAMOS that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant agreements No 101020093. Rupak Majumdar was partially supported by the DFG project 389792660 TRR 248-CPEC.","status":"public","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Springer Nature","quality_controlled":"1","doi":"10.1007/978-3-031-57256-2_11","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"researchdata_availability":"no","volume":14572,"year":"2024","publication_status":"published","citation":{"short":"R. Majumdar, I. Sağlam, K.S. Thejaswini, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 213–231.","ieee":"R. Majumdar, I. Sağlam, and K. S. Thejaswini, “Rabin games and colourful universal trees,” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 2024, vol. 14572, pp. 213–231.","chicago":"Majumdar, Rupak, Irmak Sağlam, and K. S. Thejaswini. “Rabin Games and Colourful Universal Trees.” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:213–31. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_11\">https://doi.org/10.1007/978-3-031-57256-2_11</a>.","apa":"Majumdar, R., Sağlam, I., &#38; Thejaswini, K. S. (2024). Rabin games and colourful universal trees. In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 213–231). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_11\">https://doi.org/10.1007/978-3-031-57256-2_11</a>","ama":"Majumdar R, Sağlam I, Thejaswini KS. Rabin games and colourful universal trees. In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:213-231. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_11\">10.1007/978-3-031-57256-2_11</a>","mla":"Majumdar, Rupak, et al. “Rabin Games and Colourful Universal Trees.” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 213–31, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_11\">10.1007/978-3-031-57256-2_11</a>.","ista":"Majumdar R, Sağlam I, Thejaswini KS. 2024. Rabin games and colourful universal trees. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. , LNCS, vol. 14572, 213–231."}},{"_id":"17898","ec_funded":1,"conference":{"start_date":"2024-05-13","location":"Yokohama, Japan","name":"ICRA: International Conference on Robotics and Automation","end_date":"2024-05-17"},"month":"08","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-08T22:01:13Z","department":[{"_id":"ToHe"}],"das_tickbox":"0","date_updated":"2026-10-21T12:03:35Z","isi":1,"publication":"Proceedings of the 2024 IEEE International Conference on Robotics and Automation","oa_version":"None","doi":"10.1109/ICRA57147.2024.10610284","citation":{"short":"M. Lechner, R. Hasani, A. Amini, T.H. Wang, T.A. Henzinger, D. Rus, in:, Proceedings of the 2024 IEEE International Conference on Robotics and Automation, IEEE, 2024, pp. 2774–2782.","ieee":"M. Lechner, R. Hasani, A. Amini, T. H. Wang, T. A. Henzinger, and D. Rus, “Overparametrization helps offline-to-online generalization of closed-loop control from pixels,” in <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, Yokohama, Japan, 2024, pp. 2774–2782.","chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Tsun Hsuan Wang, Thomas A Henzinger, and Daniela Rus. “Overparametrization Helps Offline-to-Online Generalization of Closed-Loop Control from Pixels.” In <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, 2774–82. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">https://doi.org/10.1109/ICRA57147.2024.10610284</a>.","apa":"Lechner, M., Hasani, R., Amini, A., Wang, T. H., Henzinger, T. A., &#38; Rus, D. (2024). Overparametrization helps offline-to-online generalization of closed-loop control from pixels. In <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i> (pp. 2774–2782). Yokohama, Japan: IEEE. <a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">https://doi.org/10.1109/ICRA57147.2024.10610284</a>","ama":"Lechner M, Hasani R, Amini A, Wang TH, Henzinger TA, Rus D. Overparametrization helps offline-to-online generalization of closed-loop control from pixels. In: <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>. IEEE; 2024:2774-2782. doi:<a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">10.1109/ICRA57147.2024.10610284</a>","mla":"Lechner, Mathias, et al. “Overparametrization Helps Offline-to-Online Generalization of Closed-Loop Control from Pixels.” <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, IEEE, 2024, pp. 2774–82, doi:<a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">10.1109/ICRA57147.2024.10610284</a>.","ista":"Lechner M, Hasani R, Amini A, Wang TH, Henzinger TA, Rus D. 2024. Overparametrization helps offline-to-online generalization of closed-loop control from pixels. Proceedings of the 2024 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 2774–2782."},"publication_status":"published","researchdata_availability":"no","year":"2024","acknowledgement":"This work was partially supported in parts by the ERC-2020-AdG 101020093. Additionally, it was partially sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. This work was further supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830.","abstract":[{"text":"There is an ever-growing zoo of modern neural network models that can efficiently learn end-to-end control from visual observations. These advanced deep models, ranging from convolutional to Vision Transformers, from small to gigantic networks, have been extensively tested on offline image classification tasks. In this paper, we study these vision models with respect to the open-loop training to closed-loop generalization abilities, i.e., deployment realizes a causal feedback loop that is not present during training. This causality gap typically emerges in robotics applications such as autonomous driving, where a network is trained to imitate the control commands of a human. In this setting, two situations arise: 1) Closed-loop testing in-distribution, where the test environment shares properties with those of offline training data. 2) Closed-loop testing under distribution shifts and out-of-distribution. Contrary to recently reported results, we show that under proper training guidelines, all vision architectures perform indistinguishably well on in-distribution deployment, resolving the causality gap. In situation 2, We observe that scale is the strongest factor in improving closed-loop generalization regardless of the choice of the model architecture. Our results predict the trend that in the future we will see larger and larger models being used in offline-training-online-deployment imitation learning tasks in robotic applications.","lang":"eng"}],"title":"Overparametrization helps offline-to-online generalization of closed-loop control from pixels","quality_controlled":"1","status":"public","publisher":"IEEE","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"fulldoi":"https://doi.org/10.1109/ICRA57147.2024.10610284","language":[{"iso":"eng"}],"date_published":"2024-08-08T00:00:00Z","external_id":{"isi":["001294576202044"]},"scopus_import":"1","publication_identifier":{"isbn":["9798350384574"],"issn":["1050-4729"]},"author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"full_name":"Wang, Tsun Hsuan","first_name":"Tsun Hsuan","last_name":"Wang"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"page":"2774-2782","supplementarymaterial":"no","type":"conference","article_processing_charge":"No","day":"08"},{"ddc":["000"],"fulldoi":"https://doi.org/10.1609/aaai.v38i9.28943","date_published":"2024-03-25T00:00:00Z","language":[{"iso":"eng"}],"page":"10714-10722","supplementarymaterial":"yes","main_file_link":[{"url":"https://amu.hal.science/hal-04523118/","open_access":"1"}],"scopus_import":"1","publication_identifier":{"issn":["2159-5399"],"isbn":["1577358872"],"eissn":["2374-3468"]},"author":[{"last_name":"Trinh","full_name":"Trinh, Giang","first_name":"Giang"},{"full_name":"Benhamou, Belaid","first_name":"Belaid","last_name":"Benhamou"},{"orcid":"0000-0003-1993-0331","last_name":"Pastva","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","first_name":"Samuel","full_name":"Pastva, Samuel"},{"last_name":"Soliman","first_name":"Sylvain","full_name":"Soliman, Sylvain"}],"day":"25","type":"conference","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-04-14T22:01:02Z","department":[{"_id":"ToHe"}],"ec_funded":1,"_id":"15321","month":"03","oa_version":"Published Version","publication":"Proceedings of the 38th AAAI Conference on Artificial Intelligence","intvolume":"        38","das_tickbox":"0","date_updated":"2026-10-21T12:04:20Z","oa":1,"citation":{"ieee":"G. Trinh, B. Benhamou, S. Pastva, and S. Soliman, “Scalable enumeration of trap spaces in boolean networks via answer set programming,” in <i>Proceedings of the 38th AAAI Conference on Artificial Intelligence</i>, 2024, vol. 38, no. 9, pp. 10714–10722.","short":"G. Trinh, B. Benhamou, S. Pastva, S. Soliman, in:, Proceedings of the 38th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2024, pp. 10714–10722.","apa":"Trinh, G., Benhamou, B., Pastva, S., &#38; Soliman, S. (2024). Scalable enumeration of trap spaces in boolean networks via answer set programming. In <i>Proceedings of the 38th AAAI Conference on Artificial Intelligence</i> (Vol. 38, pp. 10714–10722). Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v38i9.28943\">https://doi.org/10.1609/aaai.v38i9.28943</a>","chicago":"Trinh, Giang, Belaid Benhamou, Samuel Pastva, and Sylvain Soliman. “Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming.” In <i>Proceedings of the 38th AAAI Conference on Artificial Intelligence</i>, 38:10714–22. Association for the Advancement of Artificial Intelligence, 2024. <a href=\"https://doi.org/10.1609/aaai.v38i9.28943\">https://doi.org/10.1609/aaai.v38i9.28943</a>.","mla":"Trinh, Giang, et al. “Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming.” <i>Proceedings of the 38th AAAI Conference on Artificial Intelligence</i>, vol. 38, no. 9, Association for the Advancement of Artificial Intelligence, 2024, pp. 10714–22, doi:<a href=\"https://doi.org/10.1609/aaai.v38i9.28943\">10.1609/aaai.v38i9.28943</a>.","ama":"Trinh G, Benhamou B, Pastva S, Soliman S. Scalable enumeration of trap spaces in boolean networks via answer set programming. In: <i>Proceedings of the 38th AAAI Conference on Artificial Intelligence</i>. Vol 38. Association for the Advancement of Artificial Intelligence; 2024:10714-10722. doi:<a href=\"https://doi.org/10.1609/aaai.v38i9.28943\">10.1609/aaai.v38i9.28943</a>","ista":"Trinh G, Benhamou B, Pastva S, Soliman S. 2024. Scalable enumeration of trap spaces in boolean networks via answer set programming. Proceedings of the 38th AAAI Conference on Artificial Intelligence. vol. 38, 10714–10722."},"publication_status":"published","researchdata_availability":"yes (supplementary data)","year":"2024","volume":38,"doi":"10.1609/aaai.v38i9.28943","quality_controlled":"1","issue":"9","status":"public","publisher":"Association for the Advancement of Artificial Intelligence","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"acknowledgement":"This work was supported by Institut Carnot STAR, Marseille, France and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","title":"Scalable enumeration of trap spaces in boolean networks via answer set programming","abstract":[{"lang":"eng","text":"Boolean Networks (BNs) are widely used as a modeling formalism in several domains, notably systems biology and computer science. A fundamental problem in BN analysis is the enumeration of trap spaces, which are hypercubes in the state space that cannot be escaped once entered. Several methods have been proposed for enumerating trap spaces, however they often suffer from scalability and efficiency issues, particularly for large and complex models. To our knowledge, the most efficient and recent methods for the trap space enumeration all rely on Answer Set Programming (ASP), which has been widely applied to the analysis of BNs. Motivated by these considerations, our work proposes a new method for enumerating trap spaces in BNs using ASP. We evaluate the method on a mix of 250+ real-world and 400+ randomly generated BNs, showing that it enables analysis of models beyond the capabilities of existing tools (namely pyboolnet, mpbn, trappist, and trapmvn)."}]},{"date_published":"2024-10-12T00:00:00Z","external_id":{"isi":["001420093700018"],"arxiv":["2408.05033"]},"alternative_title":["LNCS"],"arxiv":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/978-3-031-74234-7_18","ddc":["000"],"day":"12","type":"conference","article_processing_charge":"Yes (in subscription journal)","corr_author":"1","page":"282-301","supplementarymaterial":"no","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031742330"]},"scopus_import":"1","author":[{"first_name":"Borzoo","full_name":"Bonakdarpour, Borzoo","last_name":"Bonakdarpour"},{"first_name":"Anik","full_name":"Momtaz, Anik","last_name":"Momtaz"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"publication":"24th International Conference on Runtime Verification","oa_version":"Published Version","intvolume":"     15191","file_date_updated":"2024-11-11T09:42:28Z","das_tickbox":"0","oa":1,"date_updated":"2026-10-21T13:14:54Z","file":[{"file_size":1897101,"checksum":"7b8ca21b8c19ab796fa445b0e54003ca","relation":"main_file","access_level":"open_access","date_created":"2024-11-11T09:42:28Z","content_type":"application/pdf","success":1,"date_updated":"2024-11-11T09:42:28Z","file_id":"18539","file_name":"2024_LNCS_Bonakdarpour.pdf","creator":"dernst"}],"isi":1,"date_created":"2024-11-10T23:01:58Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","APC_amount":"2748 EUR","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"conference":{"end_date":"2024-10-17","name":"RV: Conference on Runtime Verification","location":"Istanbul, Turkey","start_date":"2024-10-15"},"ec_funded":1,"_id":"18521","month":"10","quality_controlled":"1","publisher":"Springer Nature","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. This work is sponsored in part by the United States NSF CCF-2118356 award. This research was partially funded by A-IQ Ready (Chips JU, grant agreement No. 101096658).","abstract":[{"text":"In distributed systems with processes that do not share a global clock, partial synchrony is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an approximate distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.","lang":"eng"}],"title":"Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy","citation":{"short":"B. Bonakdarpour, A. Momtaz, D. Nickovic, N.E. Sarac, in:, 24th International Conference on Runtime Verification, Springer Nature, 2024, pp. 282–301.","ieee":"B. Bonakdarpour, A. Momtaz, D. Nickovic, and N. E. Sarac, “Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy,” in <i>24th International Conference on Runtime Verification</i>, Istanbul, Turkey, 2024, vol. 15191, pp. 282–301.","chicago":"Bonakdarpour, Borzoo, Anik Momtaz, Dejan Nickovic, and Naci E Sarac. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed &#38; Accuracy.” In <i>24th International Conference on Runtime Verification</i>, 15191:282–301. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">https://doi.org/10.1007/978-3-031-74234-7_18</a>.","apa":"Bonakdarpour, B., Momtaz, A., Nickovic, D., &#38; Sarac, N. E. (2024). Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. In <i>24th International Conference on Runtime Verification</i> (Vol. 15191, pp. 282–301). Istanbul, Turkey: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">https://doi.org/10.1007/978-3-031-74234-7_18</a>","ama":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. In: <i>24th International Conference on Runtime Verification</i>. Vol 15191. Springer Nature; 2024:282-301. doi:<a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">10.1007/978-3-031-74234-7_18</a>","mla":"Bonakdarpour, Borzoo, et al. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed &#38; Accuracy.” <i>24th International Conference on Runtime Verification</i>, vol. 15191, Springer Nature, 2024, pp. 282–301, doi:<a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">10.1007/978-3-031-74234-7_18</a>.","ista":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. 2024. Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. 24th International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 15191, 282–301."},"publication_status":"published","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2024","volume":15191,"researchdata_availability":"no","doi":"10.1007/978-3-031-74234-7_18","OA_type":"hybrid"},{"day":"01","type":"conference","article_processing_charge":"Yes","article_number":"29","corr_author":"1","supplementarymaterial":"no","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"scopus_import":"1","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","full_name":"Sarac, Naci E"}],"external_id":{"arxiv":["2407.10473"],"isi":["001556847400029"]},"alternative_title":["LIPIcs"],"date_published":"2024-09-01T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29","ddc":["000"],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when this work was submitted for publication.","title":"Strategic dominance: A new preorder for nondeterministic processes","abstract":[{"lang":"eng","text":"We study the following refinement relation between nondeterministic state-transition models: model ℬ strategically dominates model 𝒜 iff every deterministic refinement of 𝒜 is language contained in some deterministic refinement of ℬ. While language containment is trace inclusion, and the (fair) simulation preorder coincides with tree inclusion, strategic dominance falls strictly between the two and can be characterized as \"strategy inclusion\" between 𝒜 and ℬ: every strategy that resolves the nondeterminism of 𝒜 is dominated by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be checked in 2-ExpTime by a decidable first-order Presburger logic with quantification over words and strategies, called resolver logic. We give several other applications of resolver logic, including checking the co-safety, co-liveness, and history-determinism of boolean and quantitative automata, and checking the inclusion between hyperproperties that are specified by nondeterministic boolean and quantitative automata."}],"citation":{"ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder for nondeterministic processes. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.","mla":"Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance: A new preorder for nondeterministic processes,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"OA_place":"publisher","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":311,"researchdata_availability":"no","year":"2024","doi":"10.4230/LIPIcs.CONCUR.2024.29","OA_type":"gold","publication":"35th International Conference on Concurrency Theory","oa_version":"Published Version","intvolume":"       311","file_date_updated":"2024-09-17T07:48:56Z","das_tickbox":"0","oa":1,"isi":1,"file":[{"success":1,"date_updated":"2024-09-17T07:48:56Z","file_id":"18081","file_name":"2024_LIPICS_Henzinger.pdf","creator":"dernst","file_size":964124,"checksum":"555bd343e1fb38adeab8fc465ff4fad8","relation":"main_file","access_level":"open_access","date_created":"2024-09-17T07:48:56Z","content_type":"application/pdf"}],"date_updated":"2026-10-21T13:15:11Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-15T22:01:40Z","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"conference":{"location":"Calgary, Canada","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory","start_date":"2024-09-09"},"_id":"18068","ec_funded":1,"month":"09"}]