--- OA_place: publisher OA_type: gold _id: '21411' abstract: - lang: eng text: "To achieve fast recovery from link failures, most modern communication networks feature fully\r\ndecentralized fast re-routing mechanisms. These re-routing mechanisms rely on pre-installed static re-routing rules at the nodes (the routers), which depend only on local failure information, namely on the failed links incident to the node. Ideally, a network is perfectly resilient: the re-routing rules ensure that packets are always successfully routed to their destinations as long as the source and the destination are still physically connected in the underlying network after the failures. Unfortunately, there are examples where achieving perfect resilience is not possible. Surprisingly, only very little is known about the algorithmic aspect of when and how perfect resilience can be achieved. We investigate the computational complexity of analyzing such local fast re-routing mechanisms. Our main result is a negative one: we show that even checking whether a given set of static re-routing rules ensures perfect resilience is coNP-complete. Additionally, we investigate other fundamental variations of the problem. In particular, we show that our coNP-completeness proof also applies to scenarios where the re-routing rules have specific patterns (known as skipping in the literature). On the positive side, for scenarios where nodes do not have information about the link from which a packet arrived (the so-called in-port), we present a linear-time algorithm to realize perfect resilience whenever possible (which we show can also be determined in linear time). " acknowledgement: "Matthias Bentert: ERC Horizon 2020 research and innovation programme (grant agreement\r\nNo. 819416) and ERC Consolidator grant AdjustNet (agreement No. 864228).\r\nEsra Ceylan: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378).\r\nStefan Schmid: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378)." alternative_title: - LIPIcs article_number: '31' article_processing_charge: No author: - first_name: Matthias full_name: Bentert, Matthias last_name: Bentert - first_name: Esra full_name: Ceylan, Esra last_name: Ceylan - first_name: Valentin full_name: Hübner, Valentin id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910 last_name: Hübner orcid: 0009-0001-5009-4987 - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jiří full_name: Srba, Jiří last_name: Srba citation: ama: 'Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. Fast re-routing in networks: On the complexity of perfect resilience. In: 29th International Conference on Principles of Distributed Systems. Vol 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.OPODIS.2025.31' apa: 'Bentert, M., Ceylan, E., Hübner, V., Schmid, S., & Srba, J. (2026). Fast re-routing in networks: On the complexity of perfect resilience. In 29th International Conference on Principles of Distributed Systems (Vol. 361). Iaşi, Romania: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2025.31' chicago: 'Bentert, Matthias, Esra Ceylan, Valentin Hübner, Stefan Schmid, and Jiří Srba. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” In 29th International Conference on Principles of Distributed Systems, Vol. 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.OPODIS.2025.31.' ieee: 'M. Bentert, E. Ceylan, V. Hübner, S. Schmid, and J. Srba, “Fast re-routing in networks: On the complexity of perfect resilience,” in 29th International Conference on Principles of Distributed Systems, Iaşi, Romania, 2026, vol. 361.' ista: 'Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. 2026. Fast re-routing in networks: On the complexity of perfect resilience. 29th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 361, 31.' mla: 'Bentert, Matthias, et al. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” 29th International Conference on Principles of Distributed Systems, vol. 361, 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.OPODIS.2025.31.' short: M. Bentert, E. Ceylan, V. Hübner, S. Schmid, J. Srba, in:, 29th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. conference: end_date: 2025-12-05 location: Iaşi, Romania name: 'OPODIS: Conference on Principles of Distributed Systems' start_date: 2025-12-03 date_created: 2026-03-08T23:01:46Z date_published: 2026-01-07T00:00:00Z date_updated: 2026-03-09T12:36:11Z day: '07' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.OPODIS.2025.31 file: - access_level: open_access checksum: a7af114da7c38d2338b4edb922eb27f1 content_type: application/pdf creator: dernst date_created: 2026-03-09T12:33:58Z date_updated: 2026-03-09T12:33:58Z file_id: '21419' file_name: 2026_OPODIS_Bentert.pdf file_size: 1041334 relation: main_file success: 1 file_date_updated: 2026-03-09T12:33:58Z fulldoi: https://doi.org/10.4230/LIPIcs.OPODIS.2025.31 has_accepted_license: '1' intvolume: ' 361' language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: 29th International Conference on Principles of Distributed Systems publication_identifier: eissn: - 1868-8969 isbn: - '9783959774093' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Fast re-routing in networks: On the complexity of perfect resilience' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 361 year: '2026' ... --- OA_place: publisher OA_type: hybrid _id: '21661' abstract: - lang: eng text: Model checking undiscounted reachability and expected-reward properties on Markov decision processes (MDPs) are key for the verification of systems that act under uncertainty. Popular algorithms are policy iteration and variants of value iteration; in tool competitions, most participants rely on the latter. These algorithms generally need worst-case exponential time. However, the problem can equally be formulated as a linear programme, solvable in polynomial time. In this paper, we give a detailed overview of today’s state-of-the-art algorithms for MDP model checking with a focus on performance and correctness. We highlight their fundamental differences, and describe various optimizations and implementation variants. We experimentally compare floating-point and exact-arithmetic implementations of all algorithms on three benchmark sets using two probabilistic model checkers. Our results show that (optimistic) value iteration is a sensible default, but other algorithms are preferable in specific settings. This paper thereby provides a guide for MDP verification practitioners—tool builders and users alike. acknowledgement: "This research was funded by the European Union’s Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreements 101008233 (MISSION)\r\nand 101034413 (IST-BRIDGE), by the Interreg North Sea project STORM_SAFE, by a KI-Starter grant from the Ministerium für Kultur und Wissenschaft NRW, by NWO VENI grant no. 639.021.754, and by NWO VIDI grant VI.Vidi.223.110 (TruSTy). Experiments were performed with computing resources granted by RWTH Aachen University under project rwth1632." article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Arnd full_name: Hartmanns, Arnd last_name: Hartmanns - first_name: Sebastian full_name: Junges, Sebastian last_name: Junges - first_name: Tim full_name: Quatmann, Tim last_name: Quatmann - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger orcid: 0000-0002-0163-2152 citation: ama: Hartmanns A, Junges S, Quatmann T, Weininger M. The revised practitioner’s guide to MDP model checking algorithms. International Journal on Software Tools for Technology Transfer. 2026. doi:10.1007/s10009-026-00848-y apa: Hartmanns, A., Junges, S., Quatmann, T., & Weininger, M. (2026). The revised practitioner’s guide to MDP model checking algorithms. International Journal on Software Tools for Technology Transfer. Springer Nature. https://doi.org/10.1007/s10009-026-00848-y chicago: Hartmanns, Arnd, Sebastian Junges, Tim Quatmann, and Maximilian Weininger. “The Revised Practitioner’s Guide to MDP Model Checking Algorithms.” International Journal on Software Tools for Technology Transfer. Springer Nature, 2026. https://doi.org/10.1007/s10009-026-00848-y. ieee: A. Hartmanns, S. Junges, T. Quatmann, and M. Weininger, “The revised practitioner’s guide to MDP model checking algorithms,” International Journal on Software Tools for Technology Transfer. Springer Nature, 2026. ista: Hartmanns A, Junges S, Quatmann T, Weininger M. 2026. The revised practitioner’s guide to MDP model checking algorithms. International Journal on Software Tools for Technology Transfer. mla: Hartmanns, Arnd, et al. “The Revised Practitioner’s Guide to MDP Model Checking Algorithms.” International Journal on Software Tools for Technology Transfer, Springer Nature, 2026, doi:10.1007/s10009-026-00848-y. short: A. Hartmanns, S. Junges, T. Quatmann, M. Weininger, International Journal on Software Tools for Technology Transfer (2026). date_created: 2026-04-05T22:01:32Z date_published: 2026-03-09T00:00:00Z date_updated: 2026-04-07T09:52:54Z day: '09' ddc: - '000' department: - _id: KrCh doi: 10.1007/s10009-026-00848-y ec_funded: 1 fulldoi: https://doi.org/10.1007/s10009-026-00848-y has_accepted_license: '1' keyword: - Quantitative model checking - Markov decision process - Linear programming - Value iteration - Policy iteration language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/s10009-026-00848-y month: '03' oa: 1 oa_version: Published Version project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: International Journal on Software Tools for Technology Transfer publication_identifier: eissn: - 1433-2787 issn: - 1433-2779 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '21668' relation: software status: public scopus_import: '1' status: public title: The revised practitioner’s guide to MDP model checking algorithms tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: repository OA_type: green _id: '21717' abstract: - lang: eng text: Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An objective is a set of runs (or infinite trajectories) of the RMDP, and the value for an objective is the maximal probability that the agent can guarantee against the adversarial environment. We consider (a) reachability objectives, where given a target set of states, the goal is to eventually arrive at one of them; and (b) parity objectives, which are a canonical representation for ω-regular objectives. The qualitative analysis problem asks whether the objective can be ensured with probability 1. In this work, we study the qualitative problem for reachability and parity objectives on RMDPs without making any assumption over the structures of the RMDPs, e.g., unichain or aperiodic. Our contributions are twofold. We first present efficient algorithms with oracle access to uncertainty sets that solve qualitative problems of reachability and parity objectives. We then report experimental results demonstrating the effectiveness of our oracle-based approach on classical RMDP examples from the literature scaling up to thousands of states. acknowledgement: This work was supported by ERC CoG 863818 (ForMSMArt) and Austrian Science Fund (FWF) 10.55776/COE12. We also thank Hossein Zakerinia for his helpful feedback. article_processing_charge: No arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Mehrdad full_name: Karrabi, Mehrdad id: 67638922-f394-11eb-9cf6-f20423e08757 last_name: Karrabi orcid: 0009-0007-5253-9170 - first_name: Ali full_name: Shafiee, Ali id: 2783031a-7378-11f0-b2d0-f17f1db2ebad last_name: Shafiee citation: ama: 'Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. Qualitative analysis of ω-regular objectives on robust MDPs. In: Proceedings of the 40th AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36137-36145. doi:10.1609/aaai.v40i43.40931' apa: 'Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., & Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In Proceedings of the 40th AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v40i43.40931' chicago: Asadi, Ali, Krishnendu Chatterjee, Ehsan Goharshady, Mehrdad Karrabi, and Ali Shafiee. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” In Proceedings of the 40th AAAI Conference on Artificial Intelligence, 40:36137–45. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40931. ieee: A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in Proceedings of the 40th AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145. ista: 'Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. 2026. Qualitative analysis of ω-regular objectives on robust MDPs. Proceedings of the 40th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36137–36145.' mla: Asadi, Ali, et al. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” Proceedings of the 40th AAAI Conference on Artificial Intelligence, vol. 40, no. 43, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–45, doi:10.1609/aaai.v40i43.40931. short: A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, A. Shafiee, in:, Proceedings of the 40th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–36145. conference: end_date: 2026-01-27 location: Singapore, Singapore name: 'AAAI: Conference on Artificial Intelligence' start_date: 2026-01-20 date_created: 2026-04-12T22:01:50Z date_published: 2026-03-14T00:00:00Z date_updated: 2026-09-16T07:27:43Z day: '14' department: - _id: KrCh - _id: GradSch doi: 10.1609/aaai.v40i43.40931 ec_funded: 1 external_id: arxiv: - '2505.04539' fulldoi: https://doi.org/10.1609/aaai.v40i43.40931 intvolume: ' 40' issue: '43' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2505.04539 month: '03' oa: 1 oa_version: Preprint page: 36137-36145 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Proceedings of the 40th AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: Qualitative analysis of ω-regular objectives on robust MDPs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 40 year: '2026' ... --- OA_place: repository OA_type: green _id: '21722' abstract: - lang: eng text: 'Partially observable Markov decision processes (POMDPs) are a central model for uncertainty in sequential decision making. The most basic objective is the reachability objective, where a target set must be eventually visited, and the more general parity objectives can model all omega-regular specifications. For such objectives, the computational analysis problems are the following: (a) qualitative analysis that asks whether the objective can be satisfied with probability 1 (almost-sure winning) or probability arbitrarily close to 1 (limit-sure winning); and (b) quantitative analysis that asks for the approximation of the optimal probability of satisfying the objective. For general POMDPs, almost-sure analysis for reachability objectives is EXPTIME-complete, but limit-sure and quantitative analyses for reachability objectives are undecidable; almost-sure, limit-sure, and quantitative analyses for parity objectives are all undecidable. A special class of POMDPs, called revealing POMDPs, has been studied recently in several works, and for this subclass the almost-sure analysis for parity objectives was shown to be EXPTIME-complete. In this work, we show that for revealing POMDPs the limit-sure analysis for parity objectives is EXPTIME-complete, and even the quantitative analysis for parity objectives can be achieved in EXPTIME.' acknowledgement: "This work was partially supported by the ANRT under the French CIFRE Ph.D program in collaboration between NyxAir and Paris-Dauphine University (Contract: CIFRE N° 2022/0513), by the French Agence Nationale de la Recherche (ANR) under reference ANR-21-CE40-\r\n0020 (CONVERGENCE project), by Austrian Science Fund (FWF) 10.55776/COE12, and by the ERC CoG 863818 (ForM-SMArt) grant." article_processing_charge: No arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: David full_name: Lurie, David id: 579a6c20-34cf-11f1-acbd-8c2f19cdb4da last_name: Lurie - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: 'Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36146-36154. doi:10.1609/aaai.v40i43.40932' apa: 'Asadi, A., Chatterjee, K., Lurie, D., & Saona Urmeneta, R. J. (2026). Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36146–36154). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v40i43.40932' chicago: 'Asadi, Ali, Krishnendu Chatterjee, David Lurie, and Raimundo J Saona Urmeneta. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” In Proceedings of the AAAI Conference on Artificial Intelligence, 40:36146–54. Association for the Advancement of Artificial Intelligence, 2026. https://doi.org/10.1609/aaai.v40i43.40932.' ieee: 'A. Asadi, K. Chatterjee, D. Lurie, and R. J. Saona Urmeneta, “Revealing POMDPs: Qualitative and quantitative analysis for parity objectives,” in Proceedings of the AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36146–36154.' ista: 'Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. 2026. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36146–36154.' mla: 'Asadi, Ali, et al. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 43, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–54, doi:10.1609/aaai.v40i43.40932.' short: A. Asadi, K. Chatterjee, D. Lurie, R.J. Saona Urmeneta, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–36154. conference: end_date: 2026-01-27 location: Singapore, Singapore name: 'AAAI: Conference on Artificial Intelligence' start_date: 2026-01-20 corr_author: '1' date_created: 2026-04-12T22:01:52Z date_published: 2026-03-14T00:00:00Z date_updated: 2026-09-16T07:28:33Z day: '14' department: - _id: KrCh doi: 10.1609/aaai.v40i43.40932 ec_funded: 1 external_id: arxiv: - '2511.13134' fulldoi: https://doi.org/10.1609/aaai.v40i43.40932 intvolume: ' 40' issue: '43' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2511.13134 month: '03' oa: 1 oa_version: Preprint page: 36146-36154 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Proceedings of the AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: 'Revealing POMDPs: Qualitative and quantitative analysis for parity objectives' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 40 year: '2026' ... --- OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '22102' abstract: - lang: eng text: 'Differential privacy (DP) has established itself as one of the standards for ensuring privacy of individual data. However, reasoning about DP is a challenging and error-prone task, hence methods for formal verification and refutation of DP properties have received significant interest in recent years. In this work, we present a novel method for automated formal refutation of є-DP. Our method refutes є-DP by searching for a pair of inputs together with a non-negative function over outputs whose expected value on these two inputs differs by a significant amount. The two inputs and the non-negative function over outputs are computed simultaneously, by utilizing upper expectation supermartingales and lower expectation submartingales from probabilistic program analysis, which we leverage to introduce a sound and complete proof rule for є-DP refutation. To the best of our knowledge, our method is the first method for є-DP refutation to offer the following four desirable features: (1) it is fully automated, (2) it is applicable to stochastic mechanisms with sampling instructions from both discrete and continuous distributions, (3) it provides soundness guarantees, and (4) it provides semi-completeness guarantees. Our experiments show that our prototype tool SuperDP achieves superior performance compared to the state of the art and manages to refute є-DP for a number of challenging examples collected from the literature, including ones that were out of the reach of prior methods.' acknowledgement: "The authors would like to thank Petr Novotný for valuable discussions that helped shape this work.\r\nThis research was supported by the Singapore Ministry of Education (MOE) Academic Research\r\nFund (AcRF) Tier 1 grant (Proposal ID: 25-SIS-SMU-009), Vienna Science and Technology Fund\r\n(WWTF), State of Lower Austria [Grant ID 10.47379/ICT25017], ERC CoG 863818 (ForM-SMArt),\r\nand Austrian Science Fund (FWF) 10.55776/COE12." article_number: '218' article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: 'Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. 2026;10(PLDI). doi:10.1145/3808296' apa: 'Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3808296' chicago: 'Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” Proceedings of the ACM on Programming Languages. ACM, 2026. https://doi.org/10.1145/3808296.' ieee: 'K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential privacy refutation via supermartingales,” Proceedings of the ACM on Programming Languages, vol. 10, no. PLDI. ACM, 2026.' ista: 'Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. 10(PLDI), 218.' mla: 'Chatterjee, Krishnendu, et al. “SuperDP: Differential Privacy Refutation via Supermartingales.” Proceedings of the ACM on Programming Languages, vol. 10, no. PLDI, 218, ACM, 2026, doi:10.1145/3808296.' short: K. Chatterjee, E. Goharshady, D. Zikelic, Proceedings of the ACM on Programming Languages 10 (2026). corr_author: '1' das_tickbox: '1' dataavailabilitystatement: "The artifact supporting the findings of this study, which includes the underlying datasets, software\r\ncode, and experiments, is publicly available in Zenodo https://zenodo.org/records/19399862." date_created: 2026-06-21T22:02:59Z date_published: 2026-06-08T00:00:00Z date_updated: 2026-09-16T07:36:14Z day: '08' ddc: - '000' department: - _id: KrCh doi: 10.1145/3808296 ec_funded: 1 external_id: arxiv: - '2603.26215' file: - access_level: open_access checksum: 994bf21d6269dabccf1e1091e02962c5 content_type: application/pdf creator: dernst date_created: 2026-06-24T06:19:56Z date_updated: 2026-06-24T06:19:56Z file_id: '22135' file_name: 2026_ProcACMProgrammingLanguages_Chatterjee.pdf file_size: 858595 relation: main_file success: 1 file_date_updated: 2026-06-24T06:19:56Z fulldoi: https://doi.org/10.1145/3808296 has_accepted_license: '1' intvolume: ' 10' issue: PLDI keyword: - Static Program Analysis - Differential Privacy - Probabilistic Programming - Martingales language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '22134' relation: research_data status: public researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: no title: 'SuperDP: Differential privacy refutation via supermartingales' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '22101' abstract: - lang: eng text: "Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects." acknowledgement: "J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012." article_number: '5325' article_processing_charge: Yes article_type: original author: - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 - first_name: Hossein full_name: Nemati, Hossein last_name: Nemati - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Kamran full_name: Kaveh, Kamran last_name: Kaveh - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. Nature Communications. 2026;17. doi:10.1038/s41467-026-71777-2 apa: Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-71777-2 chicago: Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-71777-2. ieee: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” Nature Communications, vol. 17. Springer Nature, 2026. ista: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325. mla: Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” Nature Communications, vol. 17, 5325, Springer Nature, 2026, doi:10.1038/s41467-026-71777-2. short: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026). corr_author: '1' das_tickbox: '1' dataavailabilitystatement: Correspondence and requests for materials should be addressed to Krishnendu Chatterjee. date_created: 2026-06-21T22:02:59Z date_published: 2026-12-01T00:00:00Z date_updated: 2026-09-16T07:36:49Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41467-026-71777-2 ec_funded: 1 external_id: pmid: - '41997932' file: - access_level: open_access checksum: b660048bb271f24d6763803e247d5c32 content_type: application/pdf creator: dernst date_created: 2026-06-24T06:50:24Z date_updated: 2026-06-24T06:50:24Z file_id: '22136' file_name: 2026_NatureComm_Svoboda.pdf file_size: 1068919 relation: main_file success: 1 file_date_updated: 2026-06-24T06:50:24Z fulldoi: https://doi.org/10.1038/s41467-026-71777-2 has_accepted_license: '1' intvolume: ' 17' language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: The effect of the fitness gradient on fixation probability tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2026' ... --- OA_place: repository OA_type: green _id: '22134' abstract: - lang: eng text: This artifact provides the source code, benchmarks, and scripts necessary to build and reproduce the experimental results for `SuperDP` (Accepted at PLDI 2026). It also includes instructions for running the tool on user-provided inputs. article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: 'Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential Privacy Refutation via Supermartingales. 2026. doi:10.5281/ZENODO.18930113' apa: 'Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo. https://doi.org/10.5281/ZENODO.18930113' chicago: 'Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026. https://doi.org/10.5281/ZENODO.18930113.' ieee: 'K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026.' ista: 'Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential Privacy Refutation via Supermartingales, Zenodo, 10.5281/ZENODO.18930113.' mla: 'Chatterjee, Krishnendu, et al. SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo, 2026, doi:10.5281/ZENODO.18930113.' short: K. Chatterjee, E. Goharshady, D. Zikelic, (2026). corr_author: '1' date_created: 2026-06-24T06:25:29Z date_published: 2026-03-09T00:00:00Z date_updated: 2026-09-16T07:36:13Z day: '09' ddc: - '000' department: - _id: KrCh doi: 10.5281/ZENODO.18930113 fulldoi: https://doi.org/10.5281/ZENODO.18930113 has_accepted_license: '1' main_file_link: - open_access: '1' url: https://doi.org/10.5281/ZENODO.18930113 month: '03' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '22102' relation: used_in_publication status: public status: public title: 'SuperDP: Differential Privacy Refutation via Supermartingales' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22920' abstract: - lang: eng 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." 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" alternative_title: - LIPIcs article_number: 13:1-13:20 article_processing_charge: Yes arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Pavol full_name: Kebis, Pavol id: 2e0132b3-4e98-11ef-b275-cf7281c2802a last_name: Kebis - first_name: Kaushik full_name: Mallik, Kaushik id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598 last_name: Mallik orcid: 0000-0001-9864-7475 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' 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' 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.' 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. conference: end_date: 2026-09-04 location: Liverpool, United Kingdom name: 'CONCUR: Conference on Concurrency Theory' start_date: 2026-09-01 corr_author: '1' das_tickbox: '0' date_created: 2026-09-13T22:01:53Z date_published: 2026-08-24T00:00:00Z date_updated: 2026-09-17T09:44:41Z day: '24' ddc: - '000' department: - _id: GradSch - _id: KrCh - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2026.13 ec_funded: 1 external_id: arxiv: - '2606.29420' file: - access_level: open_access checksum: de9af748d78fa42c173f68a71cbbd8d9 content_type: application/pdf creator: dernst date_created: 2026-09-17T09:43:28Z date_updated: 2026-09-17T09:43:28Z file_id: '22946' file_name: 2026_LIPIcsCONCUR_Asadi.pdf file_size: 1175682 relation: main_file success: 1 file_date_updated: 2026-09-17T09:43:28Z fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2026.13 has_accepted_license: '1' intvolume: ' 391' keyword: - Bidding Games - Stochastic Games language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e grant_number: F8502 name: Interface Theory for Security and Privacy - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 37th International Conference on Concurrency Theory publication_identifier: eissn: - 1868-8969 isbn: - '9783959774475' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: 'Generalized bidding games: Where bidding and stochastic games meet' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 391 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22919' 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.' 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 article_number: 12:1-12:23 article_processing_charge: Yes arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Pavol full_name: Kebis, Pavol id: 2e0132b3-4e98-11ef-b275-cf7281c2802a last_name: Kebis citation: 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' 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' 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.' 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.' 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. conference: end_date: 2026-09-04 location: Liverpool, United Kingdom name: 'CONCUR: Conference on Concurrency Theory' start_date: 2026-09-01 corr_author: '1' das_tickbox: '0' date_created: 2026-09-13T22:01:53Z date_published: 2026-08-24T00:00:00Z date_updated: 2026-09-17T09:51:25Z day: '24' ddc: - '000' department: - _id: GradSch - _id: KrCh - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2026.12 ec_funded: 1 external_id: arxiv: - '2607.14877' file: - access_level: open_access checksum: 2e6c55b65d9d7ce436a6f59e81d7ba17 content_type: application/pdf creator: dernst date_created: 2026-09-17T09:50:00Z date_updated: 2026-09-17T09:50:00Z file_id: '22947' file_name: 2026_LIPIcsCONCUR_Asadi2.pdf file_size: 959234 relation: main_file success: 1 file_date_updated: 2026-09-17T09:50:00Z fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2026.12 has_accepted_license: '1' intvolume: ' 391' keyword: - formal methods - games and logic - logical aspects of AI - model checking language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e grant_number: F8502 name: Interface Theory for Security and Privacy - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 37th International Conference on Concurrency Theory publication_identifier: eissn: - 1868-8969 isbn: - '9783959774475' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: 'PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 391 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22922' abstract: - lang: eng text: In this note, we recall the history and our motivation behind the development of Strategy Logic and we discuss some of the work that ensued from its introduction. acknowledgement: " Krishnendu Chatterjee: Supported in part by the Austrian Science Fund (FWF) COE\r\ngrant 10.55776/COE12 and the ERC CoG 863818 (ForM-SMArt).\r\nThomas A. Henzinger: Supported in part by the ERC AdG 101020093 (VAMOS) and the FWF\r\nSFB grant F8502 (SPyCoDe).\r\nNir Piterman: Supported in part by the Swedish research council (VR) project no. 2025-05419 and\r\nthe Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and\r\nAlice Wallenberg Foundation.\r\nAcknowledgements We thank the jury that our paper introducing Strategy Logic at the Conference\r\non Concurrency Theory (CONCUR) 2007 [10] was chosen for a CONCUR Test-of-Time Award at\r\nCONCUR 2026." alternative_title: - LIPIcs article_number: 6:1-6:7 article_processing_charge: Yes author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Nir full_name: Piterman, Nir last_name: Piterman citation: ama: 'Chatterjee K, Henzinger TA, Piterman N. A look back at strategy logic. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.6' apa: 'Chatterjee, K., Henzinger, T. A., & Piterman, N. (2026). A look back at strategy logic. 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.6' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “A Look Back at Strategy Logic.” 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.6. ieee: K. Chatterjee, T. A. Henzinger, and N. Piterman, “A look back at strategy logic,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391. ista: 'Chatterjee K, Henzinger TA, Piterman N. 2026. A look back at strategy logic. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 6:1-6:7.' mla: Chatterjee, Krishnendu, et al. “A Look Back at Strategy Logic.” 37th International Conference on Concurrency Theory, vol. 391, 6:1-6:7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.6. short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. conference: end_date: 2026-09-04 location: Liverpool, United Kingdom name: 'CONCUR: Conference on Concurrency Theory' start_date: 2026-09-01 corr_author: '1' das_tickbox: '0' date_created: 2026-09-13T22:01:54Z date_published: 2026-08-24T00:00:00Z date_updated: 2026-09-22T05:54:30Z day: '24' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2026.6 ec_funded: 1 file: - access_level: open_access checksum: f3995df175701f56a702bdb012e4f710 content_type: application/pdf creator: dernst date_created: 2026-09-22T05:53:16Z date_updated: 2026-09-22T05:53:16Z file_id: '22977' file_name: 2026_LIPIcsCONCUR_Chatterjee.pdf file_size: 517651 relation: main_file success: 1 file_date_updated: 2026-09-22T05:53:16Z fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2026.6 has_accepted_license: '1' intvolume: ' 391' keyword: - Strategy Logic - Games - Automata language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software - _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e grant_number: F8502 name: Interface Theory for Security and Privacy publication: 37th International Conference on Concurrency Theory publication_identifier: isbn: - '9783959774475' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: A look back at strategy logic tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 391 year: '2026' ... --- OA_place: publisher _id: '23079' abstract: - lang: eng text: "We study the computational aspects of the two central solution concepts of stochastic games\r\nplayed on finite graphs for an infinite number of steps: the value in two-player zero-sum\r\ngames, and Nash equilibria in multi-player games. In both settings, exact solutions are in\r\ntractable. Fortwo-playerzero-sumconcurrentstochasticgames,valuescanbeirrational,and\r\nthe associated decision problem is SQRT-SUM hard. For multi-player turn-based stochastic\r\ngames,theequilibriumprobabilitiescanbeirrational,anddecidingtheconstrainedexistence\r\nof a Nash equilibrium is undecidable in the presence of memory, and ∃R-complete when the\r\nplayers are restricted to stationary strategies. Hence, in both settings, the natural computational problem is the approximation of the solution within an arbitrary additive error. In\r\nthis thesis, we present improved complexity results and algorithms for such approximation\r\nproblems.\r\nThe first part of the thesis considers two-player zero-sum concurrent stochastic games\r\nwith two classic objectives: (a) stateful-discounted objectives, which are similar to the classic\r\ndiscounted-sum objectives, but states are associated with different discount factors rather\r\nthan a single discount factor; and (b) parity objectives, which are a canonical representation\r\nfor ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount\r\nfactors, the limit value is the limit of the value of the stateful-discounted objectives, as\r\nthe discount factors approach zero according to the given order. The value-approximation\r\nproblem is known to be in EXPSPACE for the limit value of stateful-discounted objectives and\r\nin PSPACEforparityobjectives,andthebest-knownalgorithmsforbothproblemsareatleast\r\nexponential time, with an exponential dependence on the number of states and actions. Our\r\nmain results for the value-approximation problem for the limit value of stateful-discounted\r\nobjectives and parity objectives areas follows: (a)we establish TFNPNP complexity; and (b)we\r\npresent algorithms that improve the dependency on the number of actions in the exponent\r\nfrom linear to logarithmic. In particular, if the number of states is constant, our algorithms\r\nrun in polynomial time.\r\nThe second part of the thesis considers multi-player turn-based stochastic games with\r\nterminal payoffs, where the players are restricted to stationary strategies. We study the\r\napproximate constrained existence problem of Nash equilibria: given a game that has a Nash\r\nequilibrium in which the payoff of every player lies in a given interval, compute a strategy\r\nprofile that is an ε-Nash equilibrium and that satisfies the same constraints up to an additive\r\nerror ε. Our main results are as follows: (a) we present an FNPNP algorithm for the problem;\r\nand(b)we establish that its decision version is NP-hard, already with two players. For the\r\nupperbound,weshowthatifaconstrainedNashequilibriumexists,thenthereexists one\r\nin which the non-zero probabilities are at least an inverse of a double-exponential in the\r\ni\r\ninput size, and that such a strategy profile can be represented, up to an additive error ε, with\r\nfloating-point numbers of polynomial size. We complement the upper bound with a lower\r\nbound on this approach: we present a game with only five players in which every constrained\r\nNash equilibrium requires double-exponentially small probabilities.\r\nThe two parts share a common technical toolkit: bounds on solutions of systems of\r\npolynomial inequalities that arise from real algebraic geometry, the floating-point representation of doubly-exponentially small numbers, and guess-and-verify procedures that resolve\r\nsingle-player games with an NP oracle." acknowledgement: "The research reported in Part I was partially supported by the European Research\r\nCouncil (ERC) Consolidator Grant 863818 (ForM-SMArt), by the Austrian Science Fund\r\n(FWF) 10.55776/COE12, and by the French Agence Nationale de la Recherche (ANR) grant\r\nANR-21-CE40-0020 (CONVERGENCE project). The research reported in Part II is a part of\r\nproject VAMOS, which has received funding from the European Research Council (ERC) under\r\ngrant agreement No.101020093." alternative_title: - ISTA Master’s Thesis article_processing_charge: No author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi citation: ama: 'Asadi A. Approximation of values and equilibria in stochastic games: Complexity and algorithms. 2026. doi:10.15479/AT-ISTA-23079' apa: 'Asadi, A. (2026). Approximation of values and equilibria in stochastic games: Complexity and algorithms. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-23079' chicago: 'Asadi, Ali. “Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-23079.' ieee: 'A. Asadi, “Approximation of values and equilibria in stochastic games: Complexity and algorithms,” Institute of Science and Technology Austria, 2026.' ista: 'Asadi A. 2026. Approximation of values and equilibria in stochastic games: Complexity and algorithms. Institute of Science and Technology Austria.' mla: 'Asadi, Ali. Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-23079.' short: 'A. Asadi, Approximation of Values and Equilibria in Stochastic Games: Complexity and Algorithms, Institute of Science and Technology Austria, 2026.' corr_author: '1' date_created: 2026-10-08T09:07:53Z date_published: 2026-10-09T00:00:00Z date_updated: 2026-10-16T08:00:45Z day: '09' ddc: - '000' degree_awarded: MS department: - _id: GradSch - _id: KrCh doi: 10.15479/AT-ISTA-23079 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: c6b368f342409de884eafdd3af7867c5 content_type: application/pdf creator: aasadi date_created: 2026-10-09T11:12:08Z date_updated: 2026-10-12T13:13:51Z file_id: '23081' file_name: 2026_Asadi_Ali_Thesis.pdf file_size: 694682 relation: main_file - access_level: closed checksum: 71ecb0b666438f395a92b395e315f904 content_type: application/zip creator: aasadi date_created: 2026-10-09T11:12:56Z date_updated: 2026-10-09T11:47:47Z file_id: '23082' file_name: 2026_Asadi_Ali_Thesis.zip file_size: 1538723 relation: source_file file_date_updated: 2026-10-12T13:13:51Z fulldoi: https://doi.org/10.15479/AT-ISTA-23079 has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '83' project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21281' relation: part_of_dissertation status: public - id: '17099' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: 'Approximation of values and equilibria in stochastic games: Complexity and algorithms' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '21413' abstract: - lang: eng text: "We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs).\r\nThe primary goal of our techniques is to improve performance by avoiding an exhaustive exploration of the state space, instead focussing on particularly relevant areas of the system, guided by heuristics. Our work builds on the previous results of Br{á}zdil et al., significantly extending it as well as refining several details and fixing errors.\r\nThe presented framework focuses on probabilistic reachability, which is a core problem in verification, and is instantiated in two distinct scenarios.\r\nThe first assumes that full knowledge of the MDP is available, in particular precise transition probabilities. It performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP without knowing the exact transition dynamics. Here, we obtain probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. In particular, the latter is an extension of statistical model-checking (SMC) for unbounded properties in MDPs. In contrast to other related approaches, we do not restrict our attention to time-bounded (finite-horizon) or discounted properties, nor assume any particular structural properties of the MDP." acknowledgement: "This research was funded in part by the European Research Council (ERC) under grant agreement AdG-267989 (QUAREM)*, AdG-246967 (VERIWARE)*, StG-279307 (Graph Games)*\r\n, CoG-863818 (ForM-SMArt), and AdG-834115 (FUN2MODEL), by the EU FP7 project HIERATIC*, by the German Research Foundation (DFG) project 427755713 (GOPro), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE)* , S11407-N23 (RiSE)*\r\n, and P23499-N23* , by the Czech Science Foundation grant No P202/12/P612* and GA23-06963S, by the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant\r\nAgency of Masaryk University, by EPSRC project EP/K038575/1*, and by the Microsoft faculty fellows award*. A preliminary version of this article appeared at ATVA 2014 [33]. The * indicates funding that supported that version." article_number: '10' article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chmelik, Martin id: 3624234E-F248-11E8-B48F-1D18A9856A87 last_name: Chmelik - first_name: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Marta full_name: Kwiatkowska, Marta last_name: Kwiatkowska - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: David full_name: Parker, David last_name: Parker - first_name: Mateusz full_name: Ujma, Mateusz last_name: Ujma citation: ama: Brázdil T, Chatterjee K, Chmelik M, et al. Learning algorithms for verification of Markov decision processes. TheoretiCS. 2025;4. doi:10.46298/theoretics.25.10 apa: Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2025). Learning algorithms for verification of Markov decision processes. TheoretiCS. TheoretiCS Foundation. https://doi.org/10.46298/theoretics.25.10 chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, and Mateusz Ujma. “Learning Algorithms for Verification of Markov Decision Processes.” TheoretiCS. TheoretiCS Foundation, 2025. https://doi.org/10.46298/theoretics.25.10. ieee: T. Brázdil et al., “Learning algorithms for verification of Markov decision processes,” TheoretiCS, vol. 4. TheoretiCS Foundation, 2025. ista: Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Meggendorfer T, Parker D, Ujma M. 2025. Learning algorithms for verification of Markov decision processes. TheoretiCS. 4, 10. mla: Brázdil, Tomáš, et al. “Learning Algorithms for Verification of Markov Decision Processes.” TheoretiCS, vol. 4, 10, TheoretiCS Foundation, 2025, doi:10.46298/theoretics.25.10. short: T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, T. Meggendorfer, D. Parker, M. Ujma, TheoretiCS 4 (2025). date_created: 2026-03-08T23:01:46Z date_published: 2025-04-01T00:00:00Z date_updated: 2026-03-09T11:43:38Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.46298/theoretics.25.10 ec_funded: 1 external_id: arxiv: - '2403.09184' file: - access_level: open_access checksum: 2ccf563ae577ee08d82baf752292ca7b content_type: application/pdf creator: dernst date_created: 2026-03-09T11:39:59Z date_updated: 2026-03-09T11:39:59Z file_id: '21417' file_name: 2026_TheoretiCS_Brazdil.pdf file_size: 861607 relation: main_file success: 1 file_date_updated: 2026-03-09T11:39:59Z fulldoi: https://doi.org/10.46298/theoretics.25.10 has_accepted_license: '1' intvolume: ' 4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification publication: TheoretiCS publication_identifier: eissn: - 2751-4838 publication_status: published publisher: TheoretiCS Foundation quality_controlled: '1' scopus_import: '1' status: public title: Learning algorithms for verification of Markov decision processes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2025' ... --- OA_place: repository OA_type: gold _id: '21668' abstract: - lang: eng text: "This artifact allows to review and reproduce the experiments from the paper *A Revised Practitioner's Guide to MDP Model Checking Algorithms*.\r\nThe package contains all original logfiles and derived data used to generate the plots as in the paper. Furthermore, the artifact contains the model checking tools `Storm` and `mcsta` in the version exercised in the paper, the used Docker container, as well as benchmark instances and execution scripts to reproduce the experiments.\r\n\r\nSee also the artifact of the conference paper: https://zenodo.org/records/7509474" article_processing_charge: No author: - first_name: Arnd full_name: Hartmanns, Arnd last_name: Hartmanns - first_name: Sebastian full_name: Junges, Sebastian last_name: Junges - first_name: Tim full_name: Quatmann, Tim last_name: Quatmann - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger orcid: 0000-0002-0163-2152 citation: ama: Hartmanns A, Junges S, Quatmann T, Weininger M. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. 2025. doi:10.5281/ZENODO.14500423 apa: Hartmanns, A., Junges, S., Quatmann, T., & Weininger, M. (2025). Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. Zenodo. https://doi.org/10.5281/ZENODO.14500423 chicago: Hartmanns, Arnd, Sebastian Junges, Tim Quatmann, and Maximilian Weininger. “Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms.” Zenodo, 2025. https://doi.org/10.5281/ZENODO.14500423. ieee: A. Hartmanns, S. Junges, T. Quatmann, and M. Weininger, “Benchmark data for the revised practitioner’s guide to MDP model checking algorithms.” Zenodo, 2025. ista: Hartmanns A, Junges S, Quatmann T, Weininger M. 2025. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms, Zenodo, 10.5281/ZENODO.14500423. mla: Hartmanns, Arnd, et al. Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms. Zenodo, 2025, doi:10.5281/ZENODO.14500423. short: A. Hartmanns, S. Junges, T. Quatmann, M. Weininger, (2025). date_created: 2026-04-07T09:47:22Z date_published: 2025-03-07T00:00:00Z date_updated: 2026-04-07T09:52:55Z day: '07' ddc: - '000' department: - _id: KrCh doi: 10.5281/ZENODO.14500423 fulldoi: https://doi.org/10.5281/ZENODO.14500423 main_file_link: - open_access: '1' url: https://doi.org/10.5281/ZENODO.14500423 month: '03' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '21661' relation: used_for_analysis_in status: public status: public title: Benchmark data for the revised practitioner's guide to MDP model checking algorithms type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_type: closed access _id: '18529' abstract: - lang: eng text: Temporal networks are obtained from time-dependent interactions among individuals, whereas the interactions can be emails, phone calls, face-to-face meetings, or work collaboration. In this article, a temporal game framework is established, in which interactions among rational individuals are embedded into two-player games in a time-dependent manner. This allows studying the time-dependent complexity and variability of interactions, and the way they affect prosocial behaviors. Based on this simple mathematical model, it is found that the level of cooperation is promoted when the time of collaboration is equally limited for every individual. This observation is confirmed by a series of systematic human experiments on over 1,400 subjects, forming a foundation for comprehensively describing human temporal interactions in collaboration. The research results reveal an important incentive for human cooperation, leading to a better understanding of a fascinating aspect of human nature in society. article_processing_charge: No article_type: original author: - first_name: Yichao full_name: Zhang, Yichao last_name: Zhang - first_name: Jiasheng full_name: Wang, Jiasheng last_name: Wang - first_name: Guanghui full_name: Wen, Guanghui last_name: Wen - first_name: Jihong full_name: Guan, Jihong last_name: Guan - first_name: Shuigeng full_name: Zhou, Shuigeng last_name: Zhou - first_name: Guanrong full_name: Chen, Guanrong last_name: Chen - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Matjaz full_name: Perc, Matjaz last_name: Perc citation: ama: Zhang Y, Wang J, Wen G, et al. Limitation of time promotes cooperation in structured collaboration systems. IEEE Transactions on Network Science and Engineering. 2025;12(1):4-12. doi:10.1109/TNSE.2024.3481434 apa: Zhang, Y., Wang, J., Wen, G., Guan, J., Zhou, S., Chen, G., … Perc, M. (2025). Limitation of time promotes cooperation in structured collaboration systems. IEEE Transactions on Network Science and Engineering. IEEE. https://doi.org/10.1109/TNSE.2024.3481434 chicago: Zhang, Yichao, Jiasheng Wang, Guanghui Wen, Jihong Guan, Shuigeng Zhou, Guanrong Chen, Krishnendu Chatterjee, and Matjaz Perc. “Limitation of Time Promotes Cooperation in Structured Collaboration Systems.” IEEE Transactions on Network Science and Engineering. IEEE, 2025. https://doi.org/10.1109/TNSE.2024.3481434. ieee: Y. Zhang et al., “Limitation of time promotes cooperation in structured collaboration systems,” IEEE Transactions on Network Science and Engineering, vol. 12, no. 1. IEEE, pp. 4–12, 2025. ista: Zhang Y, Wang J, Wen G, Guan J, Zhou S, Chen G, Chatterjee K, Perc M. 2025. Limitation of time promotes cooperation in structured collaboration systems. IEEE Transactions on Network Science and Engineering. 12(1), 4–12. mla: Zhang, Yichao, et al. “Limitation of Time Promotes Cooperation in Structured Collaboration Systems.” IEEE Transactions on Network Science and Engineering, vol. 12, no. 1, IEEE, 2025, pp. 4–12, doi:10.1109/TNSE.2024.3481434. short: Y. Zhang, J. Wang, G. Wen, J. Guan, S. Zhou, G. Chen, K. Chatterjee, M. Perc, IEEE Transactions on Network Science and Engineering 12 (2025) 4–12. date_created: 2024-11-10T23:02:00Z date_published: 2025-01-01T00:00:00Z date_updated: 2025-02-27T12:35:48Z day: '01' department: - _id: KrCh doi: 10.1109/TNSE.2024.3481434 external_id: isi: - '001385382200040' fulldoi: https://doi.org/10.1109/TNSE.2024.3481434 intvolume: ' 12' isi: 1 issue: '1' language: - iso: eng month: '01' oa_version: None page: 4-12 publication: IEEE Transactions on Network Science and Engineering publication_identifier: eissn: - 2327-4697 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Limitation of time promotes cooperation in structured collaboration systems type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2025' ... --- OA_place: repository OA_type: green _id: '19375' abstract: - lang: eng text: "Despite the advances in probabilistic model checking, the scalability of the verification methods remains limited. In particular, the state space often becomes extremely large when instantiating parameterized Markov decision processes (MDPs) even with moderate values. Synthesizing policies for such huge MDPs is beyond the reach of available tools. We propose a learning-based approach to obtain a reasonable policy for such huge MDPs.\r\n\r\nThe idea is to generalize optimal policies obtained by model-checking small instances to larger ones using decision-tree learning. Consequently, our method bypasses the need for explicit state-space exploration of large models, providing a practical solution to the state-space explosion problem. We demonstrate the efficacy of our approach by performing extensive experimentation on the relevant models from the quantitative verification benchmark set. The experimental results indicate that our policies perform well, even when the size of the model is orders of magnitude beyond the reach of state-of-the-art analysis tools." acknowledgement: This research was funded in part by the DFG project 427755713 GOPro, the DFG GRK 2428 (ConVeY), the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant Agency of Masaryk University, and the EU under MSCA grant agreement 101034413 (IST-BRIDGE). alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Muqsit full_name: Azeem, Muqsit last_name: Azeem - first_name: Debraj full_name: Chakraborty, Debraj last_name: Chakraborty - first_name: Sudeep full_name: Kanav, Sudeep last_name: Kanav - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Mohammadsadegh full_name: Mohagheghi, Mohammadsadegh last_name: Mohagheghi - first_name: Stefanie full_name: Mohr, Stefanie last_name: Mohr - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger citation: ama: 'Azeem M, Chakraborty D, Kanav S, et al. 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. In: 26th International Conference on Verification, Model Checking, and Abstract Interpretation. Vol 15530. Springer Nature; 2025:97-120. doi:10.1007/978-3-031-82703-7_5' apa: 'Azeem, M., Chakraborty, D., Kanav, S., Kretinsky, J., Mohagheghi, M., Mohr, S., & Weininger, M. (2025). 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. In 26th International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 15530, pp. 97–120). Denver, CO, United States: Springer Nature. https://doi.org/10.1007/978-3-031-82703-7_5' chicago: Azeem, Muqsit, Debraj Chakraborty, Sudeep Kanav, Jan Kretinsky, Mohammadsadegh Mohagheghi, Stefanie Mohr, and Maximilian Weininger. “1–2–3–Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization.” In 26th International Conference on Verification, Model Checking, and Abstract Interpretation, 15530:97–120. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-82703-7_5. ieee: M. Azeem et al., “1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization,” in 26th International Conference on Verification, Model Checking, and Abstract Interpretation, Denver, CO, United States, 2025, vol. 15530, pp. 97–120. ista: 'Azeem M, Chakraborty D, Kanav S, Kretinsky J, Mohagheghi M, Mohr S, Weininger M. 2025. 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. 26th International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 15530, 97–120.' mla: Azeem, Muqsit, et al. “1–2–3–Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization.” 26th International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 15530, Springer Nature, 2025, pp. 97–120, doi:10.1007/978-3-031-82703-7_5. short: M. Azeem, D. Chakraborty, S. Kanav, J. Kretinsky, M. Mohagheghi, S. Mohr, M. Weininger, in:, 26th International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2025, pp. 97–120. conference: end_date: 2025-01-21 location: Denver, CO, United States name: 'VMCAI: Verification, Model Checking, and Abstract Interpretation' start_date: 2025-01-20 date_created: 2025-03-09T23:01:29Z date_published: 2025-01-23T00:00:00Z date_updated: 2025-09-30T10:46:54Z day: '23' department: - _id: KrCh doi: 10.1007/978-3-031-82703-7_5 ec_funded: 1 external_id: arxiv: - '2410.18293' isi: - '001446577100005' fulldoi: https://doi.org/10.1007/978-3-031-82703-7_5 intvolume: ' 15530' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2410.18293 month: '01' oa: 1 oa_version: Preprint page: 97-120 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: 26th International Conference on Verification, Model Checking, and Abstract Interpretation publication_identifier: eissn: - 1611-3349 isbn: - '9783031827020' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 15530 year: '2025' ... --- OA_place: repository OA_type: green _id: '19445' abstract: - lang: eng text: "In reconfiguration, we are given two solutions to a graph problem, such as Vertex Cover or Dominating Set, with each solution represented by a placement of tokens on vertices of the graph. Our task is to reconfigure one into the other using small steps while ensuring the intermediate configurations of tokens are also valid solutions. The two commonly studied settings are Token Jumping and Token Sliding, which allows moving a single token to an arbitrary or an adjacent vertex, respectively.\r\n\r\nWe introduce new rules that generalize Token Jumping, parameterized by the number of tokens allowed to move at once and by the maximum distance of each move. Our main contribution is identifying minimal rules that allow reconfiguring any possible given solution into any other for Independent Set, Vertex Cover, and Dominating Set. For each minimal rule, we also provide an efficient algorithm that finds a corresponding reconfiguration sequence.\r\n\r\nWe further focus on the rule that allows each token to move to an adjacent vertex in a single step. This natural variant turns out to be the minimal rule that guarantees reconfigurability for Vertex Cover. We determine the computational complexity of deciding whether a (shortest) reconfiguration sequence exists under this rule for the three studied problems. While reachability for Vertex Cover is shown to be in P, finding a shortest sequence is shown to be NP-complete. For Independent Set and Dominating Set, even reachability is shown to be PSPACE-complete." acknowledgement: J. M. Křišťan acknowledges the support of the Czech Science Foundation Grant No. 24-12046S. This work was supported by the Grant Agency of the Czech Technical University in Prague, grant No. SGS23/205/OHK3/3T/18. J. Svoboda acknowledges the support of the ERC CoG 863818 (ForM-SMArt) grant. alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Jan Matyáš full_name: Křišťan, Jan Matyáš last_name: Křišťan - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 citation: ama: 'Křišťan JM, Svoboda J. Reconfiguration using generalized token jumping. In: 19th International Conference and Workshops on Algorithms and Computation. Vol 15411. Springer Nature; 2025:244-265. doi:10.1007/978-981-96-2845-2_16' apa: 'Křišťan, J. M., & Svoboda, J. (2025). Reconfiguration using generalized token jumping. In 19th International Conference and Workshops on Algorithms and Computation (Vol. 15411, pp. 244–265). Chengdu, China: Springer Nature. https://doi.org/10.1007/978-981-96-2845-2_16' chicago: Křišťan, Jan Matyáš, and Jakub Svoboda. “Reconfiguration Using Generalized Token Jumping.” In 19th International Conference and Workshops on Algorithms and Computation, 15411:244–65. Springer Nature, 2025. https://doi.org/10.1007/978-981-96-2845-2_16. ieee: J. M. Křišťan and J. Svoboda, “Reconfiguration using generalized token jumping,” in 19th International Conference and Workshops on Algorithms and Computation, Chengdu, China, 2025, vol. 15411, pp. 244–265. ista: 'Křišťan JM, Svoboda J. 2025. Reconfiguration using generalized token jumping. 19th International Conference and Workshops on Algorithms and Computation. WALCOM: International Conference and Workshops on Algorithms and Computation, LNCS, vol. 15411, 244–265.' mla: Křišťan, Jan Matyáš, and Jakub Svoboda. “Reconfiguration Using Generalized Token Jumping.” 19th International Conference and Workshops on Algorithms and Computation, vol. 15411, Springer Nature, 2025, pp. 244–65, doi:10.1007/978-981-96-2845-2_16. short: J.M. Křišťan, J. Svoboda, in:, 19th International Conference and Workshops on Algorithms and Computation, Springer Nature, 2025, pp. 244–265. conference: end_date: 2025-03-02 location: Chengdu, China name: 'WALCOM: International Conference and Workshops on Algorithms and Computation' start_date: 2025-02-28 date_created: 2025-03-23T23:01:27Z date_published: 2025-02-20T00:00:00Z date_updated: 2025-09-30T11:14:33Z day: '20' department: - _id: KrCh doi: 10.1007/978-981-96-2845-2_16 ec_funded: 1 external_id: arxiv: - '2411.12582' isi: - '001537885900016' fulldoi: https://doi.org/10.1007/978-981-96-2845-2_16 intvolume: ' 15411' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2411.12582 month: '02' oa: 1 oa_version: Preprint page: 244-265 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: 19th International Conference and Workshops on Algorithms and Computation publication_identifier: eissn: - 1611-3349 isbn: - '9789819628445' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Reconfiguration using generalized token jumping type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 15411 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19499' abstract: - lang: eng text: Quantum hardware is inherently fragile and noisy. We find that the accuracy of traditional quantum error correction algorithms can be improved depending on the hardware. Given different hardware specifications, we automatically synthesize hardware-optimal algorithms for parity correction, qubit resetting, and GHZ (Greenberger–Horne–Zeilinger) state preparation. Using stochastic techniques from computer science, our method presents a computational tool to compute exact accuracy guarantees and synthesize optimal algorithms that are often different from traditional ones. We also show that improvements can be gained with respect to the Qiskit transpiler as we compute the hardware-optimal qubit mapping for the GHZ state-preparation problem. acknowledgement: We thank the reviewers. In particular, they inspired us to analyze the reset and state-preparation problems, to compute optimal qubit mappings, and to apply our method to a quantum error correction scheme that includes both bitflip and phaseflip corrections. We also thank Raimundo Saona and Marek Chalupa for their time spent in insightful discussions. This research was partially supported by the European Research Council CoG 863818 (ForM-SMArt) grant. article_number: e2419273122 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Stefanie full_name: Muroya Lei, Stefanie id: a376de31-8972-11ed-ae7b-d0251c13c8ff last_name: Muroya Lei - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: ama: Muroya Lei S, Chatterjee K, Henzinger TA. Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences. 2025;122(12). doi:10.1073/pnas.2419273122 apa: Muroya Lei, S., Chatterjee, K., & Henzinger, T. A. (2025). Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2419273122 chicago: Muroya Lei, Stefanie, Krishnendu Chatterjee, and Thomas A Henzinger. “Hardware-Optimal Quantum Algorithms.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2419273122. ieee: S. Muroya Lei, K. Chatterjee, and T. A. Henzinger, “Hardware-optimal quantum algorithms,” Proceedings of the National Academy of Sciences, vol. 122, no. 12. National Academy of Sciences, 2025. ista: Muroya Lei S, Chatterjee K, Henzinger TA. 2025. Hardware-optimal quantum algorithms. Proceedings of the National Academy of Sciences. 122(12), e2419273122. mla: Muroya Lei, Stefanie, et al. “Hardware-Optimal Quantum Algorithms.” Proceedings of the National Academy of Sciences, vol. 122, no. 12, e2419273122, National Academy of Sciences, 2025, doi:10.1073/pnas.2419273122. short: S. Muroya Lei, K. Chatterjee, T.A. Henzinger, Proceedings of the National Academy of Sciences 122 (2025). corr_author: '1' date_created: 2025-04-06T22:01:32Z date_published: 2025-03-25T00:00:00Z date_updated: 2026-04-28T13:41:14Z day: '25' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1073/pnas.2419273122 ec_funded: 1 external_id: isi: - '001459435600001' pmid: - '40106357' file: - access_level: open_access checksum: 83501b8a65ee5fdd3f5604fc28eddc22 content_type: application/pdf creator: dernst date_created: 2025-04-07T11:42:22Z date_updated: 2025-04-07T11:42:22Z file_id: '19524' file_name: 2025_PNAS_Muroya.pdf file_size: 6805668 relation: main_file success: 1 file_date_updated: 2025-04-07T11:42:22Z fulldoi: https://doi.org/10.1073/pnas.2419273122 has_accepted_license: '1' intvolume: ' 122' isi: 1 issue: '12' language: - iso: eng month: '03' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Proceedings of the National Academy of Sciences publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' related_material: link: - relation: software url: https://github.com/smml1996/algorithm_synthesis - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/hardware-optimal-quantum-algorithms/ scopus_import: '1' status: public title: Hardware-optimal quantum algorithms tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 122 year: '2025' ... --- OA_place: repository OA_type: green _id: '19600' abstract: - lang: eng text: In this work, we explore route discovery in private payment channel networks. We first determine what “ideal" privacy for a routing protocol means in this setting. We observe that protocols achieving this strong privacy definition exist by leveraging Multi-Party Computation but they are inherently inefficient as they must involve the entire network. We then present protocols with weaker privacy guarantees but much better efficiency (involving only a small fraction of the nodes). The core idea is that both sender and receiver gossip a message which propagates through the network, and the moment any node in the network receives both messages, a path is found. In our first protocol the message is always sent to all neighbouring nodes with a delay proportional to the fees of that edge. In our second protocol the message is only sent to one neighbour chosen randomly with a probability proportional to its degree. We additionally propose a more realistic notion of privacy in order to measure the privacy leakage of our protocols in practice. Our realistic notion of privacy challenges an adversary that join the network with a fixed budget to create channels to guess the sender and receiver of a transaction upon receiving messages from our protocols. Simulations of our protocols on the Lightning network topology (for random transactions and uniform fees) show that 1) forming edges with high degree nodes is a more effective attack strategy for the adversary, 2) there is a tradeoff between the number of nodes involved in our protocols (privacy) and the optimality of the discovered path, and 3) our protocols involve a very small fraction of the network on average. acknowledgement: This work was supported in part by the ERC CoG 863818 (ForM-SMArt), Austrian Science Fund (FWF) 10.55776/COE12, and MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms) grants. alternative_title: - LNCS article_processing_charge: No author: - first_name: Zeta full_name: Avarikioti, Zeta last_name: Avarikioti - first_name: Mahsa full_name: Bastankhah, Mahsa last_name: Bastankhah - first_name: Mohammad Ali full_name: Maddah-Ali, Mohammad Ali last_name: Maddah-Ali - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 - first_name: Michelle X full_name: Yeo, Michelle X id: 2D82B818-F248-11E8-B48F-1D18A9856A87 last_name: Yeo orcid: 0009-0001-3676-4809 citation: ama: 'Avarikioti Z, Bastankhah M, Maddah-Ali MA, Pietrzak KZ, Svoboda J, Yeo MX. Route discovery in private payment channel networks. In: Computer Security. ESORICS 2024 International Workshops. Vol 15263. Springer Nature; 2025:207-223. doi:10.1007/978-3-031-82349-7_15' apa: 'Avarikioti, Z., Bastankhah, M., Maddah-Ali, M. A., Pietrzak, K. Z., Svoboda, J., & Yeo, M. X. (2025). Route discovery in private payment channel networks. In Computer Security. ESORICS 2024 International Workshops (Vol. 15263, pp. 207–223). Bydgoszcz, Poland: Springer Nature. https://doi.org/10.1007/978-3-031-82349-7_15' chicago: Avarikioti, Zeta, Mahsa Bastankhah, Mohammad Ali Maddah-Ali, Krzysztof Z Pietrzak, Jakub Svoboda, and Michelle X Yeo. “Route Discovery in Private Payment Channel Networks.” In Computer Security. ESORICS 2024 International Workshops, 15263:207–23. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-82349-7_15. ieee: Z. Avarikioti, M. Bastankhah, M. A. Maddah-Ali, K. Z. Pietrzak, J. Svoboda, and M. X. Yeo, “Route discovery in private payment channel networks,” in Computer Security. ESORICS 2024 International Workshops, Bydgoszcz, Poland, 2025, vol. 15263, pp. 207–223. ista: 'Avarikioti Z, Bastankhah M, Maddah-Ali MA, Pietrzak KZ, Svoboda J, Yeo MX. 2025. Route discovery in private payment channel networks. Computer Security. ESORICS 2024 International Workshops. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 15263, 207–223.' mla: Avarikioti, Zeta, et al. “Route Discovery in Private Payment Channel Networks.” Computer Security. ESORICS 2024 International Workshops, vol. 15263, Springer Nature, 2025, pp. 207–23, doi:10.1007/978-3-031-82349-7_15. short: Z. Avarikioti, M. Bastankhah, M.A. Maddah-Ali, K.Z. Pietrzak, J. Svoboda, M.X. Yeo, in:, Computer Security. ESORICS 2024 International Workshops, Springer Nature, 2025, pp. 207–223. conference: end_date: 2024-09-20 location: Bydgoszcz, Poland name: 'ESORICS: European Symposium on Research in Computer Security' start_date: 2024-09-16 date_created: 2025-04-20T22:01:28Z date_published: 2025-04-01T00:00:00Z date_updated: 2025-11-05T07:52:35Z day: '01' department: - _id: KrPi - _id: KrCh doi: 10.1007/978-3-031-82349-7_15 ec_funded: 1 fulldoi: https://doi.org/10.1007/978-3-031-82349-7_15 intvolume: ' 15263' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2021/1539 month: '04' oa: 1 oa_version: Submitted Version page: 207-223 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Computer Security. ESORICS 2024 International Workshops publication_identifier: eissn: - 1611-3349 isbn: - '9783031823480' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Route discovery in private payment channel networks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15263 year: '2025' ... --- OA_place: repository OA_type: green _id: '19666' abstract: - lang: eng text: Markov decision processes (MDP) are a well-established model for sequential decision-making in the presence of probabilities. In *robust* MDP (RMDP), every action is associated with an *uncertainty set* of probability distributions, modelling that transition probabilities are not known precisely. Based on the known theoretical connection to stochastic games, we provide a framework for solving RMDPs that is generic, reliable, and efficient. It is *generic* both with respect to the model, allowing for a wide range of uncertainty sets, including but not limited to intervals, L1- or L2-balls, and polytopes; and with respect to the objective, including long-run average reward, undiscounted total reward, and stochastic shortest path. It is *reliable*, as our approach not only converges in the limit, but provides precision guarantees at any time during the computation. It is *efficient* because -- in contrast to state-of-the-art approaches -- it avoids explicitly constructing the underlying stochastic game. Consequently, our prototype implementation outperforms existing tools by several orders of magnitude and can solve RMDPs with a million states in under a minute. acknowledgement: "This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 101034413,\r\nthe ERC CoG 863818 (ForM-SMArt), and the DFG through the Cluster of Excellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy) and the TRR 248 (see https://perspicuous-computing.science, project ID 389792660)." article_processing_charge: No arxiv: 1 author: - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger orcid: 0000-0002-0163-2152 - first_name: Patrick full_name: Wienhöft, Patrick last_name: Wienhöft citation: ama: 'Meggendorfer T, Weininger M, Wienhöft P. Solving robust Markov decision processes: Generic, reliable, efficient. In: Proceedings of the 39th AAAI Conference on Artificial Intelligence. Vol 39. Association for the Advancement of Artificial Intelligence; 2025:26631-26641. doi:10.1609/aaai.v39i25.34865' apa: 'Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Solving robust Markov decision processes: Generic, reliable, efficient. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 26631–26641). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i25.34865' chicago: 'Meggendorfer, Tobias, Maximilian Weininger, and Patrick Wienhöft. “Solving Robust Markov Decision Processes: Generic, Reliable, Efficient.” In Proceedings of the 39th AAAI Conference on Artificial Intelligence, 39:26631–41. Association for the Advancement of Artificial Intelligence, 2025. https://doi.org/10.1609/aaai.v39i25.34865.' ieee: 'T. Meggendorfer, M. Weininger, and P. Wienhöft, “Solving robust Markov decision processes: Generic, reliable, efficient,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 25, pp. 26631–26641.' ista: 'Meggendorfer T, Weininger M, Wienhöft P. 2025. Solving robust Markov decision processes: Generic, reliable, efficient. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 26631–26641.' mla: 'Meggendorfer, Tobias, et al. “Solving Robust Markov Decision Processes: Generic, Reliable, Efficient.” Proceedings of the 39th AAAI Conference on Artificial Intelligence, vol. 39, no. 25, Association for the Advancement of Artificial Intelligence, 2025, pp. 26631–41, doi:10.1609/aaai.v39i25.34865.' short: T. Meggendorfer, M. Weininger, P. Wienhöft, in:, Proceedings of the 39th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 26631–26641. conference: end_date: 2025-03-04 location: Philadelphia, PA, United States name: 'AAAI: Conference on Artificial Intelligence' start_date: 2025-02-25 date_created: 2025-05-11T22:02:39Z date_published: 2025-04-11T00:00:00Z date_updated: 2026-02-16T12:25:05Z day: '11' department: - _id: KrCh doi: 10.1609/aaai.v39i25.34865 ec_funded: 1 external_id: arxiv: - '2412.10185' fulldoi: https://doi.org/10.1609/aaai.v39i25.34865 intvolume: ' 39' issue: '25' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2412.10185 month: '04' oa: 1 oa_version: Preprint page: 26631-26641 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Proceedings of the 39th AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.14385449 scopus_import: '1' status: public title: 'Solving robust Markov decision processes: Generic, reliable, efficient' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19742' abstract: - lang: eng text: Statistical model checking estimates probabilities and expectations of interest in probabilistic system models by using random simulations. Its results come with statistical guarantees. However, many tools use unsound statistical methods that produce incorrect results more often than they claim. In this paper, we provide a comprehensive overview of tools and their correctness, as well as of sound methods available for estimating probabilities from the literature. For expected rewards, we investigate how to bound the path reward distribution to apply sound statistical methods for bounded distributions, of which we recommend the Dvoretzky-Kiefer-Wolfowitz inequality that has not been used in SMC so far. We prove that even reachability rewards can be bounded in theory, and formalise the concept of limit-PAC procedures for a practical solution. The modes SMC tool implements our methods and recommendations, which we use to experimentally confirm our results. acknowledgement: This work was supported by the DFG through the Cluster of Excellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy) and the TRR 248 (see perspicuous-computing.science, project ID 389792660), by the European Union’s Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreements 101008233 (MISSION), 101034413 (IST-BRIDGE), and 101067199 (ProSVED), by the EU under NextGenerationEU projects D53D23008400006 (Smartitude) under MUR PRIN 2022 and PE00000014 (SERICS) under MUR PNRR, by the Interreg North Sea project STORM_SAFE, and by NWO VIDI grant VI.Vidi.223.110 (TruSTy). alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Carlos E. full_name: Budde, Carlos E. last_name: Budde - first_name: Arnd full_name: Hartmanns, Arnd last_name: Hartmanns - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger - first_name: Patrick full_name: Wienhöft, Patrick last_name: Wienhöft citation: ama: 'Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical model checking for probabilities and expected rewards. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15696. Springer Nature; 2025:167-190. doi:10.1007/978-3-031-90643-5_9' apa: 'Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90643-5_9' chicago: Budde, Carlos E., Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15696:167–90. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90643-5_9. ieee: C. E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15696, pp. 167–190. ista: 'Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. 2025. Sound statistical model checking for probabilities and expected rewards. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15696, 167–190.' mla: Budde, Carlos E., et al. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15696, Springer Nature, 2025, pp. 167–90, doi:10.1007/978-3-031-90643-5_9. short: C.E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 167–190. conference: end_date: 2025-05-08 location: Hamilton, ON, Canada name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2025-05-03 date_created: 2025-05-25T22:17:08Z date_published: 2025-05-01T00:00:00Z date_updated: 2025-06-02T09:45:41Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-031-90643-5_9 ec_funded: 1 external_id: arxiv: - '2411.00559' file: - access_level: open_access checksum: d45856b503b1dd4f8f14c3566327225b content_type: application/pdf creator: dernst date_created: 2025-06-02T09:35:42Z date_updated: 2025-06-02T09:35:42Z file_id: '19770' file_name: 2025_TACAS_Budde.pdf file_size: 711271 relation: main_file success: 1 file_date_updated: 2025-06-02T09:35:42Z fulldoi: https://doi.org/10.1007/978-3-031-90643-5_9 has_accepted_license: '1' intvolume: ' 15696' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 167-190 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eissn: - 1611-3349 isbn: - '9783031906428' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19769' relation: research_data status: public scopus_import: '1' status: public title: Sound statistical model checking for probabilities and expected rewards tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15696 year: '2025' ...