[{"arxiv":1,"title":"Quantitative monitoring of Signal First-Order logic","intvolume":" 16557","day":"18","conference":{"end_date":"2026-05-22","location":"Tokyo, Japan","name":"FM: Formal Methods","start_date":"2026-05-18"},"status":"public","ec_funded":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"ddc":["000"],"month":"05","fulldoi":"https://doi.org/10.1007/978-3-032-26220-2_11","publisher":"Springer Nature","article_processing_charge":"No","_id":"22006","date_created":"2026-06-14T22:01:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-06-22T08:21:09Z","keyword":["Signal first-order logic","Robustness-based quantitative semantics","Online runtime monitoring"],"oa":1,"year":"2026","doi":"10.1007/978-3-032-26220-2_11","OA_place":"publisher","file_date_updated":"2026-06-22T08:18:41Z","citation":{"apa":"Chalupa, M., Henzinger, T. A., Sarac, N. E., & Yu, E. (2026). Quantitative monitoring of Signal First-Order logic. In 27th International Symposium on Formal Methods (Vol. 16557, pp. 214–233). Tokyo, Japan: Springer Nature. https://doi.org/10.1007/978-3-032-26220-2_11","chicago":"Chalupa, Marek, Thomas A Henzinger, Naci E Sarac, and Emily Yu. “Quantitative Monitoring of Signal First-Order Logic.” In 27th International Symposium on Formal Methods, 16557:214–33. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-26220-2_11.","mla":"Chalupa, Marek, et al. “Quantitative Monitoring of Signal First-Order Logic.” 27th International Symposium on Formal Methods, vol. 16557, Springer Nature, 2026, pp. 214–33, doi:10.1007/978-3-032-26220-2_11.","short":"M. Chalupa, T.A. Henzinger, N.E. Sarac, E. Yu, in:, 27th International Symposium on Formal Methods, Springer Nature, 2026, pp. 214–233.","ieee":"M. Chalupa, T. A. Henzinger, N. E. Sarac, and E. Yu, “Quantitative monitoring of Signal First-Order logic,” in 27th International Symposium on Formal Methods, Tokyo, Japan, 2026, vol. 16557, pp. 214–233.","ista":"Chalupa M, Henzinger TA, Sarac NE, Yu E. 2026. Quantitative monitoring of Signal First-Order logic. 27th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 16557, 214–233.","ama":"Chalupa M, Henzinger TA, Sarac NE, Yu E. Quantitative monitoring of Signal First-Order logic. In: 27th International Symposium on Formal Methods. Vol 16557. Springer Nature; 2026:214-233. doi:10.1007/978-3-032-26220-2_11"},"volume":16557,"OA_type":"hybrid","type":"conference","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412), and by the Advanced Research and Invention Agency under the Safeguarded AI programme (MSAI-PR01-P047).","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","publication_status":"published","abstract":[{"text":"Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support. We provide the first robustness-based quantitative semantics for SFO, enabling the expression and evaluation of rich real-time properties beyond the scope of existing formalisms such as Signal Temporal Logic. To enable online monitoring, we identify a past-time fragment of SFO and give a pastification procedure that transforms bounded-response SFO formulas into equisatisfiable formulas in this fragment. We then develop an efficient runtime monitoring algorithm for this past-time fragment and evaluate its performance on a set of benchmarks, demonstrating the practicality and effectiveness of our approach. To the best of our knowledge, this is the first publicly available prototype for online quantitative monitoring of full SFO.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"content_type":"application/pdf","creator":"dernst","success":1,"file_size":849237,"file_name":"2026_LNCS_Chalupa.pdf","date_created":"2026-06-22T08:18:41Z","date_updated":"2026-06-22T08:18:41Z","relation":"main_file","access_level":"open_access","file_id":"22113","checksum":"7055199ecb985e9e2e272f4988827067"}],"date_published":"2026-05-18T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["2603.00728"]},"das_tickbox":"0","publication":"27th International Symposium on Formal Methods","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032262196"]},"page":"214-233","author":[{"last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"},{"orcid":"0000-0002-4993-773X","last_name":"Yu","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi","full_name":"Yu, Zhengqi"}]},{"year":"2026","doi":"10.1145/3737447","OA_place":"publisher","file_date_updated":"2026-01-21T08:52:07Z","corr_author":"1","volume":69,"citation":{"ama":"Barrett C, Henzinger TA, Seshia SA. Certificates in AI: Learn but verify. Communications of the ACM. 2026;69(1):66-75. doi:10.1145/3737447","ista":"Barrett C, Henzinger TA, Seshia SA. 2026. Certificates in AI: Learn but verify. Communications of the ACM. 69(1), 66–75.","ieee":"C. Barrett, T. A. Henzinger, and S. A. Seshia, “Certificates in AI: Learn but verify,” Communications of the ACM, vol. 69, no. 1. Association for Computing Machinery, pp. 66–75, 2026.","short":"C. Barrett, T.A. Henzinger, S.A. Seshia, Communications of the ACM 69 (2026) 66–75.","mla":"Barrett, Clark, et al. “Certificates in AI: Learn but Verify.” Communications of the ACM, vol. 69, no. 1, Association for Computing Machinery, 2026, pp. 66–75, doi:10.1145/3737447.","chicago":"Barrett, Clark, Thomas A Henzinger, and Sanjit A. Seshia. “Certificates in AI: Learn but Verify.” Communications of the ACM. Association for Computing Machinery, 2026. https://doi.org/10.1145/3737447.","apa":"Barrett, C., Henzinger, T. A., & Seshia, S. A. (2026). Certificates in AI: Learn but verify. Communications of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3737447"},"acknowledgement":"T.A.H. thanks Đorde Žikelic for many stimulating discussions about CML. This work was supported in part by NSFCPS Frontier Grant 1545126, by a BAIR Commons project, by the Berkeley iCy-Phy Center, by the Stanford Center for Automated Reasoning, and by the ERC Advanced Grant 101020093.","OA_type":"hybrid","type":"journal_article","scopus_import":"1","department":[{"_id":"ToHe"}],"oa_version":"Published Version","has_accepted_license":"1","publication_status":"published","abstract":[{"text":"In certifiable machine learning, AI systems produce not only results but also verifiable certificates that the results can be trusted.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2026-01-01T00:00:00Z","file":[{"file_name":"2026_CommACM_Barrett.pdf","date_updated":"2026-01-21T08:52:07Z","date_created":"2026-01-21T08:52:07Z","access_level":"open_access","relation":"main_file","file_id":"21028","checksum":"d909a9091c254b2d18ba014124663f69","creator":"dernst","content_type":"application/pdf","success":1,"file_size":2623108}],"publication":"Communications of the ACM","publication_identifier":{"eissn":["1557-7317"],"issn":["0001-0782"]},"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"page":"66-75","issue":"1","author":[{"full_name":"Barrett, Clark","last_name":"Barrett","first_name":"Clark"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Seshia, Sanjit A.","first_name":"Sanjit A.","last_name":"Seshia"}],"intvolume":" 69","title":"Certificates in AI: Learn but verify","day":"01","ec_funded":1,"status":"public","article_type":"original","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","ddc":["000"],"publisher":"Association for Computing Machinery","month":"01","fulldoi":"https://doi.org/10.1145/3737447","PlanS_conform":"1","article_processing_charge":"Yes (via OA deal)","_id":"21012","date_created":"2026-01-20T10:08:21Z","date_updated":"2026-01-21T08:55:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"oa_version":"Published Version","has_accepted_license":"1","publication_status":"published","type":"dissertation","acknowledgement":"This work is part of the project VAMOS, which has received funding from the European\r\nResearch Council (ERC) under grant agreement No. 101020093, and the Austrian Science\r\nFund (FWF) SFB project SpyCoDe F8502.\r\n","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"alternative_title":["ISTA Master’s Thesis"],"file_date_updated":"2026-03-10T15:20:09Z","corr_author":"1","citation":{"short":"M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026.","mla":"Karimi, Mahyar. Privacy-Preserving Runtime Verification. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21401.","apa":"Karimi, M. (2026). Privacy-preserving runtime verification. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21401","chicago":"Karimi, Mahyar. “Privacy-Preserving Runtime Verification.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21401.","ama":"Karimi M. Privacy-preserving runtime verification. 2026. doi:10.15479/AT-ISTA-21401","ista":"Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria.","ieee":"M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026."},"related_material":{"record":[{"id":"21020","status":"public","relation":"part_of_dissertation"}]},"supervisor":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"OA_place":"repository","year":"2026","doi":"10.15479/AT-ISTA-21401","page":"60","author":[{"full_name":"Karimi, Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","first_name":"Mahyar","last_name":"Karimi","orcid":"0009-0005-0820-1696"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f"}],"publication_identifier":{"issn":["2791-4585"]},"abstract":[{"lang":"eng","text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n"}],"file":[{"creator":"mkarimi","content_type":"application/pdf","file_size":766048,"file_name":"2026_Karimi_Mahyar_Thesis.pdf","date_created":"2026-03-06T14:06:25Z","date_updated":"2026-03-10T15:20:09Z","access_level":"open_access","relation":"main_file","file_id":"21404","checksum":"3f49f05c9d123e14d7adb73d3bc50fe2"},{"checksum":"8fb9db4b4187e26443369a993427a5ff","access_level":"closed","file_id":"21405","relation":"source_file","date_updated":"2026-03-06T14:06:25Z","date_created":"2026-03-06T14:06:25Z","file_name":"2026_Karimi_Mahyar_Thesis_src.zip","file_size":1243394,"content_type":"application/zip","creator":"mkarimi"}],"date_published":"2026-03-05T00:00:00Z","language":[{"iso":"eng"}],"status":"public","ec_funded":1,"day":"05","title":"Privacy-preserving runtime verification","oa":1,"degree_awarded":"MS","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-03-13T13:37:20Z","date_created":"2026-03-05T15:20:47Z","keyword":["Privacy-preserving verification","Runtime verification","Monitoring","Reactive functionalities","Cryptographic protocols"],"article_processing_charge":"No","_id":"21401","ddc":["000"],"month":"03","fulldoi":"https://doi.org/10.15479/AT-ISTA-21401","publisher":"Institute of Science and Technology Austria"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-21T22:03:00Z","date_updated":"2026-06-24T08:37:00Z","supplementarymaterial":"no","keyword":["Explainable AI","Large Language Models","Trust in AI"],"oa":1,"month":"04","fulldoi":"https://doi.org/10.5220/0014483200004052","publisher":"Science and Technology Publications","article_processing_charge":"No","_id":"22103","ec_funded":1,"status":"public","quality_controlled":"1","title":"Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants","intvolume":" 5","day":"01","conference":{"name":"ICAART: International Conference on Agents and Artificial Intelligence","start_date":"2026-03-05","end_date":"2026-03-08","location":"Marbella, Spain"},"page":"4689-4696","author":[{"full_name":"Cano Cordoba, Filip","first_name":"Filip","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","last_name":"Cano Cordoba","orcid":"0000-0002-0783-904X"}],"abstract":[{"text":"Modern AI systems increasingly rely on opaque, highly complex models whose inner workings remain inaccessible even to experts. This opacity creates challenges for trust, accountability, and compliance with\r\nemerging regulatory expectations such as the “right to an explanation”. While traditional explainability methods—feature attributions, counterfactuals, surrogate models—and interpretable model classes provide valuable insights for engineers, they often fall short of delivering the contextual, conversational explanations that\r\nreal users expect. Large Language Models (LLMs) offer a promising new avenue for explanation due to their\r\nability to engage interactively, adapt to user needs, and translate technical outputs into more accessible reasoning. However, their tendencies toward hallucination, conflict avoidance, and oversimplification introduce\r\nserious risks when used as explanatory agents. This paper analyzes these opportunities and limitations, examines verification strategies for ensuring explanation fidelity, and situates LLM-generated explanations within\r\nbroader concerns about public trust. The paper concludes by outlining best practices and future research directions for building robust, verifiable, and human-aligned explanation systems.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://filipcano.org/files/icaart26llm.pdf"}],"date_published":"2026-04-01T00:00:00Z","language":[{"iso":"eng"}],"das_tickbox":"0","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","publication_identifier":{"issn":["2184-3589"],"isbn":["9789897587962"],"eissn":["2184-433X"]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"researchdata_availability":"no","OA_type":"green","type":"conference","acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG\r\n101020093. LLM–based tools have been used as\r\nwriting assistance to help improve presentation.\r\n","department":[{"_id":"ToHe"}],"scopus_import":"1","oa_version":"Accepted Version","publication_status":"published","OA_place":"repository","year":"2026","doi":"10.5220/0014483200004052","corr_author":"1","citation":{"apa":"Cano Cordoba, F. (2026). Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In Proceedings of the 18th International Conference on Agents and Artificial Intelligence (Vol. 5, pp. 4689–4696). Marbella, Spain: Science and Technology Publications. https://doi.org/10.5220/0014483200004052","chicago":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” In Proceedings of the 18th International Conference on Agents and Artificial Intelligence, 5:4689–96. Science and Technology Publications, 2026. https://doi.org/10.5220/0014483200004052.","short":"F. Cano Cordoba, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Science and Technology Publications, 2026, pp. 4689–4696.","mla":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” Proceedings of the 18th International Conference on Agents and Artificial Intelligence, vol. 5, Science and Technology Publications, 2026, pp. 4689–96, doi:10.5220/0014483200004052.","ista":"Cano Cordoba F. 2026. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 5, 4689–4696.","ieee":"F. Cano Cordoba, “Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants,” in Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Marbella, Spain, 2026, vol. 5, pp. 4689–4696.","ama":"Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In: Proceedings of the 18th International Conference on Agents and Artificial Intelligence. Vol 5. Science and Technology Publications; 2026:4689-4696. doi:10.5220/0014483200004052"},"volume":5},{"publisher":"Cambridge University Press","fulldoi":"https://doi.org/10.1017/9781009500678.022","month":"04","article_processing_charge":"No","_id":"22300","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-13T13:32:47Z","date_created":"2026-07-13T10:44:22Z","title":"Bidding Games","day":"26","status":"public","quality_controlled":"1","abstract":[{"text":"As seen in previous chapters, a graph game proceeds by placing a token on one of the vertices and allowing the players to move it throughout the graph to produce an infinite trace, which determines the winner or payoff of the game.","lang":"eng"}],"date_published":"2026-04-26T00:00:00Z","language":[{"iso":"eng"}],"publication":"Games on Graphs. From Logic and Automata to Algorithms","das_tickbox":"1","publication_identifier":{"eisbn":["9781009500678"],"isbn":["9781009500685"]},"page":"529-569","author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"doi":"10.1017/9781009500678.022","year":"2026","editor":[{"last_name":"Fijalkow","first_name":" Nathanaël","full_name":"Fijalkow, Nathanaël"}],"corr_author":"1","citation":{"ama":"Avni G, Henzinger TA. Bidding Games. In: Fijalkow Nathanaël, ed. Games on Graphs. From Logic and Automata to Algorithms. Cambridge University Press; 2026:529-569. doi:10.1017/9781009500678.022","ista":"Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569.","ieee":"G. Avni and T. A. Henzinger, “Bidding Games,” in Games on Graphs. From Logic and Automata to Algorithms, Nathanaël Fijalkow, Ed. Cambridge University Press, 2026, pp. 529–569.","short":"G. Avni, T.A. Henzinger, in:, Nathanaël Fijalkow (Ed.), Games on Graphs. From Logic and Automata to Algorithms, Cambridge University Press, 2026, pp. 529–569.","mla":"Avni, Guy, and Thomas A. Henzinger. “Bidding Games.” Games on Graphs. From Logic and Automata to Algorithms, edited by Nathanaël Fijalkow, Cambridge University Press, 2026, pp. 529–69, doi:10.1017/9781009500678.022.","apa":"Avni, G., & Henzinger, T. A. (2026). Bidding Games. In Nathanaël Fijalkow (Ed.), Games on Graphs. From Logic and Automata to Algorithms (pp. 529–569). Cambridge University Press. https://doi.org/10.1017/9781009500678.022","chicago":"Avni, Guy, and Thomas A Henzinger. “Bidding Games.” In Games on Graphs. From Logic and Automata to Algorithms, edited by Nathanaël Fijalkow, 529–69. Cambridge University Press, 2026. https://doi.org/10.1017/9781009500678.022."},"type":"book_chapter","OA_type":"closed access","scopus_import":"1","department":[{"_id":"ToHe"}],"oa_version":"None","publication_status":"published"},{"OA_type":"green","type":"conference","department":[{"_id":"ToHe"}],"scopus_import":"1","oa_version":"Preprint","publication_status":"published","OA_place":"repository","doi":"10.5220/0014326500004052","year":"2026","citation":{"ama":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting neural networks. In: Proceedings of the 18th International Conference on Agents and Artificial Intelligence. Vol 2. SciTePress; 2026:1536-1546. doi:10.5220/0014326500004052","ieee":"A. Hatua, T. Nguyen, F. Cano Cordoba, and A. Sung, “Machine unlearning using forgetting neural networks,” in Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Marbella, Spain, 2026, vol. 2, pp. 1536–1546.","ista":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. 2026. Machine unlearning using forgetting neural networks. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 2, 1536–1546.","mla":"Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.” Proceedings of the 18th International Conference on Agents and Artificial Intelligence, vol. 2, SciTePress, 2026, pp. 1536–46, doi:10.5220/0014326500004052.","short":"A. Hatua, T. Nguyen, F. Cano Cordoba, A. Sung, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, SciTePress, 2026, pp. 1536–1546.","chicago":"Hatua, Amartya, Trung Nguyen, Filip Cano Cordoba, and Andrew Sung. “Machine Unlearning Using Forgetting Neural Networks.” In Proceedings of the 18th International Conference on Agents and Artificial Intelligence, 2:1536–46. SciTePress, 2026. https://doi.org/10.5220/0014326500004052.","apa":"Hatua, A., Nguyen, T., Cano Cordoba, F., & Sung, A. (2026). Machine unlearning using forgetting neural networks. In Proceedings of the 18th International Conference on Agents and Artificial Intelligence (Vol. 2, pp. 1536–1546). Marbella, Spain: SciTePress. https://doi.org/10.5220/0014326500004052"},"volume":2,"page":"1536-1546","author":[{"full_name":"Hatua, Amartya","last_name":"Hatua","first_name":"Amartya"},{"full_name":"Nguyen, Trung","last_name":"Nguyen","first_name":"Trung"},{"full_name":"Cano Cordoba, Filip","orcid":"0000-0002-0783-904X","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","last_name":"Cano Cordoba","first_name":"Filip"},{"last_name":"Sung","first_name":"Andrew","full_name":"Sung, Andrew"}],"abstract":[{"lang":"eng","text":"Modern computer systems store vast amounts of personal data, enabling advances in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes desired for an ML model to forget part of the data it was trained on. In this paper, we introduce a novel unlearning approach based on Forgetting Neural Networks (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting through multiplicative decay factors. While FNNs had previously been studied as a theoretical construct, we provide the first concrete implementation and demonstrate their effectiveness for targeted unlearning. We propose several variants with per-neuron forgetting factors, including rank-based assignments guided by activation levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically removes information associated with forget sets while preserving performance on retained data. Membership inference attacks confirm the effectiveness of FNN-based unlearning in erasing information about the training data from the neural network. These results establish FNNs as a promising foundation for efficient and interpretable unlearning. "}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.22374"}],"date_published":"2026-06-30T00:00:00Z","language":[{"iso":"eng"}],"das_tickbox":"1","external_id":{"arxiv":["2410.22374"]},"publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","publication_identifier":{"eissn":["2184-433X"],"isbn":["9789897587962"]},"status":"public","quality_controlled":"1","arxiv":1,"title":"Machine unlearning using forgetting neural networks","intvolume":" 2","day":"30","conference":{"end_date":"2026-03-08","location":"Marbella, Spain","start_date":"2026-03-05","name":"ICAART: International Conference on Agents and Artificial Intelligence"},"date_updated":"2026-07-16T09:02:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-07-13T09:46:46Z","keyword":["Machine Unlearning","Neuroscience-Inspired Machine Learning","Membership Inference Attacks"],"oa":1,"month":"06","fulldoi":"https://doi.org/10.5220/0014326500004052","publisher":"SciTePress","article_processing_charge":"No","_id":"22294"},{"conference":{"start_date":"2026-06-25","name":"FAccT: Conference on Fairness, Accountability and Transparency","location":"Montreal, Canada","end_date":"2026-06-28"},"day":"01","title":"Energy shields for fairness","arxiv":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"ec_funded":1,"status":"public","_id":"22321","article_processing_charge":"Yes","publisher":"Association for Computing Machinery","fulldoi":"https://doi.org/10.1145/3805689.3806807","month":"07","ddc":["000"],"oa":1,"supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-22T06:15:56Z","date_created":"2026-07-14T05:32:45Z","citation":{"ieee":"F. Cano Cordoba, T. A. Henzinger, and K. Kueffner, “Energy shields for fairness,” in Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency, Montreal, Canada, 2026, pp. 4243–4275.","ista":"Cano Cordoba F, Henzinger TA, Kueffner K. 2026. Energy shields for fairness. Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency. FAccT: Conference on Fairness, Accountability and Transparency, 4243–4275.","ama":"Cano Cordoba F, Henzinger TA, Kueffner K. Energy shields for fairness. In: Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency. Association for Computing Machinery; 2026:4243-4275. doi:10.1145/3805689.3806807","chicago":"Cano Cordoba, Filip, Thomas A Henzinger, and Konstantin Kueffner. “Energy Shields for Fairness.” In Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency, 4243–75. Association for Computing Machinery, 2026. https://doi.org/10.1145/3805689.3806807.","apa":"Cano Cordoba, F., Henzinger, T. A., & Kueffner, K. (2026). Energy shields for fairness. In Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency (pp. 4243–4275). Montreal, Canada: Association for Computing Machinery. https://doi.org/10.1145/3805689.3806807","mla":"Cano Cordoba, Filip, et al. “Energy Shields for Fairness.” Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2026, pp. 4243–75, doi:10.1145/3805689.3806807.","short":"F. Cano Cordoba, T.A. Henzinger, K. Kueffner, in:, Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2026, pp. 4243–4275."},"corr_author":"1","file_date_updated":"2026-07-16T09:23:15Z","OA_place":"publisher","year":"2026","doi":"10.1145/3805689.3806807","publication_status":"published","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","department":[{"_id":"ToHe"}],"acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","OA_type":"gold","researchdata_availability":"no","type":"conference","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"publication":"Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency","das_tickbox":"0","external_id":{"arxiv":["2605.24926"]},"date_published":"2026-07-01T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_size":3129128,"content_type":"application/pdf","creator":"dernst","success":1,"date_updated":"2026-07-16T09:23:15Z","date_created":"2026-07-16T09:23:15Z","file_name":"2026_ACMFACCT_Cano.pdf","checksum":"21e648ea3b529f0df7545ad4b31b0ef4","access_level":"open_access","relation":"main_file","file_id":"22348"}],"abstract":[{"text":"Runtime fairness is not a one-time constraint but a dynamic property evaluated over a sequence of decisions. To ensure fairness at runtime, it is necessary to account for past decisions, information neglected by conventional, static classifiers. Traditional fairness shields enforce runtime fairness abruptly, by intervening deterministically whenever a sequence of decisions violates the target for a running fairness measure. This motivates our main conceptual contribution: energy shields. An energy shield is a novel, lightweight, adaptive controller that monitors a sequence of decisions and intervenes probabilistically to ensure runtime fairness smoothly, by utilizing physics-inspired energy functions to nudge the sequence toward fairness: the more unfair the decisions, the stronger the nudging force becomes. This makes energy shields the first fairness shields to provide both short-term safety and long-term liveness guarantees. Safety ensures that the running fairness measure stays within a running target interval with high probability, and liveness ensures that the limit of the fairness measure lies within the limit target interval. Intuitively, the short-term specifies the tolerated fairness values and the long-term specifies the desired fairness values. We also provide a synthesis procedure for constructing the least intrusive energy shield for a given target specification, and demonstrate its efficiency experimentally. We evaluate our energy shields against existing fairness shields through the lens of short- and long-term fairness.","lang":"eng"}],"author":[{"full_name":"Cano Cordoba, Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","first_name":"Filip","orcid":"0000-0002-0783-904X"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","last_name":"Kueffner","full_name":"Kueffner, Konstantin"}],"page":"4243 - 4275"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","fulldoi":"https://doi.org/10.4230/LIPIcs.LICS.2026.23","month":"07","ddc":["000"],"_id":"22617","article_processing_charge":"No","keyword":["Concurrent games","Shared randomness","Topology","Algebraic Geometry"],"supplementarymaterial":"no","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-08-02T22:01:52Z","date_updated":"2026-08-03T07:03:28Z","oa":1,"intvolume":" 380","title":"Dicey games: Shared sources of randomness in distributed systems","arxiv":1,"conference":{"location":"Lisbon, Portugal","end_date":"2026-07-23","name":"LICS: Logic in Computer Science","start_date":"2026-07-20"},"day":"09","ec_funded":1,"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","article_number":"23:1-23:26","language":[{"iso":"eng"}],"date_published":"2026-07-09T00:00:00Z","file":[{"access_level":"open_access","file_id":"22625","relation":"main_file","checksum":"5d0ff4d267565188a8b4c7502e1bd243","file_name":"2026_LIPICSLICS_Brice.pdf","date_updated":"2026-08-03T07:02:30Z","date_created":"2026-08-03T07:02:30Z","content_type":"application/pdf","creator":"dernst","success":1,"file_size":919708}],"abstract":[{"lang":"eng","text":"Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says \"Heads\" or \"Tails\". The team wins if all four choices match; otherwise the Devil wins. If all team players randomise independently, they win with probability 1/8; if all players share a common source of randomness, they win with probability 1/2. What happens when each pair of team players shares a source of randomness? Can the team do better than win with probability 1/4? The surprising (and nontrivial) answer is yes!\r\nWe introduce Dicey Games, a formal framework motivated by the study of distributed systems with shared sources of randomness (of which the above example is a specific instance). We characterise the existence, representation and computational complexity of optimal strategies in Dicey Games, and we study the problem of allocating limited sources of randomness optimally within a team."}],"project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774345"]},"publication":"41st Annual Symposium on Logic in Computer Science","external_id":{"arxiv":["2601.18303"]},"das_tickbox":"0","author":[{"full_name":"Brice, Leonard J","id":"ce3b3409-db6c-11f0-aa64-ad678f7fd937","first_name":"Leonard J","last_name":"Brice"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Thejaswini, K. S.","last_name":"Thejaswini","first_name":"K. S."}],"doi":"10.4230/LIPIcs.LICS.2026.23","year":"2026","OA_place":"publisher","volume":380,"citation":{"ieee":"L. J. Brice, T. A. Henzinger, and K. S. Thejaswini, “Dicey games: Shared sources of randomness in distributed systems,” in 41st Annual Symposium on Logic in Computer Science, Lisbon, Portugal, 2026, vol. 380.","ista":"Brice LJ, Henzinger TA, Thejaswini KS. 2026. Dicey games: Shared sources of randomness in distributed systems. 41st Annual Symposium on Logic in Computer Science. LICS: Logic in Computer Science, LIPIcs, vol. 380, 23:1-23:26.","ama":"Brice LJ, Henzinger TA, Thejaswini KS. Dicey games: Shared sources of randomness in distributed systems. In: 41st Annual Symposium on Logic in Computer Science. Vol 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.LICS.2026.23","apa":"Brice, L. J., Henzinger, T. A., & Thejaswini, K. S. (2026). Dicey games: Shared sources of randomness in distributed systems. In 41st Annual Symposium on Logic in Computer Science (Vol. 380). Lisbon, Portugal: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.LICS.2026.23","chicago":"Brice, Leonard J, Thomas A Henzinger, and K. S. Thejaswini. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” In 41st Annual Symposium on Logic in Computer Science, Vol. 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.LICS.2026.23.","mla":"Brice, Leonard J., et al. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” 41st Annual Symposium on Logic in Computer Science, vol. 380, 23:1-23:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.LICS.2026.23.","short":"L.J. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 41st Annual Symposium on Logic in Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"corr_author":"1","file_date_updated":"2026-08-03T07:02:30Z","scopus_import":"1","department":[{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\nLéonard Brice: Part of this work was realised when this author was an FNRS aspirant at Université libre de Bruxelles.\r\nK. S. Thejaswini: Part of this work was realised when this author was a post-doctoral researcher at IST Austria.\r\nAcknowledgements We thank all our colleagues who took the time to hear our puzzle and wasted several hours of their research time in pursuit of the optimal bounds for the 3-player matching.\r\npennies problem.\r\n","type":"conference","researchdata_availability":"no","OA_type":"gold","publication_status":"published","has_accepted_license":"1","oa_version":"Published Version"},{"publication":"Ergodic Theory and Dynamical Systems","external_id":{"arxiv":["2405.05279"]},"das_tickbox":"0","publication_identifier":{"issn":["0143-3857"],"eissn":["1469-4417"]},"abstract":[{"text":"It is known that for a uniform morphic sequence 𝒖 =⟨𝑢𝑛⟩∞\r\n𝑛=0 and an algebraic number 𝛽 such that |𝛽| >1, the number [[𝒖]]𝛽 :=∑∞\r\n𝑛=0(𝑢𝑛/𝛽𝑛) either lies in ℚ(𝛽) or is transcendental. In this paper, we show a similar rational–transcendental dichotomy for sequences defined by irreducible Pisot morphisms on binary alphabets. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases, we are able to show transcendence of [[𝒖]]𝛽 outright. In particular, for 𝑘 ≥2, if 𝒖 is the k-Bonacci word, then [[𝒖]]𝛽 is transcendental.","lang":"eng"}],"date_published":"2026-07-10T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/etds.2026.10324"}],"page":"1-22","author":[{"last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","full_name":"Kebis, Pavol"},{"first_name":"FLORIAN","last_name":"LUCA","full_name":"LUCA, FLORIAN"},{"first_name":"JOEL","last_name":"OUAKNINE","full_name":"OUAKNINE, JOEL"},{"full_name":"SCOONES, ANDREW","last_name":"SCOONES","first_name":"ANDREW"},{"last_name":"WORRELL","first_name":"JAMES","full_name":"WORRELL, JAMES"}],"mathsc":["11J81","37B10","11J87"],"citation":{"ama":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems. 2026:1-22. doi:10.1017/etds.2026.10324","ista":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. 2026. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems., 1–22.","ieee":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, and J. WORRELL, “Transcendence for Pisot morphic words over an algebraic base,” Ergodic Theory and Dynamical Systems. Cambridge University Press, pp. 1–22, 2026.","short":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, J. WORRELL, Ergodic Theory and Dynamical Systems (2026) 1–22.","mla":"Kebis, Pavol, et al. “Transcendence for Pisot Morphic Words over an Algebraic Base.” Ergodic Theory and Dynamical Systems, Cambridge University Press, 2026, pp. 1–22, doi:10.1017/etds.2026.10324.","chicago":"Kebis, Pavol, FLORIAN LUCA, JOEL OUAKNINE, ANDREW SCOONES, and JAMES WORRELL. “Transcendence for Pisot Morphic Words over an Algebraic Base.” Ergodic Theory and Dynamical Systems. Cambridge University Press, 2026. https://doi.org/10.1017/etds.2026.10324.","apa":"Kebis, P., LUCA, F., OUAKNINE, J., SCOONES, A., & WORRELL, J. (2026). Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems. Cambridge University Press. https://doi.org/10.1017/etds.2026.10324"},"year":"2026","doi":"10.1017/etds.2026.10324","OA_place":"publisher","oa_version":"Published Version","publication_status":"epub_ahead","has_accepted_license":"1","acknowledgement":"We thank the anonymous referee for identifying an error in an earlier\r\nversion of the paper. We gratefully acknowledge support from UKRI Frontier Research\r\nGrant EP/X033813/1, ERC grant DynAMiCS (101167561) and DFG grant 389792660 as\r\npart of TRR 248. J.O. is also affiliated with Keble College, Oxford as an Emmy Network\r\nfellow.","type":"journal_article","OA_type":"hybrid","researchdata_availability":"no","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"article_processing_charge":"Yes (in subscription journal)","_id":"22406","ddc":["000"],"publisher":"Cambridge University Press","PlanS_conform":"1","fulldoi":"https://doi.org/10.1017/etds.2026.10324","month":"07","oa":1,"keyword":["balanced-pair algorithm","Cobham’s conjecture","k-Bonacci words","Pisot conjecture","subspace theorem"],"supplementarymaterial":"no","date_updated":"2026-08-03T06:17:50Z","date_created":"2026-07-27T05:53:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","arxiv":1,"title":"Transcendence for Pisot morphic words over an algebraic base","article_type":"original","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","status":"public"},{"publication":"38th International Conference on Computer Aided Verification","das_tickbox":"1","external_id":{"arxiv":["2603.07094"]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"publication_identifier":{"isbn":["9783032325181"],"issn":["0302-9743"],"eissn":["1611-3349"]},"abstract":[{"text":"We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team players do not share a source of randomness, and their private random sources are hidden from the opponent and from each other.\r\n\r\nWe show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (ER) but also enables the construction of value iteration algorithms. We additionally show that the threshold problem is NP-hard. For the almost-sure reachability problem, we prove NP-completeness.\r\n\r\nWe introduce Individually Randomised Alternating-time Temporal Logic (IRATL). This logic extends the standard ATL framework to reason about probability thresholds, with semantics explicitly designed for coalitions that lack a shared source of randomness. On the practical side, we implement and evaluate a solver for the threshold and almost-sure problem based on the algorithms that we develop.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2026-07-24T00:00:00Z","file":[{"creator":"dernst","content_type":"application/pdf","success":1,"file_size":1902192,"relation":"main_file","access_level":"open_access","file_id":"22724","checksum":"10ded8a3ab9ed34c9e4794c0b277622c","file_name":"2026_LNCS_Brice.pdf","date_created":"2026-08-18T06:53:22Z","date_updated":"2026-08-18T06:53:22Z"}],"page":"215-236","author":[{"full_name":"Brice, Leonard J","first_name":"Leonard J","id":"ce3b3409-db6c-11f0-aa64-ad678f7fd937","last_name":"Brice"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Montaseri, Alipasha","first_name":"Alipasha","last_name":"Montaseri","id":"709a7f96-8896-11f0-9809-d75612fc0f2e"},{"full_name":"Shafiee, Ali","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad","last_name":"Shafiee","first_name":"Ali"},{"full_name":"Thejaswini, K. S.","last_name":"Thejaswini","first_name":"K. S."}],"file_date_updated":"2026-08-18T06:53:22Z","volume":16682,"citation":{"chicago":"Brice, Leonard J, Thomas A Henzinger, Alipasha Montaseri, Ali Shafiee, and K. S. Thejaswini. “Randomise Alone, Reach as a Team.” In 38th International Conference on Computer Aided Verification, 16682:215–36. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-32519-8_12.","apa":"Brice, L. J., Henzinger, T. A., Montaseri, A., Shafiee, A., & Thejaswini, K. S. (2026). Randomise alone, reach as a team. In 38th International Conference on Computer Aided Verification (Vol. 16682, pp. 215–236). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-032-32519-8_12","short":"L.J. Brice, T.A. Henzinger, A. Montaseri, A. Shafiee, K.S. Thejaswini, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 215–236.","mla":"Brice, Leonard J., et al. “Randomise Alone, Reach as a Team.” 38th International Conference on Computer Aided Verification, vol. 16682, Springer Nature, 2026, pp. 215–36, doi:10.1007/978-3-032-32519-8_12.","ista":"Brice LJ, Henzinger TA, Montaseri A, Shafiee A, Thejaswini KS. 2026. Randomise alone, reach as a team. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification vol. 16682, 215–236.","ieee":"L. J. Brice, T. A. Henzinger, A. Montaseri, A. Shafiee, and K. S. Thejaswini, “Randomise alone, reach as a team,” in 38th International Conference on Computer Aided Verification, Lisbon, Portugal, 2026, vol. 16682, pp. 215–236.","ama":"Brice LJ, Henzinger TA, Montaseri A, Shafiee A, Thejaswini KS. Randomise alone, reach as a team. In: 38th International Conference on Computer Aided Verification. Vol 16682. Springer Nature; 2026:215-236. doi:10.1007/978-3-032-32519-8_12"},"year":"2026","doi":"10.1007/978-3-032-32519-8_12","OA_place":"publisher","oa_version":"Published Version","has_accepted_license":"1","publication_status":"published","acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093. Part of this work was realised when the first author was an FNRS aspirant at Université libre de Bruxelles.","type":"conference","researchdata_availability":"yes","OA_type":"hybrid","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"article_processing_charge":"Yes (in subscription journal)","_id":"22717","ddc":["000"],"publisher":"Springer Nature","month":"07","fulldoi":"https://doi.org/10.1007/978-3-032-32519-8_12","oa":1,"supplementarymaterial":"no","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-08-18T06:55:38Z","date_created":"2026-08-16T22:01:44Z","conference":{"end_date":"2026-07-29","location":"Lisbon, Portugal","name":"CAV: Computer Aided Verification","start_date":"2026-07-26"},"day":"24","dataavailabilitystatement":"The artifact can be accessed at the link: https://doi. org/10.5281/zenodo.19680359.\r\nThe source code is available at:https://github.com/alipashamontaseri/Team-Concurrent-Game.","arxiv":1,"intvolume":" 16682","title":"Randomise alone, reach as a team","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"ec_funded":1,"status":"public"},{"author":[{"full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"},{"full_name":"Sadhukhan, Suman","last_name":"Sadhukhan","first_name":"Suman"},{"last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"page":"237-257","publication_identifier":{"isbn":["9783032325181"],"issn":["0302-9743"],"eissn":["1611-3349"]},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"publication":"38th International Conference on Computer Aided Verification","das_tickbox":"0","external_id":{"arxiv":["2605.13185"]},"date_published":"2026-07-24T00:00:00Z","language":[{"iso":"eng"}],"file":[{"success":1,"content_type":"application/pdf","creator":"dernst","file_size":531980,"file_name":"2026_LNCS_Avni.pdf","date_updated":"2026-08-18T08:40:07Z","date_created":"2026-08-18T08:40:07Z","file_id":"22730","access_level":"open_access","relation":"main_file","checksum":"f17ba3f82854fdb4eb69fd922965661a"}],"abstract":[{"lang":"eng","text":"We study the problem of generating paths on a graph that satisfy a collection of w-regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler—oblivious to the graph and objective—dynamically composes these policies into a single path. We ask when such a composition satisfies all objectives, assuming their conjunction is realizable. The framework enables modular policy design but raises fundamental compositional challenges. We show that even extremely fair deterministic schedulers do not ensure correctness, and that stochastic schedulers, while necessary, are insufficient without coordination. For safety objectives, we demonstrate that fully decentralized implementations are impossible, and we introduce a protocol for synchronizing on maximal safe actions. For non-safety objectives, we introduce conventions—simple, a priori restrictions agreed upon before the graph or objectives are revealed—that guarantee satisfaction of all objectives when followed by all agents. We characterize minimally restrictive conventions for major subclasses of w-regular objectives. In particular, Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled."}],"has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","scopus_import":"1","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"acknowledgement":"This work is funded by the following grants: European Research Council under Grant No.: ERC-2020-AdG 101020093, ISF grant no. 1679/21, grant RYC2024-049116, MICIU/AEI/10.13039/501100011033, the ESF+, and Volkswagen Foundation within its Momentum framework under project no. 9C283.","type":"conference","OA_type":"hybrid","researchdata_availability":"no","volume":16682,"citation":{"ama":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. Decoupled planning for multiple omega-regular objectives. In: 38th International Conference on Computer Aided Verification. Vol 16682. Springer Nature; 2026:237-257. doi:10.1007/978-3-032-32519-8_13","ieee":"G. Avni, T. A. Henzinger, K. Mallik, S. Sadhukhan, and K. S. Thejaswini, “Decoupled planning for multiple omega-regular objectives,” in 38th International Conference on Computer Aided Verification, Lisbon, Portugal, 2026, vol. 16682, pp. 237–257.","ista":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. 2026. Decoupled planning for multiple omega-regular objectives. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 16682, 237–257.","mla":"Avni, Guy, et al. “Decoupled Planning for Multiple Omega-Regular Objectives.” 38th International Conference on Computer Aided Verification, vol. 16682, Springer Nature, 2026, pp. 237–57, doi:10.1007/978-3-032-32519-8_13.","short":"G. Avni, T.A. Henzinger, K. Mallik, S. Sadhukhan, K.S. Thejaswini, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 237–257.","chicago":"Avni, Guy, Thomas A Henzinger, Kaushik Mallik, Suman Sadhukhan, and K. S. Thejaswini. “Decoupled Planning for Multiple Omega-Regular Objectives.” In 38th International Conference on Computer Aided Verification, 16682:237–57. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-32519-8_13.","apa":"Avni, G., Henzinger, T. A., Mallik, K., Sadhukhan, S., & Thejaswini, K. S. (2026). Decoupled planning for multiple omega-regular objectives. In 38th International Conference on Computer Aided Verification (Vol. 16682, pp. 237–257). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-032-32519-8_13"},"file_date_updated":"2026-08-18T08:40:07Z","year":"2026","doi":"10.1007/978-3-032-32519-8_13","OA_place":"publisher","oa":1,"supplementarymaterial":"no","date_updated":"2026-08-18T08:41:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-08-16T22:01:44Z","_id":"22719","article_processing_charge":"Yes (in subscription journal)","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/978-3-032-32519-8_13","month":"07","ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","status":"public","ec_funded":1,"conference":{"start_date":"2026-07-26","name":"CAV: Computer Aided Verification","location":"Lisbon, Portugal","end_date":"2026-07-29"},"day":"24","intvolume":" 16682","title":"Decoupled planning for multiple omega-regular objectives","arxiv":1},{"volume":16683,"citation":{"apa":"Henzinger, T. A., Mazzocchi, N. A., Sarac, N. E., & Yılmaz, H. (2026). Extending QuAK with nested quantitative automata. In 38th International Conference on Computer Aided Verification (Vol. 16683, pp. 418–432). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-032-32526-6_20","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, Naci E Sarac, and Harun Yılmaz. “Extending QuAK with Nested Quantitative Automata.” In 38th International Conference on Computer Aided Verification, 16683:418–32. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-32526-6_20.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, H. Yılmaz, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 418–432.","mla":"Henzinger, Thomas A., et al. “Extending QuAK with Nested Quantitative Automata.” 38th International Conference on Computer Aided Verification, vol. 16683, Springer Nature, 2026, pp. 418–32, doi:10.1007/978-3-032-32526-6_20.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE, Yılmaz H. 2026. Extending QuAK with nested quantitative automata. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 16683, 418–432.","ieee":"T. A. Henzinger, N. A. Mazzocchi, N. E. Sarac, and H. Yılmaz, “Extending QuAK with nested quantitative automata,” in 38th International Conference on Computer Aided Verification, Lisbon, Portugal, 2026, vol. 16683, pp. 418–432.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE, Yılmaz H. Extending QuAK with nested quantitative automata. In: 38th International Conference on Computer Aided Verification. Vol 16683. Springer Nature; 2026:418-432. doi:10.1007/978-3-032-32526-6_20"},"file_date_updated":"2026-09-09T06:33:55Z","doi":"10.1007/978-3-032-32526-6_20","year":"2026","OA_place":"publisher","has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","scopus_import":"1","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"acknowledgement":"This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412).","type":"conference","OA_type":"hybrid","researchdata_availability":"yes","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"publication_identifier":{"isbn":["9783032325259"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication":"38th International Conference on Computer Aided Verification","das_tickbox":"1","external_id":{"arxiv":["2605.12418"]},"date_published":"2026-01-01T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_size":425988,"content_type":"application/pdf","creator":"dernst","success":1,"checksum":"043ba7b83f28d036d5a0e6e70a52cc9a","access_level":"open_access","file_id":"22861","relation":"main_file","date_created":"2026-09-09T06:33:55Z","date_updated":"2026-09-09T06:33:55Z","file_name":"2026_LNCS_HenzingerT.pdf"}],"abstract":[{"lang":"eng","text":"Quantitative automata (QAs) extend finite-state automata on infinite words with weighted transitions to specify quantitative system properties. However, their finite weight sets rule out properties like average response time, where response times can be arbitrarily large. Nested quantitative automata (NQAs) overcome this limitation: a parent automaton spawns child automata to compute unbounded values over finite infixes and aggregates them into a final result. Despite this expressiveness, NQAs have lacked practical tool support to date.\r\n\r\nWe close this gap by extending the Quantitative Automata Kit (QuAK), a software tool for QA analysis, to support NQAs. Our core contribution is implementing a suite of flattening procedures that reduce NQAs to QAs, leveraging QuAK’s existing decision procedures. These reductions preserve the answers to threshold decision problems, while allowing users to specify properties in the more expressive NQA formalism. The tool handles all combinations of parent aggregators (including limits and averages) and child functions (extrema and monotonic or bounded summations) for which emptiness and universality are known to be decidable. Experiments on response-time and resource-consumption benchmarks demonstrate QuAK’s effectiveness."}],"author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien"},{"full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac"},{"last_name":"Yılmaz","first_name":"Harun","full_name":"Yılmaz, Harun"}],"page":"418-432","conference":{"end_date":"2026-07-29","location":"Lisbon, Portugal","start_date":"2026-07-26","name":"CAV: Computer Aided Verification"},"day":"01","intvolume":" 16683","title":"Extending QuAK with nested quantitative automata","dataavailabilitystatement":"The artifact supporting the experimental results in this paper is available in the QuAK repository at https://github.com/ista-vamos/nested-quak. It contains the extended QuAK implementation, benchmark generators, example inputs, and scripts/logs for reproducing the reported tables. The artifact is intended to reproduce the experiments under the setup described in Sect. 4; runtimes may vary across machines, and the reported timeout and memory-exhaustion results depend on the stated hardware limits. No sensitive or restricted data are used. An archived version is available on Zenodo at DOI: http://doi.org/10.5281/zenodo.19844606.","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","ec_funded":1,"status":"public","_id":"22754","article_processing_charge":"No","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/978-3-032-32526-6_20","month":"01","ddc":["000"],"oa":1,"supplementarymaterial":"no","date_updated":"2026-09-09T06:37:41Z","date_created":"2026-08-23T22:01:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","has_accepted_license":"1","oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"scopus_import":"1","researchdata_availability":"no","OA_type":"gold","type":"conference","acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), ERC-2020-AdG 101020093\r\n(VAMOS), and the RYC2024-049116-I grant funded by MICIU/AEI/10.13039/501100011033 and\r\nESF+.\r\n","citation":{"ama":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. Generalized bidding games: Where bidding and stochastic games meet. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.13","ieee":"A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized bidding games: Where bidding and stochastic games meet,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","ista":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized bidding games: Where bidding and stochastic games meet. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 13:1-13:20.","mla":"Asadi, Ali, et al. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” 37th International Conference on Concurrency Theory, vol. 391, 13:1-13:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.13.","short":"A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.","apa":"Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13"},"volume":391,"corr_author":"1","file_date_updated":"2026-09-17T09:43:28Z","doi":"10.4230/LIPIcs.CONCUR.2026.13","year":"2026","OA_place":"publisher","author":[{"full_name":"Asadi, Ali","last_name":"Asadi","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8595-0587","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","last_name":"Kafshdar Goharshadi","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan"},{"full_name":"Kebis, Pavol","last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol"},{"full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","last_name":"Mallik"}],"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774475"]},"project":[{"name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Interface Theory for Security and Privacy","grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"external_id":{"arxiv":["2606.29420"]},"das_tickbox":"0","publication":"37th International Conference on Concurrency Theory","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_size":1175682,"file_name":"2026_LIPIcsCONCUR_Asadi.pdf","date_created":"2026-09-17T09:43:28Z","date_updated":"2026-09-17T09:43:28Z","relation":"main_file","access_level":"open_access","file_id":"22946","checksum":"de9af748d78fa42c173f68a71cbbd8d9"}],"language":[{"iso":"eng"}],"date_published":"2026-08-24T00:00:00Z","abstract":[{"text":"Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the right to move the token is determined by the current vertex. In traditional bidding games - referred to as pure bidding games - the right to move the token is determined at each step through bidding; here we consider Richman bidding, where the winning player of a bid pays the losing player. The winner is decided based on a temporal or quantitative specification evaluated over the resulting infinite play.\r\nIn this work, we combine turn-based games and pure bidding games into generalized bidding games, with player-1 vertices, player-2 vertices, and bidding vertices. This natural and simple generalization of bidding games has far-reaching consequences. First, we show that, as a model, generalized bidding games are more expressive than pure bidding games, and we provide several applications. Second, and most importantly, we show that generalized Richman bidding games are structurally equivalent to simple stochastic games, a well-studied model: they are linearly interreducible to each other. As was previously known, the special case of pure Richman bidding games corresponds to random-turn games. In other words, generalized bidding games extend pure bidding games in the same way that simple stochastic games extend random-turn games. We use this connection to solve generalized Richman bidding games for temporal (parity) and quantitative (mean-payoff and discounted-sum) specifications. From a computational perspective, we establish that generalized bidding games with parity and mean-payoff specifications retain the best known upper bounds for turn-based games and pure bidding games, namely NP∩coNP.\r\nFinally, we study a repair problem that asks whether bidding vertices can be assigned \"owners\" so as to bring the threshold budget required to win the game below a given target. This problem has direct applications in compositional policy synthesis for multi-objective settings, and we show it to be NP-complete.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","article_number":"13:1-13:20","status":"public","ec_funded":1,"day":"24","conference":{"location":"Liverpool, United Kingdom","end_date":"2026-09-04","start_date":"2026-09-01","name":"CONCUR: Conference on Concurrency Theory"},"title":"Generalized bidding games: Where bidding and stochastic games meet","intvolume":" 391","arxiv":1,"oa":1,"date_updated":"2026-09-17T09:44:41Z","date_created":"2026-09-13T22:01:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Bidding Games","Stochastic Games"],"supplementarymaterial":"yes","_id":"22920","article_processing_charge":"Yes","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.13","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"]},{"year":"2026","doi":"10.4230/LIPIcs.CONCUR.2026.12","OA_place":"publisher","file_date_updated":"2026-09-17T09:50:00Z","corr_author":"1","citation":{"chicago":"Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.","apa":"Asadi, A., Chatterjee, K., & Kebis, P. (2026). PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","mla":"Asadi, Ali, et al. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” 37th International Conference on Concurrency Theory, vol. 391, 12:1-12:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.12.","short":"A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","ieee":"A. Asadi, K. Chatterjee, and P. Kebis, “PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","ista":"Asadi A, Chatterjee K, Kebis P. 2026. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 12:1-12:23.","ama":"Asadi A, Chatterjee K, Kebis P. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.12"},"volume":391,"researchdata_availability":"no","OA_type":"gold","type":"conference","acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), and ERC-2020-AdG 101020093\r\n(VAMOS) grants.","alternative_title":["LIPIcs"],"department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Reachability is the most fundamental logical objective, yet it is notoriously difficult to learn in reinforcement learning settings: even for Markov decision processes, PAC learning of reachability is impossible without additional assumptions. This difficulty also holds in turn-based stochastic games (TBSGs), where two adversarial players interact on a finite state space. In this work, we consider turn-based stochastic games with reachability objectives. For such settings, adversarial learning, in which players are adversarial even in the learning phase, is impossible. Therefore, the goal is to consider learning, in which both players learn the unknown model together. In this spirit, previous literature on PAC learning in TBSGs considers (a) public information shared by both players; and (b) centralized learning, which means that players share the same learning algorithm. In this work, our contribution is two-fold. First, we relax these strong assumptions and ensure learning: (i) with private information not shared with the other player; and (ii) decentralized learning where the players do not share the same learning algorithm. To the best of our knowledge, this work is the first positive result for decentralized and private information learning of TBSGs with reachability objectives. Second, we introduce a game-theoretic generalization of the Expected Conditional Distance (ECD) parameter, which measures the expected length of reaching the target set. We establish a polynomial-sample complexity bound with respect to the number of states, actions, ECD parameter, and inverses of error tolerance and failure probability."}],"file":[{"relation":"main_file","file_id":"22947","access_level":"open_access","checksum":"2e6c55b65d9d7ce436a6f59e81d7ba17","file_name":"2026_LIPIcsCONCUR_Asadi2.pdf","date_updated":"2026-09-17T09:50:00Z","date_created":"2026-09-17T09:50:00Z","success":1,"creator":"dernst","content_type":"application/pdf","file_size":959234}],"language":[{"iso":"eng"}],"date_published":"2026-08-24T00:00:00Z","das_tickbox":"0","external_id":{"arxiv":["2607.14877"]},"publication":"37th International Conference on Concurrency Theory","publication_identifier":{"isbn":["9783959774475"],"eissn":["1868-8969"]},"project":[{"_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Interface Theory for Security and Privacy","grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"author":[{"last_name":"Asadi","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pavol","last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","full_name":"Kebis, Pavol"}],"arxiv":1,"title":"PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance","intvolume":" 391","day":"24","conference":{"start_date":"2026-09-01","name":"CONCUR: Conference on Concurrency Theory","location":"Liverpool, United Kingdom","end_date":"2026-09-04"},"ec_funded":1,"status":"public","article_number":"12:1-12:23","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","ddc":["000"],"fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"Yes","_id":"22919","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-09-13T22:01:53Z","date_updated":"2026-09-17T09:51:25Z","keyword":["formal methods","games and logic","logical aspects of AI","model checking"],"supplementarymaterial":"yes","oa":1},{"oa":1,"date_created":"2026-09-05T15:59:19Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-09-18T07:41:29Z","degree_awarded":"PhD","_id":"22808","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","month":"09","fulldoi":"https://doi.org/10.15479/AT-ISTA-22808","ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","ec_funded":1,"day":"07","title":"Monitoring algorithmic fairness in sequential decision making","author":[{"last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin"}],"page":"183","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-089-3"]},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"language":[{"iso":"eng"}],"date_published":"2026-09-07T00:00:00Z","file":[{"content_type":"application/zip","creator":"kkueffne","file_size":26356903,"access_level":"closed","file_id":"22903","relation":"source_file","checksum":"716ce44a6ed9a727f231bdebdeecc741","file_name":"Thesis_Konstantin_Kueffner-3.zip","date_created":"2026-09-11T07:32:13Z","date_updated":"2026-09-11T07:32:13Z"},{"file_name":"Thesis_Konstantin_Kueffner-2.pdf","date_created":"2026-09-11T07:32:17Z","date_updated":"2026-09-11T07:32:17Z","file_id":"22904","relation":"main_file","access_level":"open_access","checksum":"77082e90b8330fb46f585843840c5d5c","creator":"kkueffne","content_type":"application/pdf","file_size":10051715}],"doi_confirm":"1","abstract":[{"text":"As automated decision-makers have become ubiquitous in many domains of life,\r\ntheir decisions have become increasingly consequential. Recent years have shown\r\nthat such systems can exhibit discriminatory behaviour against individuals and\r\nsocial groups alike, thereby amplifying existing biases and entrenching\r\nsocio-economic disparities over time. Algorithmic fairness addresses this\r\nproblem by developing methods to quantify and mitigate unfair behaviour.\r\nHowever, much of the existing literature studies fairness in a static\r\npre-deployment setting and, therefore, neglects that automated decision-makers are\r\noften deployed in dynamic environments, where their behaviour and the\r\npopulations they affect may change over time.\r\n\r\nThis thesis addresses this gap through the lens of runtime verification.\r\nInstead of treating fairness as a property of a classifier together with a fixed\r\ninput distribution, it reframes fairness as a property of the interaction trace\r\nbetween the decision-maker and its deployment environment. To evaluate such\r\nsequential fairness properties, the thesis develops runtime monitors that\r\nobserve the evolving interaction between the system and the environment and\r\nissue verdicts after each new observation. Because, these monitors are designed to detect\r\nunfair behaviour during deployment, they complement fair training,\r\nauditing, verification, and enforcement by providing an additional layer of mathematically rigorous fairness assurance.\r\n\r\nIn summary, the thesis develops quantitative, trace-based analogues of\r\nclassical group and individual fairness measures and constructs monitors for\r\nthem. This includes monitors for long-run group fairness over Markovian traces,\r\nfor the time-varying welfare of a changing population in a dynamical system, and\r\nfor the individual fairness of an arbitrary system generating a trace of inputs\r\nand outputs. To achieve this, the monitors combine ideas from runtime\r\nverification, sequential statistics, and nearest-neighbour search. In the\r\ngroup-fairness settings, monitoring is primarily a sequential statistical\r\nestimation problem: the monitor must construct statistically sound interval\r\nestimates of fairness values from dependent and partially observed interactions.\r\nIn the individual-fairness setting, the main challenge is computational\r\nefficiency: the monitor must detect individual fairness violations by efficiently comparing the\r\ncurrent decision with all previously observed decisions.\r\n","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\n","type":"dissertation","related_material":{"record":[{"id":"13310","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"14454","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20292"},{"relation":"part_of_dissertation","id":"21090","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"13228"}]},"citation":{"chicago":"Kueffner, Konstantin. “Monitoring Algorithmic Fairness in Sequential Decision Making.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22808.","apa":"Kueffner, K. (2026). Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22808","mla":"Kueffner, Konstantin. Monitoring Algorithmic Fairness in Sequential Decision Making. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22808.","short":"K. Kueffner, Monitoring Algorithmic Fairness in Sequential Decision Making, Institute of Science and Technology Austria, 2026.","ieee":"K. Kueffner, “Monitoring algorithmic fairness in sequential decision making,” Institute of Science and Technology Austria, 2026.","ista":"Kueffner K. 2026. Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria.","ama":"Kueffner K. Monitoring algorithmic fairness in sequential decision making. 2026. doi:10.15479/AT-ISTA-22808"},"file_date_updated":"2026-09-11T07:32:17Z","corr_author":"1","doi":"10.15479/AT-ISTA-22808","OA_place":"publisher","year":"2026","supervisor":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}]},{"has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","department":[{"_id":"ToHe"}],"scopus_import":"1","OA_type":"hybrid","type":"journal_article","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant VAMOS 101020093. Open access funding provided by Institute of Science and Technology (IST Austria).","citation":{"chicago":"Bartocci, Ezio, Marek Chalupa, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” Acta Informatica. Springer Nature, 2025. https://doi.org/10.1007/s00236-025-00509-8.","apa":"Bartocci, E., Chalupa, M., Henzinger, T. A., Nickovic, D., & Oliveira da Costa, A. (2025). Hypernode automata. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-025-00509-8","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” Acta Informatica, vol. 62, no. 4, 43, Springer Nature, 2025, doi:10.1007/s00236-025-00509-8.","short":"E. Bartocci, M. Chalupa, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Acta Informatica 62 (2025).","ieee":"E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” Acta Informatica, vol. 62, no. 4. Springer Nature, 2025.","ista":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Hypernode automata. Acta Informatica. 62(4), 43.","ama":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. Acta Informatica. 2025;62(4). doi:10.1007/s00236-025-00509-8"},"related_material":{"record":[{"relation":"earlier_version","id":"14405","status":"public"}]},"volume":62,"corr_author":"1","file_date_updated":"2026-01-05T12:26:43Z","year":"2025","OA_place":"publisher","doi":"10.1007/s00236-025-00509-8","author":[{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","full_name":"Nickovic, Dejan"},{"full_name":"Oliveira da Costa, Ana","last_name":"Oliveira da Costa","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","first_name":"Ana","orcid":"0000-0002-8741-5799"}],"issue":"4","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"}],"publication_identifier":{"eissn":["1432-0525"],"issn":["0001-5903"]},"external_id":{"arxiv":["2305.02836"]},"publication":"Acta Informatica","file":[{"access_level":"open_access","relation":"main_file","file_id":"20944","checksum":"06ed45a1218ad8464818803ae2968aaf","file_name":"2025_ActaInformatica_Bartocci.pdf","date_updated":"2026-01-05T12:26:43Z","date_created":"2026-01-05T12:26:43Z","creator":"dernst","content_type":"application/pdf","success":1,"file_size":7117003}],"date_published":"2025-12-09T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this work, we present hypernode automata as a specification formalism for hyperproperties of systems whose executions may be misaligned among themselves, such as concurrent systems. These automata consist of nodes labeled with hypernode logic formulas and transitions marked with synchronizing actions. Hypernode logic formulas establish relations between sequences of variable values among different system executions. This logic enables both synchronous and asynchronous analysis of traces. In its asynchronous view on execution traces, hypernode formulas establish relations on the order of value changes for each variable without correlating their timing. In both views, the analysis of different execution traces is synchronized through the transitions of hypernode automata. By combining logic’s declarative nature with automata’s procedural power, hypernode automata seamlessly integrate asynchronicity requirements at the node level with synchronicity between node transitions. We show that the model-checking problem for hypernode automata is decidable for specifications where each node specifies either a synchronous or an asynchronous requirement for the system’s executions, but not both."}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"article_type":"original","article_number":"43","status":"public","ec_funded":1,"day":"09","title":"Hypernode automata","intvolume":" 62","arxiv":1,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-01-05T12:27:41Z","date_created":"2025-12-29T12:07:12Z","_id":"20866","article_processing_charge":"Yes (via OA deal)","month":"12","fulldoi":"https://doi.org/10.1007/s00236-025-00509-8","publisher":"Springer Nature","ddc":["000"]},{"conference":{"end_date":"2025-10-17","location":"Taipei, Taiwan","start_date":"2025-10-13","name":"CCS: Conference on Computer and Communications Security"},"day":"22","title":"Privacy-preserving runtime verification","arxiv":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"ec_funded":1,"status":"public","_id":"21020","article_processing_charge":"Yes (via OA deal)","publisher":"Association for Computing Machinery","fulldoi":"https://doi.org/10.1145/3719027.3765137","month":"11","ddc":["000"],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-01-20T10:17:10Z","date_updated":"2026-03-13T13:37:19Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21401"}]},"citation":{"ieee":"T. A. Henzinger, M. Karimi, and K. S. Thejaswini, “Privacy-preserving runtime verification,” in Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Taipei, Taiwan, 2025, pp. 2774–2787.","ista":"Henzinger TA, Karimi M, Thejaswini KS. 2025. Privacy-preserving runtime verification. Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 2774–2787.","ama":"Henzinger TA, Karimi M, Thejaswini KS. Privacy-preserving runtime verification. In: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2025:2774-2787. doi:10.1145/3719027.3765137","chicago":"Henzinger, Thomas A, Mahyar Karimi, and K. S. Thejaswini. “Privacy-Preserving Runtime Verification.” In Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2774–87. Association for Computing Machinery, 2025. https://doi.org/10.1145/3719027.3765137.","apa":"Henzinger, T. A., Karimi, M., & Thejaswini, K. S. (2025). Privacy-preserving runtime verification. In Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security (pp. 2774–2787). Taipei, Taiwan: Association for Computing Machinery. https://doi.org/10.1145/3719027.3765137","mla":"Henzinger, Thomas A., et al. “Privacy-Preserving Runtime Verification.” Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–87, doi:10.1145/3719027.3765137.","short":"T.A. Henzinger, M. Karimi, K.S. Thejaswini, in:, Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–2787."},"corr_author":"1","file_date_updated":"2026-01-21T07:34:58Z","doi":"10.1145/3719027.3765137","year":"2025","OA_place":"publisher","has_accepted_license":"1","publication_status":"published","oa_version":"Published Version","scopus_import":"1","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"acknowledgement":"This work is a part of projects VAMOS that has received fund-ing from the European Research Council (ERC), grant agreementNo 101020093 and the Austrian Science Fund (FWF) SFB projectSpyCoDe F8502.We thank anonymous reviewers for pointing us to related work [ 3] and for their valuable suggestions that improved this paper.","type":"conference","OA_type":"hybrid","publication_identifier":{"isbn":["9798400715259"]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"}],"publication":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","external_id":{"arxiv":["2505.09276"]},"language":[{"iso":"eng"}],"date_published":"2025-11-22T00:00:00Z","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_size":1241912,"relation":"main_file","file_id":"21024","access_level":"open_access","checksum":"615ffddab6c7285158c2953acec6fa6f","file_name":"2025_CCS_HenzingerT.pdf","date_updated":"2026-01-21T07:34:58Z","date_created":"2026-01-21T07:34:58Z"}],"abstract":[{"lang":"eng","text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\nIn this work, we propose two novel protocols for the privacy-preserving runtime verification of systems against formal sequential specifications. In our first protocol, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. Our second protocol ensures that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocols adapt and improve existing techniques used in cryptography, and more specifically, multi-party computation.\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocols exchange a single message per observation step, after an initialisation phase. This design minimises communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally."}],"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Karimi, Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","last_name":"Karimi","first_name":"Mahyar","orcid":"0009-0005-0820-1696"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"page":"2774-2787"},{"oa_version":"Published Version","publication_status":"published","has_accepted_license":"1","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85 and by the ERC Advanced Grant VAMOS 101020093.","type":"conference","OA_type":"gold","scopus_import":"1","alternative_title":["LIPIcs"],"department":[{"_id":"ToHe"}],"file_date_updated":"2026-02-11T09:33:20Z","corr_author":"1","volume":360,"citation":{"ama":"Chalupa M, Henzinger TA, Oliveira da Costa AA. Flavors of quantifiers in hyperlogics. In: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:20:1-20:18. doi:10.4230/LIPICS.FSTTCS.2025.20","ieee":"M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Flavors of quantifiers in hyperlogics,” in 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pilani, India, 2025, vol. 360, p. 20:1-20:18.","ista":"Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Flavors of quantifiers in hyperlogics. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 20:1-20:18.","mla":"Chalupa, Marek, et al. “Flavors of Quantifiers in Hyperlogics.” 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1-20:18, doi:10.4230/LIPICS.FSTTCS.2025.20.","short":"M. Chalupa, T.A. Henzinger, A.A. Oliveira da Costa, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1-20:18.","chicago":"Chalupa, Marek, Thomas A Henzinger, and Ana A Oliveira da Costa. “Flavors of Quantifiers in Hyperlogics.” In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 360:20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPICS.FSTTCS.2025.20.","apa":"Chalupa, M., Henzinger, T. A., & Oliveira da Costa, A. A. (2025). Flavors of quantifiers in hyperlogics. In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 360, p. 20:1-20:18). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.FSTTCS.2025.20"},"OA_place":"publisher","doi":"10.4230/LIPICS.FSTTCS.2025.20","year":"2025","page":"20:1-20:18","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Oliveira da Costa, Ana A","last_name":"Oliveira da Costa","id":"8b282559-50b0-11ef-861e-d6ace0d92e9b","first_name":"Ana A"}],"publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","external_id":{"arxiv":["2510.12298"]},"project":[{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"abstract":[{"lang":"eng","text":"Hypertrace logic is a sorted first-order logic with separate sorts for time and execution traces. Its formulas specify hyperproperties, which are properties relating multiple traces. In this work, we extend hypertrace logic by introducing trace quantifiers that range over the set of all possible traces. In this extended logic, formulas can quantify over two kinds of trace variables: constrained trace variables, which range over a fixed set of traces defined by the model, and unconstrained trace variables, which can be assigned to any trace. In comparison, hyperlogics such as HyperLTL have only constrained trace quantifiers. We use hypertrace logic to study how different quantifier patterns affect the decidability of the satisfiability problem. We prove that hypertrace logic without constrained trace quantifiers is equivalent to monadic second-order logic of one successor (S1S), and therefore satisfiable, and that the trace-prefixed fragment (all trace quantifiers precede all time quantifiers) is equivalent to HyperQPTL. Moreover, we show that all hypertrace formulas where the only alternation between constrained trace quantifiers is from an existential to a universal quantifier are equisatisfiable to formulas without constraints on their trace variables and, therefore, decidable as well. Our framework allows us to study also time-prefixed hyperlogics, for which we provide new decidability and undecidability results."}],"date_published":"2025-12-09T00:00:00Z","language":[{"iso":"eng"}],"file":[{"checksum":"8188ee5c7b14193d48eeb655e9bbdc47","relation":"main_file","access_level":"open_access","file_id":"21213","date_created":"2026-02-11T09:33:20Z","date_updated":"2026-02-11T09:33:20Z","file_name":"2025_LIPIcS_Chalupa.pdf","file_size":933970,"content_type":"application/pdf","creator":"dernst","success":1}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","ec_funded":1,"status":"public","conference":{"location":"Pilani, India","end_date":"2025-12-19","name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","start_date":"2025-12-17"},"day":"09","arxiv":1,"intvolume":" 360","title":"Flavors of quantifiers in hyperlogics","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-01-29T15:39:15Z","date_updated":"2026-02-11T09:35:04Z","article_processing_charge":"No","_id":"21089","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"12","fulldoi":"https://doi.org/10.4230/LIPICS.FSTTCS.2025.20"},{"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publication_identifier":{"eisbn":["9783032054357"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication":"25th International Conference on Runtime Verification","external_id":{"arxiv":["2507.11987"]},"date_published":"2025-09-13T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2507.11987"}],"abstract":[{"text":"Neural certificates have emerged as a powerful tool in cyber-physical systems control, providing witnesses of correctness. These certificates, such as barrier functions, often learned alongside control policies, once verified, serve as mathematical proofs of system safety. However, traditional formal verification of their defining conditions typically faces scalability challenges due to exhaustive state-space exploration. To address this challenge, we propose a lightweight runtime monitoring framework that integrates real-time verification and does not require access to the underlying control policy. Our monitor observes the system during deployment and performs on-the-fly verification of the certificate over a lookahead region to ensure safety within a finite prediction horizon. We instantiate this framework for ReLU-based control barrier functions and demonstrate its practical effectiveness in a case study. Our approach enables timely detection of safety violations and incorrect certificates with minimal overhead, providing an effective but lightweight alternative to the static verification of the certificates.","lang":"eng"}],"author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin"},{"full_name":"Yu, Zhengqi","last_name":"Yu","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi","orcid":"0000-0002-4993-773X"}],"page":"54-72","volume":16087,"citation":{"ama":"Henzinger TA, Kueffner K, Yu E. Formal verification of neural certificates done dynamically. In: 25th International Conference on Runtime Verification. Vol 16087. Springer Nature; 2025:54-72. doi:10.1007/978-3-032-05435-7_4","ista":"Henzinger TA, Kueffner K, Yu E. 2025. Formal verification of neural certificates done dynamically. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 54–72.","ieee":"T. A. Henzinger, K. Kueffner, and E. Yu, “Formal verification of neural certificates done dynamically,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 54–72.","short":"T.A. Henzinger, K. Kueffner, E. Yu, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 54–72.","mla":"Henzinger, Thomas A., et al. “Formal Verification of Neural Certificates Done Dynamically.” 25th International Conference on Runtime Verification, vol. 16087, Springer Nature, 2025, pp. 54–72, doi:10.1007/978-3-032-05435-7_4.","apa":"Henzinger, T. A., Kueffner, K., & Yu, E. (2025). Formal verification of neural certificates done dynamically. In 25th International Conference on Runtime Verification (Vol. 16087, pp. 54–72). Graz, Austria: Springer Nature. https://doi.org/10.1007/978-3-032-05435-7_4","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Emily Yu. “Formal Verification of Neural Certificates Done Dynamically.” In 25th International Conference on Runtime Verification, 16087:54–72. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-05435-7_4."},"corr_author":"1","year":"2025","OA_place":"repository","doi":"10.1007/978-3-032-05435-7_4","publication_status":"published","oa_version":"Preprint","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","type":"conference","OA_type":"green","_id":"21091","article_processing_charge":"No","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/978-3-032-05435-7_4","month":"09","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-02-16T11:53:25Z","date_created":"2026-01-29T16:03:01Z","conference":{"location":"Graz, Austria","end_date":"2025-09-19","start_date":"2025-09-15","name":"RV: Runtime Verification"},"day":"13","intvolume":" 16087","title":"Formal verification of neural certificates done dynamically","arxiv":1,"quality_controlled":"1","status":"public","ec_funded":1},{"arxiv":1,"intvolume":" 16087","title":"Alignment monitoring","conference":{"location":"Graz, Austria","end_date":"2025-09-19","name":"RV: Runtime Verification","start_date":"2025-09-15"},"day":"13","ec_funded":1,"status":"public","quality_controlled":"1","publisher":"Springer Nature","month":"09","fulldoi":"https://doi.org/10.1007/978-3-032-05435-7_9","article_processing_charge":"No","_id":"21092","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-02-16T11:56:38Z","date_created":"2026-01-29T16:03:43Z","oa":1,"OA_place":"repository","doi":"10.1007/978-3-032-05435-7_9","year":"2025","corr_author":"1","volume":16087,"citation":{"ista":"Henzinger TA, Kueffner K, Singh V, Sun I. 2025. Alignment monitoring. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 140–159.","ieee":"T. A. Henzinger, K. Kueffner, V. Singh, and I. Sun, “Alignment monitoring,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 140–159.","ama":"Henzinger TA, Kueffner K, Singh V, Sun I. Alignment monitoring. In: 25th International Conference on Runtime Verification. Vol 16087. Springer Nature; 2025:140-159. doi:10.1007/978-3-032-05435-7_9","chicago":"Henzinger, Thomas A, Konstantin Kueffner, Vasu Singh, and I Sun. “Alignment Monitoring.” In 25th International Conference on Runtime Verification, 16087:140–59. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-05435-7_9.","apa":"Henzinger, T. A., Kueffner, K., Singh, V., & Sun, I. (2025). Alignment monitoring. In 25th International Conference on Runtime Verification (Vol. 16087, pp. 140–159). Graz, Austria: Springer Nature. https://doi.org/10.1007/978-3-032-05435-7_9","short":"T.A. Henzinger, K. Kueffner, V. Singh, I. Sun, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 140–159.","mla":"Henzinger, Thomas A., et al. “Alignment Monitoring.” 25th International Conference on Runtime Verification, vol. 16087, Springer Nature, 2025, pp. 140–59, doi:10.1007/978-3-032-05435-7_9."},"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","type":"conference","OA_type":"green","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"oa_version":"Preprint","publication_status":"published","abstract":[{"lang":"eng","text":"Formal verification provides assurances that a probabilistic system satisfies its specification—conditioned on the system model being aligned with reality. We propose alignment monitoring to watch that this assumption is justified. We consider a probabilistic model well aligned if it accurately predicts the behaviour of an uncertain system in advance. An alignment score measures this by quantifying the similarity between the model’s predicted and the system’s (unknown) actual distributions. An alignment monitor observes the system at runtime; at each point in time it uses the current state and the model to predict the next state. After the next state is observed, the monitor updates the verdict, which is a high-probability interval estimate for the true alignment score. We utilize tools from sequential forecasting to construct our alignment monitors. Besides a monitor for measuring the expected alignment score, we introduce a differential alignment monitor, designed for comparing two models, and a weighted alignment monitor, which permits task-specific alignment monitoring. We evaluate our monitors experimentally on the PRISM benchmark suite. They are fast, memory-efficient, and detect misalignment early."}],"date_published":"2025-09-13T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2508.00021","open_access":"1"}],"publication":"25th International Conference on Runtime Verification","external_id":{"arxiv":["2508.00021"]},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783032054357"],"issn":["0302-9743"]},"page":"140-159","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","last_name":"Kueffner"},{"full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"},{"full_name":"Sun, I","last_name":"Sun","first_name":"I"}]}]