[{"file_date_updated":"2023-01-27T03:18:34Z","keyword":["runtime monitoring","best effort","third party"],"abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"page":"38","file":[{"file_id":"12408","file_size":662409,"date_updated":"2023-01-27T03:18:34Z","date_created":"2023-01-27T03:18:34Z","success":1,"access_level":"open_access","checksum":"55426e463fdeafe9777fc3ff635154c7","creator":"fmuehlbo","relation":"main_file","file_name":"main.pdf","content_type":"application/pdf"}],"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","article_processing_charge":"No","date_created":"2023-01-27T03:18:08Z","related_material":{"record":[{"id":"12856","status":"public","relation":"later_version"}]},"oa_version":"Published Version","publication_status":"published","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","alternative_title":["IST Austria Technical Report"],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"corr_author":"1","author":[{"first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","first_name":"Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck"},{"full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie","last_name":"Muroya Lei"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","language":[{"iso":"eng"}],"type":"technical_report","citation":{"ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>.","mla":"Chalupa, Marek, et al. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria; 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023."},"ddc":["005"],"day":"27","date_published":"2023-01-27T00:00:00Z","doi":"10.15479/AT:ISTA:12407","year":"2023","date_updated":"2025-09-09T12:25:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12407","publication_identifier":{"eissn":["2664-1690"]},"ec_funded":1,"month":"01"},{"volume":13992,"ddc":["000"],"citation":{"apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Quantitative safety and liveness. In <i>26th International Conference Foundations of Software Science and Computation Structures</i> (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in <i>26th International Conference Foundations of Software Science and Computation Structures</i>, Paris, France, 2023, vol. 13992, pp. 349–370.","mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” <i>26th International Conference Foundations of Software Science and Computation Structures</i>, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In <i>26th International Conference Foundations of Software Science and Computation Structures</i>, 13992:349–70. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: <i>26th International Conference Foundations of Software Science and Computation Structures</i>. Vol 13992. Springer Nature; 2023:349-370. doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>"},"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","publication":"26th International Conference Foundations of Software Science and Computation Structures","intvolume":"     13992","doi":"10.1007/978-3-031-30829-1_17","date_published":"2023-04-21T00:00:00Z","day":"21","_id":"12467","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-09T12:21:08Z","year":"2023","month":"04","ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308284"],"issn":["0302-9743"]},"file":[{"checksum":"981025aed580b6b27c426cb8856cf63e","access_level":"open_access","date_created":"2023-01-31T07:22:21Z","success":1,"relation":"main_file","file_name":"qsl.pdf","content_type":"application/pdf","creator":"esarac","file_size":449027,"file_id":"12468","date_updated":"2023-01-31T07:22:21Z"},{"date_updated":"2023-06-19T10:28:09Z","file_size":1048171,"file_id":"13153","relation":"main_file","file_name":"2023_LNCS_HenzingerT.pdf","content_type":"application/pdf","creator":"dernst","checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","access_level":"open_access","success":1,"date_created":"2023-06-19T10:28:09Z"}],"page":"349-370","abstract":[{"text":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states.","lang":"eng"}],"external_id":{"arxiv":["2301.11175"],"isi":["001288609300017"]},"file_date_updated":"2023-06-19T10:28:09Z","oa_version":"Published Version","date_created":"2023-01-31T07:23:56Z","publication_status":"published","arxiv":1,"article_processing_charge":"No","title":"Quantitative safety and liveness","has_accepted_license":"1","status":"public","conference":{"name":"FOSSACS: Foundations of Software Science and Computation Structures","end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France"},"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"alternative_title":["LNCS"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","isi":1},{"doi":"10.1109/LRA.2023.3240930","date_published":"2023-03-01T00:00:00Z","day":"01","volume":8,"ddc":["000"],"type":"journal_article","citation":{"ama":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>IEEE Robotics and Automation Letters</i>. 2023;8(3):1595-1602. doi:<a href=\"https://doi.org/10.1109/LRA.2023.3240930\">10.1109/LRA.2023.3240930</a>","short":"M. Lechner, A. Amini, D. Rus, T.A. Henzinger, IEEE Robotics and Automation Letters 8 (2023) 1595–1602.","chicago":"Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>IEEE Robotics and Automation Letters</i>. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/LRA.2023.3240930\">https://doi.org/10.1109/LRA.2023.3240930</a>.","mla":"Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>IEEE Robotics and Automation Letters</i>, vol. 8, no. 3, Institute of Electrical and Electronics Engineers, 2023, pp. 1595–602, doi:<a href=\"https://doi.org/10.1109/LRA.2023.3240930\">10.1109/LRA.2023.3240930</a>.","ieee":"M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” <i>IEEE Robotics and Automation Letters</i>, vol. 8, no. 3. Institute of Electrical and Electronics Engineers, pp. 1595–1602, 2023.","ista":"Lechner M, Amini A, Rus D, Henzinger TA. 2023. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. 8(3), 1595–1602.","apa":"Lechner, M., Amini, A., Rus, D., &#38; Henzinger, T. A. (2023). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>IEEE Robotics and Automation Letters</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LRA.2023.3240930\">https://doi.org/10.1109/LRA.2023.3240930</a>"},"quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"We thank Christoph Lampert for inspiring this work. The\r\nviews and conclusions contained in this document are those of\r\nthe authors and should not be interpreted as representing the\r\nofficial policies, either expressed or implied, of the United States\r\nAir Force or the U.S. Government. The U.S. Government is\r\nauthorized to reproduce and distribute reprints for Government\r\npurposes notwithstanding any copyright notation herein.","publication":"IEEE Robotics and Automation Letters","intvolume":"         8","month":"03","publication_identifier":{"eissn":["2377-3766"]},"_id":"12704","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2025-04-14T09:42:58Z","year":"2023","issue":"3","related_material":{"record":[{"id":"11366","relation":"earlier_version","status":"public"}]},"oa_version":"Published Version","publication_status":"published","date_created":"2023-03-05T23:01:04Z","arxiv":1,"article_processing_charge":"No","title":"Revisiting the adversarial robustness-accuracy tradeoff in robot learning","file":[{"file_size":944052,"file_id":"12714","date_updated":"2023-03-07T12:22:23Z","checksum":"5a75dcd326ea66685de2b1aaec259e85","success":1,"date_created":"2023-03-07T12:22:23Z","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","file_name":"2023_IEEERobAutLetters_Lechner.pdf","relation":"main_file"}],"page":"1595-1602","external_id":{"arxiv":["2204.07373"],"isi":["000936534100012"]},"abstract":[{"lang":"eng","text":"Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not come for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off but inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in conjunction with adversarial robot learning, are capable of making adversarial training suitable for real-world robot applications. We evaluate three different robot learning tasks ranging from autonomous driving in a high-fidelity environment amenable to sim-to-real deployment to mobile robot navigation and gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative impact on the nominal accuracy caused by adversarial training still outweighs the improved robustness by an order of magnitude. We conclude that although progress is happening, further advances in robust learning methods are necessary before they can benefit robot learning tasks in practice."}],"file_date_updated":"2023-03-07T12:22:23Z","article_type":"original","author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"department":[{"_id":"ToHe"}],"publisher":"Institute of Electrical and Electronics Engineers","isi":1,"status":"public","has_accepted_license":"1","scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"month":"04","ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308192"],"issn":["0302-9743"],"eisbn":["9783031308208"]},"_id":"12854","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-09T12:24:56Z","year":"2023","doi":"10.1007/978-3-031-30820-8_32","date_published":"2023-04-20T00:00:00Z","day":"20","volume":13994,"ddc":["000"],"type":"conference","citation":{"ista":"Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 535–540.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">https://doi.org/10.1007/978-3-031-30820-8_32</a>","ama":"Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 13994. Springer Nature; 2023:535-540. doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">10.1007/978-3-031-30820-8_32</a>","short":"M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540.","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, 13994:535–40. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">https://doi.org/10.1007/978-3-031-30820-8_32</a>.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">10.1007/978-3-031-30820-8_32</a>.","ieee":"M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Paris, France, 2023, vol. 13994, pp. 535–540."},"quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by the ERC-2020-AdG 10102009 grant.","publication":"Tools and Algorithms for the Construction and Analysis of Systems","intvolume":"     13994","author":[{"last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"corr_author":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","isi":1,"status":"public","has_accepted_license":"1","conference":{"end_date":"2023-04-27","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2023-04-22","location":"Paris, France"},"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_created":"2023-04-20T08:22:53Z","publication_status":"published","article_processing_charge":"No","title":"Bubaak: Runtime monitoring of program verifiers","file":[{"file_size":16096413,"file_id":"12864","date_updated":"2023-04-25T06:58:36Z","checksum":"120d2c2a38384058ad0630fdf8288312","date_created":"2023-04-25T06:58:36Z","success":1,"access_level":"open_access","creator":"dernst","file_name":"2023_LNCS_Chalupa.pdf","relation":"main_file","content_type":"application/pdf"}],"page":"535-540","external_id":{"isi":["001288698100041"]},"abstract":[{"text":"The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis.\r\nAt SV-COMP  2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition.","lang":"eng"}],"file_date_updated":"2023-04-25T06:58:36Z"},{"title":"Vamos: Middleware for best-effort third-party monitoring","article_processing_charge":"No","date_created":"2023-04-20T08:29:42Z","oa_version":"Published Version","related_material":{"record":[{"id":"18169","status":"public","relation":"later_version"},{"status":"public","relation":"earlier_version","id":"12407"}]},"publication_status":"published","external_id":{"isi":["001284136600015"]},"abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch."}],"page":"260-281","file":[{"date_updated":"2023-04-25T07:16:36Z","file_size":580828,"file_id":"12865","content_type":"application/pdf","file_name":"2023_LNCS_ChalupaM.pdf","relation":"main_file","creator":"dernst","checksum":"17a7c8e08be609cf2408d37ea55e322c","access_level":"open_access","success":1,"date_created":"2023-04-25T07:16:36Z"}],"file_date_updated":"2023-04-25T07:16:36Z","alternative_title":["LNCS"],"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian"},{"full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"corr_author":"1","isi":1,"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"conference":{"start_date":"2023-04-22","location":"Paris, France","name":"FASE: Fundamental Approaches to Software Engineering","end_date":"2023-04-27"},"scopus_import":"1","doi":"10.1007/978-3-031-30826-0_15","day":"20","date_published":"2023-04-20T00:00:00Z","type":"conference","citation":{"ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In <i>Fundamental Approaches to Software Engineering</i> (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">https://doi.org/10.1007/978-3-031-30826-0_15</a>","mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” <i>Fundamental Approaches to Software Engineering</i>, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:<a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">10.1007/978-3-031-30826-0_15</a>.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” In <i>Fundamental Approaches to Software Engineering</i>, 13991:260–81. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">https://doi.org/10.1007/978-3-031-30826-0_15</a>.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: <i>Fundamental Approaches to Software Engineering</i>. Vol 13991. Springer Nature; 2023:260-281. doi:<a href=\"https://doi.org/10.1007/978-3-031-30826-0_15\">10.1007/978-3-031-30826-0_15</a>","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in <i>Fundamental Approaches to Software Engineering</i>, Paris, France, 2023, vol. 13991, pp. 260–281."},"ddc":["000"],"volume":13991,"intvolume":"     13991","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","publication":"Fundamental Approaches to Software Engineering","language":[{"iso":"eng"}],"quality_controlled":"1","month":"04","publication_identifier":{"eisbn":["9783031308260"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308253"]},"ec_funded":1,"date_updated":"2025-09-09T12:25:29Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"12856","year":"2023"},{"author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"last_name":"Brim","first_name":"Luboš","full_name":"Brim, Luboš"},{"first_name":"Ondřej","last_name":"Huvar","full_name":"Huvar, Ondřej"},{"first_name":"Samuel","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","last_name":"Pastva","full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331"},{"full_name":"Šafránek, David","first_name":"David","last_name":"Šafránek"}],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"isi":1,"publisher":"Oxford University Press","department":[{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","oa":1,"issue":"4","article_processing_charge":"No","title":"Boolean network sketches: A unifying framework for logical model inference","related_material":{"link":[{"url":"https://doi.org/10.5281/zenodo.7688740","relation":"software"}]},"oa_version":"Published Version","date_created":"2023-04-30T22:01:05Z","publication_status":"published","external_id":{"isi":["000976610800001"],"pmid":["37004199"]},"abstract":[{"text":"Motivation: The problem of model inference is of fundamental importance to systems biology. Logical models (e.g. Boolean networks; BNs) represent a computationally attractive approach capable of handling large biological networks. The models are typically inferred from experimental data. However, even with a substantial amount of experimental data supported by some prior knowledge, existing inference methods often focus on a small sample of admissible candidate models only.\r\n\r\nResults: We propose Boolean network sketches as a new formal instrument for the inference of Boolean networks. A sketch integrates (typically partial) knowledge about the network’s topology and the update logic (obtained through, e.g. a biological knowledge base or a literature search), as well as further assumptions about the properties of the network’s transitions (e.g. the form of its attractor landscape), and additional restrictions on the model dynamics given by the measured experimental data. Our new BNs inference algorithm starts with an ‘initial’ sketch, which is extended by adding restrictions representing experimental data to a ‘data-informed’ sketch and subsequently computes all BNs consistent with the data-informed sketch. Our algorithm is based on a symbolic representation and coloured model-checking. Our approach is unique in its ability to cover a broad spectrum of knowledge and efficiently produce a compact representation of all inferred BNs. We evaluate the method on a non-trivial collection of real-world and simulated data.","lang":"eng"}],"file":[{"date_updated":"2023-05-02T07:39:04Z","file_size":478740,"file_id":"12886","creator":"dernst","relation":"main_file","content_type":"application/pdf","file_name":"2023_Bioinformatics_Benes.pdf","checksum":"2cb90ddf781baefddf47eac4b54e2a03","date_created":"2023-05-02T07:39:04Z","success":1,"access_level":"open_access"}],"pmid":1,"file_date_updated":"2023-05-02T07:39:04Z","article_type":"original","month":"04","publication_identifier":{"eissn":["1367-4811"]},"ec_funded":1,"date_updated":"2025-05-14T11:06:50Z","_id":"12876","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","doi":"10.1093/bioinformatics/btad158","day":"03","date_published":"2023-04-03T00:00:00Z","article_number":"btad158","type":"journal_article","citation":{"ieee":"N. Beneš, L. Brim, O. Huvar, S. Pastva, and D. Šafránek, “Boolean network sketches: A unifying framework for logical model inference,” <i>Bioinformatics</i>, vol. 39, no. 4. Oxford University Press, 2023.","short":"N. Beneš, L. Brim, O. Huvar, S. Pastva, D. Šafránek, Bioinformatics 39 (2023).","ama":"Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. Boolean network sketches: A unifying framework for logical model inference. <i>Bioinformatics</i>. 2023;39(4). doi:<a href=\"https://doi.org/10.1093/bioinformatics/btad158\">10.1093/bioinformatics/btad158</a>","mla":"Beneš, Nikola, et al. “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.” <i>Bioinformatics</i>, vol. 39, no. 4, btad158, Oxford University Press, 2023, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btad158\">10.1093/bioinformatics/btad158</a>.","chicago":"Beneš, Nikola, Luboš Brim, Ondřej Huvar, Samuel Pastva, and David Šafránek. “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.” <i>Bioinformatics</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/bioinformatics/btad158\">https://doi.org/10.1093/bioinformatics/btad158</a>.","apa":"Beneš, N., Brim, L., Huvar, O., Pastva, S., &#38; Šafránek, D. (2023). Boolean network sketches: A unifying framework for logical model inference. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btad158\">https://doi.org/10.1093/bioinformatics/btad158</a>","ista":"Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. 2023. Boolean network sketches: A unifying framework for logical model inference. Bioinformatics. 39(4), btad158."},"volume":39,"ddc":["000"],"publication":"Bioinformatics","acknowledgement":"This work was partially supported by GACR [grant No. GA22-10845S]; and Grant Agency of Masaryk University [grant No. MUNI/G/1771/2020]. This work was partially supported by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie [Grant Agreement No. 101034413 to S.P.].","intvolume":"        39","quality_controlled":"1","language":[{"iso":"eng"}]},{"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"scopus_import":"1","conference":{"end_date":"2023-04-27","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2023-04-22","location":"Paris, France"},"has_accepted_license":"1","status":"public","isi":1,"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"author":[{"full_name":"Anand, Ashwani","first_name":"Ashwani","last_name":"Anand"},{"full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik"},{"full_name":"Nayak, Satya Prakash","last_name":"Nayak","first_name":"Satya Prakash"},{"last_name":"Schmuck","first_name":"Anne Kathrin","full_name":"Schmuck, Anne Kathrin"}],"file_date_updated":"2023-06-19T08:43:21Z","external_id":{"isi":["001288698100015"]},"abstract":[{"text":"We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω\r\n-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.","lang":"eng"}],"page":"211-228","file":[{"date_updated":"2023-06-19T08:43:21Z","file_id":"13151","file_size":521425,"file_name":"2023_LNCS_Anand.pdf","relation":"main_file","content_type":"application/pdf","creator":"dernst","access_level":"open_access","success":1,"date_created":"2023-06-19T08:43:21Z","checksum":"60dcafc1b4f6f070be43bad3fe877974"}],"title":"Computing adequately permissive assumptions for synthesis","article_processing_charge":"No","publication_status":"published","date_created":"2023-06-18T22:00:47Z","oa_version":"Published Version","year":"2023","date_updated":"2025-09-09T12:30:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"13141","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308192"],"eissn":["1611-3349"]},"month":"04","intvolume":"     13994","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"apa":"Anand, A., Mallik, K., Nayak, S. P., &#38; Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In <i>TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 13994, pp. 211–228). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_15\">https://doi.org/10.1007/978-3-031-30820-8_15</a>","ista":"Anand A, Mallik K, Nayak SP, Schmuck AK. 2023. Computing adequately permissive assumptions for synthesis. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 211–228.","ieee":"A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately permissive assumptions for synthesis,” in <i>TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems</i>, Paris, France, 2023, vol. 13994, pp. 211–228.","short":"A. Anand, K. Mallik, S.P. Nayak, A.K. Schmuck, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 211–228.","ama":"Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions for synthesis. In: <i>TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 13994. Springer Nature; 2023:211-228. doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_15\">10.1007/978-3-031-30820-8_15</a>","chicago":"Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.” In <i>TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems</i>, 13994:211–28. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_15\">https://doi.org/10.1007/978-3-031-30820-8_15</a>.","mla":"Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.” <i>TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_15\">10.1007/978-3-031-30820-8_15</a>."},"type":"conference","ddc":["000"],"volume":13994,"day":"20","date_published":"2023-04-20T00:00:00Z","doi":"10.1007/978-3-031-30820-8_15"},{"publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"isi":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"corr_author":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"scopus_import":"1","conference":{"end_date":"2023-04-27","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","start_date":"2023-04-22"},"oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","has_accepted_license":"1","oa_version":"Published Version","publication_status":"published","date_created":"2023-06-18T22:00:47Z","article_processing_charge":"No","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","file_date_updated":"2023-06-19T08:29:30Z","file":[{"date_updated":"2023-06-19T08:29:30Z","file_id":"13150","file_size":528455,"creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2023_LNCS_Chatterjee.pdf","date_created":"2023-06-19T08:29:30Z","success":1,"access_level":"open_access","checksum":"3d8a8bb24d211bc83360dfc2fd744307"}],"page":"3-25","external_id":{"isi":["001288688000001"]},"abstract":[{"text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions.","lang":"eng"}],"ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308222"],"issn":["0302-9743"]},"month":"04","year":"2023","_id":"13142","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-09T12:29:26Z","date_published":"2023-04-22T00:00:00Z","day":"22","doi":"10.1007/978-3-031-30823-9_1","quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication":"Tools and Algorithms for the Construction and Analysis of Systems ","intvolume":"     13993","volume":13993,"ddc":["000"],"citation":{"apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In <i>Tools and Algorithms for the Construction and Analysis of Systems </i> (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">https://doi.org/10.1007/978-3-031-30823-9_1</a>","ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, Paris, France, 2023, vol. 13993, pp. 3–25.","ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: <i>Tools and Algorithms for the Construction and Analysis of Systems </i>. Vol 13993. Springer Nature; 2023:3-25. doi:<a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">10.1007/978-3-031-30823-9_1</a>","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, 13993:3–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">https://doi.org/10.1007/978-3-031-30823-9_1</a>.","mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” <i>Tools and Algorithms for the Construction and Analysis of Systems </i>, vol. 13993, Springer Nature, 2023, pp. 3–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-30823-9_1\">10.1007/978-3-031-30823-9_1</a>."},"type":"conference"},{"publication":"FAccT '23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency","acknowledgement":"The authors would like to thank the anonymous reviewers for their valuable comments and helpful suggestions. This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring of dynamic fairness properties,” in <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, Chicago, IL, United States, 2023, pp. 604–614.","mla":"Henzinger, Thomas A., et al. “Runtime Monitoring of Dynamic Fairness Properties.” <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, Association for Computing Machinery, 2023, pp. 604–14, doi:<a href=\"https://doi.org/10.1145/3593013.3594028\">10.1145/3593013.3594028</a>.","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Runtime Monitoring of Dynamic Fairness Properties.” In <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, 604–14. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3593013.3594028\">https://doi.org/10.1145/3593013.3594028</a>.","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2023, pp. 604–614.","ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Runtime monitoring of dynamic fairness properties. In: <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>. Association for Computing Machinery; 2023:604-614. doi:<a href=\"https://doi.org/10.1145/3593013.3594028\">10.1145/3593013.3594028</a>","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Runtime monitoring of dynamic fairness properties. In <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i> (pp. 604–614). Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3593013.3594028\">https://doi.org/10.1145/3593013.3594028</a>","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Runtime monitoring of dynamic fairness properties. FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency. FAccT: Conference on Fairness, Accountability and Transparency, 604–614."},"type":"conference","ddc":["000"],"day":"12","date_published":"2023-06-12T00:00:00Z","doi":"10.1145/3593013.3594028","year":"2023","date_updated":"2026-01-21T07:23:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13228","publication_identifier":{"isbn":["9781450372527"]},"ec_funded":1,"month":"06","file_date_updated":"2023-07-18T07:43:10Z","abstract":[{"text":"A machine-learned system that is fair in static decision-making tasks may have biased societal impacts in the long-run. This may happen when the system interacts with humans and feedback patterns emerge, reinforcing old biases in the system and creating new biases. While existing works try to identify and mitigate long-run biases through smart system design, we introduce techniques for monitoring fairness in real time. Our goal is to build and deploy a monitor that will continuously observe a long sequence of events generated by the system in the wild, and will output, with each event, a verdict on how fair the system is at the current point in time. The advantages of monitoring are two-fold. Firstly, fairness is evaluated at run-time, which is important because unfair behaviors may not be eliminated a priori, at design-time, due to partial knowledge about the system and the environment, as well as uncertainties and dynamic changes in the system and the environment, such as the unpredictability of human behavior. Secondly, monitors are by design oblivious to how the monitored system is constructed, which makes them suitable to be used as trusted third-party fairness watchdogs. They function as computationally lightweight statistical estimators, and their correctness proofs rely on the rigorous analysis of the stochastic process that models the assumptions about the underlying dynamics of the system. We show, both in theory and experiments, how monitors can warn us (1) if a bank’s credit policy over time has created an unfair distribution of credit scores among the population, and (2) if a resource allocator’s allocation policy over time has made unfair allocations. Our experiments demonstrate that the monitors introduce very low overhead. We believe that runtime monitoring is an important and mathematically rigorous new addition to the fairness toolbox.","lang":"eng"}],"external_id":{"isi":["001062819300057"],"arxiv":["2305.04699"]},"page":"604-614","file":[{"file_id":"13245","file_size":4100596,"date_updated":"2023-07-18T07:43:10Z","access_level":"open_access","success":1,"date_created":"2023-07-18T07:43:10Z","checksum":"96c759db9cdf94b81e37871a66a6ff48","relation":"main_file","file_name":"2023_ACM_HenzingerT.pdf","content_type":"application/pdf","creator":"dernst"}],"title":"Runtime monitoring of dynamic fairness properties","article_processing_charge":"Yes (via OA deal)","arxiv":1,"date_created":"2023-07-16T22:01:09Z","oa_version":"Published Version","publication_status":"published","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"scopus_import":"1","conference":{"location":"Chicago, IL, United States","start_date":"2023-06-12","name":"FAccT: Conference on Fairness, Accountability and Transparency","end_date":"2023-06-15"},"has_accepted_license":"1","status":"public","isi":1,"publisher":"Association for Computing Machinery","department":[{"_id":"ToHe"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"corr_author":"1","author":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"orcid":"0009-0005-0820-1696","full_name":"Karimi, Mahyar","first_name":"Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","last_name":"Karimi"},{"last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"}]},{"volume":25,"ddc":["000"],"citation":{"ieee":"K. Kueffner, A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: Active monitoring of neural networks (extended version),” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 25. Springer Nature, pp. 575–592, 2023.","mla":"Kueffner, Konstantin, et al. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 25, Springer Nature, 2023, pp. 575–92, doi:<a href=\"https://doi.org/10.1007/s10009-023-00711-4\">10.1007/s10009-023-00711-4</a>.","chicago":"Kueffner, Konstantin, Anna Lukina, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).” <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s10009-023-00711-4\">https://doi.org/10.1007/s10009-023-00711-4</a>.","ama":"Kueffner K, Lukina A, Schilling C, Henzinger TA. Into the unknown: Active monitoring of neural networks (extended version). <i>International Journal on Software Tools for Technology Transfer</i>. 2023;25:575-592. doi:<a href=\"https://doi.org/10.1007/s10009-023-00711-4\">10.1007/s10009-023-00711-4</a>","short":"K. Kueffner, A. Lukina, C. Schilling, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 25 (2023) 575–592.","apa":"Kueffner, K., Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2023). Into the unknown: Active monitoring of neural networks (extended version). <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10009-023-00711-4\">https://doi.org/10.1007/s10009-023-00711-4</a>","ista":"Kueffner K, Lukina A, Schilling C, Henzinger TA. 2023. Into the unknown: Active monitoring of neural networks (extended version). International Journal on Software Tools for Technology Transfer. 25, 575–592."},"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"International Journal on Software Tools for Technology Transfer","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, by DIREC - Digital Research Centre Denmark, and by the Villum Investigator Grant S4OS.","intvolume":"        25","doi":"10.1007/s10009-023-00711-4","date_published":"2023-08-01T00:00:00Z","day":"01","_id":"13234","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-15T06:55:00Z","year":"2023","month":"08","ec_funded":1,"publication_identifier":{"issn":["1433-2779"],"eissn":["1433-2787"]},"file":[{"creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2023_JourSoftwareTools_Kueffner.pdf","success":1,"date_created":"2024-01-30T12:06:07Z","access_level":"open_access","checksum":"3c4b347f39412a76872f9a6f30101f94","date_updated":"2024-01-30T12:06:07Z","file_id":"14903","file_size":13387667}],"page":"575-592","abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. We consider the problem of monitoring the classification decisions of neural networks in the presence of novel classes. For this purpose, we generalize our recently proposed abstraction-based monitor from binary output to real-valued quantitative output. This quantitative output enables new applications, two of which we investigate in the paper. As our first application, we introduce an algorithmic framework for active monitoring of a neural network, which allows us to learn new classes dynamically and yet maintain high monitoring performance. As our second application, we present an offline procedure to retrain the neural network to improve the monitor’s detection performance without deteriorating the network’s classification accuracy. Our experimental evaluation demonstrates both the benefits of our active monitoring framework in dynamic scenarios and the effectiveness of the retraining procedure.","lang":"eng"}],"external_id":{"arxiv":["2009.06429"],"isi":["001020160000001"]},"file_date_updated":"2024-01-30T12:06:07Z","article_type":"original","date_created":"2023-07-16T22:01:11Z","related_material":{"record":[{"id":"10206","status":"public","relation":"shorter_version"}]},"publication_status":"published","oa_version":"Published Version","arxiv":1,"title":"Into the unknown: Active monitoring of neural networks (extended version)","article_processing_charge":"Yes (in subscription journal)","status":"public","has_accepted_license":"1","scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","author":[{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin"},{"full_name":"Lukina, Anna","last_name":"Lukina","first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"},{"last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"isi":1},{"date_updated":"2025-05-14T11:07:28Z","_id":"13263","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","month":"06","publication_identifier":{"issn":["1367-4803"],"eissn":["1367-4811"]},"ec_funded":1,"citation":{"short":"V.G. Trinh, B. Benhamou, T.A. Henzinger, S. Pastva, Bioinformatics 39 (2023) i513–i522.","ama":"Trinh VG, Benhamou B, Henzinger TA, Pastva S. Trap spaces of multi-valued networks: Definition, computation, and applications. <i>Bioinformatics</i>. 2023;39(Supplement_1):i513-i522. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btad262\">10.1093/bioinformatics/btad262</a>","chicago":"Trinh, Van Giang, Belaid Benhamou, Thomas A Henzinger, and Samuel Pastva. “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.” <i>Bioinformatics</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/bioinformatics/btad262\">https://doi.org/10.1093/bioinformatics/btad262</a>.","mla":"Trinh, Van Giang, et al. “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.” <i>Bioinformatics</i>, vol. 39, no. Supplement_1, Oxford University Press, 2023, pp. i513–22, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btad262\">10.1093/bioinformatics/btad262</a>.","ieee":"V. G. Trinh, B. Benhamou, T. A. Henzinger, and S. Pastva, “Trap spaces of multi-valued networks: Definition, computation, and applications,” <i>Bioinformatics</i>, vol. 39, no. Supplement_1. Oxford University Press, pp. i513–i522, 2023.","ista":"Trinh VG, Benhamou B, Henzinger TA, Pastva S. 2023. Trap spaces of multi-valued networks: Definition, computation, and applications. Bioinformatics. 39(Supplement_1), i513–i522.","apa":"Trinh, V. G., Benhamou, B., Henzinger, T. A., &#38; Pastva, S. (2023). Trap spaces of multi-valued networks: Definition, computation, and applications. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btad262\">https://doi.org/10.1093/bioinformatics/btad262</a>"},"type":"journal_article","volume":39,"ddc":["000"],"publication":"Bioinformatics","acknowledgement":"This work was supported by L’Institut Carnot STAR, Marseille, France, and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. [101034413].","intvolume":"        39","quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1093/bioinformatics/btad262","day":"30","date_published":"2023-06-30T00:00:00Z","status":"public","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","oa":1,"corr_author":"1","author":[{"first_name":"Van Giang","last_name":"Trinh","full_name":"Trinh, Van Giang"},{"full_name":"Benhamou, Belaid","first_name":"Belaid","last_name":"Benhamou"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331","last_name":"Pastva","first_name":"Samuel","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b"}],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"isi":1,"publisher":"Oxford University Press","department":[{"_id":"ToHe"}],"page":"i513-i522","abstract":[{"text":"Motivation: Boolean networks are simple but efficient mathematical formalism for modelling complex biological systems. However, having only two levels of activation is sometimes not enough to fully capture the dynamics of real-world biological systems. Hence, the need for multi-valued networks (MVNs), a generalization of Boolean networks. Despite the importance of MVNs for modelling biological systems, only limited progress has been made on developing theories, analysis methods, and tools that can support them. In particular, the recent use of trap spaces in Boolean networks made a great impact on the field of systems biology, but there has been no similar concept defined and studied for MVNs to date.\r\n\r\nResults: In this work, we generalize the concept of trap spaces in Boolean networks to that in MVNs. We then develop the theory and the analysis methods for trap spaces in MVNs. In particular, we implement all proposed methods in a Python package called trapmvn. Not only showing the applicability of our approach via a realistic case study, we also evaluate the time efficiency of the method on a large collection of real-world models. The experimental results confirm the time efficiency, which we believe enables more accurate analysis on larger and more complex multi-valued models.","lang":"eng"}],"external_id":{"isi":["001027457000060"],"pmid":["37387165"]},"file":[{"date_updated":"2023-07-31T11:09:05Z","file_size":641736,"file_id":"13335","creator":"dernst","file_name":"2023_Bioinformatics_Trinh.pdf","content_type":"application/pdf","relation":"main_file","checksum":"ba3abe1171df1958413b7c7f957f5486","date_created":"2023-07-31T11:09:05Z","success":1,"access_level":"open_access"}],"pmid":1,"file_date_updated":"2023-07-31T11:09:05Z","article_type":"original","issue":"Supplement_1","title":"Trap spaces of multi-valued networks: Definition, computation, and applications","article_processing_charge":"Yes","date_created":"2023-07-23T22:01:12Z","publication_status":"published","related_material":{"link":[{"url":"https://github.com/giang-trinh/trap-mvn","relation":"software"}]},"oa_version":"Published Version"},{"date_created":"2023-07-24T15:11:41Z","oa_version":"Published Version","publication_status":"published","arxiv":1,"article_processing_charge":"Yes","title":"Regular methods for operator precedence languages","file_date_updated":"2023-07-24T15:11:05Z","file":[{"date_updated":"2023-07-24T15:11:05Z","file_size":859379,"file_id":"13293","relation":"main_file","content_type":"application/pdf","file_name":"icalp23.pdf","creator":"esarac","checksum":"5d4c8932ef3450615a53b9bb15d92eb2","access_level":"open_access","success":1,"date_created":"2023-07-24T15:11:05Z"}],"page":"129:1--129:20","abstract":[{"lang":"eng","text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time."}],"external_id":{"arxiv":["2305.03447"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","corr_author":"1","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Kebis","first_name":"Pavol","full_name":"Kebis, Pavol"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"full_name":"Sarac, Naci E","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac"}],"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"alternative_title":["LIPIcs"],"conference":{"end_date":"2023-07-14","name":"ICALP: Automata, Languages and Programming","start_date":"2023-07-10","location":"Paderborn, Germany"},"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","status":"public","date_published":"2023-07-05T00:00:00Z","day":"05","doi":"10.4230/LIPIcs.ICALP.2023.129","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"50th International Colloquium on Automata, Languages, and Programming","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","intvolume":"       261","volume":261,"ddc":["000"],"citation":{"short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: <i>50th International Colloquium on Automata, Languages, and Programming</i>. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>","mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” <i>50th International Colloquium on Automata, Languages, and Programming</i>, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>.","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In <i>50th International Colloquium on Automata, Languages, and Programming</i>, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in <i>50th International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 129:1--129:20.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Regular methods for operator precedence languages. In <i>50th International Colloquium on Automata, Languages, and Programming</i> (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>"},"type":"conference","ec_funded":1,"publication_identifier":{"isbn":["9783959772785"],"eissn":["1868-8969"]},"month":"07","year":"2023","_id":"13292","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-07-10T11:50:41Z"},{"date_created":"2023-07-25T18:32:40Z","oa_version":"Published Version","publication_status":"published","arxiv":1,"article_processing_charge":"Yes (in subscription journal)","title":"Monitoring algorithmic fairness","file_date_updated":"2023-07-31T08:11:20Z","file":[{"date_updated":"2023-07-31T08:11:20Z","file_id":"13327","file_size":647760,"creator":"dernst","file_name":"2023_LNCS_CAV_HenzingerT.pdf","content_type":"application/pdf","relation":"main_file","date_created":"2023-07-31T08:11:20Z","success":1,"access_level":"open_access","checksum":"ccaf94bf7d658ba012c016e11869b54c"}],"page":"358–382","abstract":[{"text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation.","lang":"eng"}],"external_id":{"arxiv":["2305.15979"],"isi":["001310804800017"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","isi":1,"author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Karimi, Mahyar","orcid":"0009-0005-0820-1696","last_name":"Karimi","first_name":"Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b"},{"first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542"},{"orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik"}],"corr_author":"1","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"alternative_title":["LNCS"],"scopus_import":"1","conference":{"end_date":"2023-07-22","name":"CAV: Computer Aided Verification","location":"Paris, France","start_date":"2023-07-17"},"oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","status":"public","date_published":"2023-07-18T00:00:00Z","day":"18","doi":"10.1007/978-3-031-37703-7_17","quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093.","publication":"Computer Aided Verification","intvolume":"     13965","volume":13965,"ddc":["000"],"type":"conference","citation":{"ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: <i>Computer Aided Verification</i>. Vol 13965. Springer Nature; 2023:358–382. doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In <i>Computer Aided Verification</i>, 13965:358–382. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>.","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” <i>Computer Aided Verification</i>, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>.","ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13965, pp. 358–382.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382.","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness. In <i>Computer Aided Verification</i> (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>"},"ec_funded":1,"publication_identifier":{"isbn":["9783031377020"],"eissn":["1611-3349"],"eisbn":["9783031377037"],"issn":["0302-9743"]},"month":"07","year":"2023","_id":"13310","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-01-21T07:24:31Z"},{"publication":"23nd International Conference on Runtime Verification","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank Ana Oliveira da Costa for commenting on a draft of the paper.","intvolume":"     14245","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers,” in <i>23nd International Conference on Runtime Verification</i>, Thessaloniki, Greek, 2023, vol. 14245, pp. 168–190.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” <i>23nd International Conference on Runtime Verification</i>, vol. 14245, Springer Nature, 2023, pp. 168–90, doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">10.1007/978-3-031-44267-4_9</a>.","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” In <i>23nd International Conference on Runtime Verification</i>, 14245:168–90. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">https://doi.org/10.1007/978-3-031-44267-4_9</a>.","short":"M. Chalupa, T.A. Henzinger, in:, 23nd International Conference on Runtime Verification, Springer Nature, 2023, pp. 168–190.","ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. In: <i>23nd International Conference on Runtime Verification</i>. Vol 14245. Springer Nature; 2023:168-190. doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">10.1007/978-3-031-44267-4_9</a>","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. In <i>23nd International Conference on Runtime Verification</i> (Vol. 14245, pp. 168–190). Thessaloniki, Greek: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">https://doi.org/10.1007/978-3-031-44267-4_9</a>","ista":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers. 23nd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 168–190."},"volume":14245,"ddc":["000"],"day":"01","date_published":"2023-10-01T00:00:00Z","doi":"10.1007/978-3-031-44267-4_9","year":"2023","date_updated":"2025-04-14T09:42:55Z","_id":"14076","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["978-3-031-44267-4"],"isbn":["978-3-031-44266-7"]},"ec_funded":1,"month":"10","file_date_updated":"2023-10-16T07:15:11Z","page":"168-190","abstract":[{"lang":"eng","text":"Hyperproperties are properties that relate multiple execution traces. Previous work on monitoring hyperproperties focused on synchronous hyperproperties, usually specified in HyperLTL. When monitoring synchronous hyperproperties, all traces are assumed to proceed at the same speed. We introduce (multi-trace) prefix transducers and show how to use them for monitoring synchronous as well as, for the first time, asynchronous hyperproperties. Prefix transducers map multiple input traces into one or more output traces by incrementally matching prefixes of the input traces against expressions similar to regular expressions. The prefixes of different traces which are consumed by a single matching step of the monitor may have different lengths. The deterministic and executable nature of prefix transducers makes them more suitable as an intermediate formalism for runtime verification than logical specifications, which tend to be highly non-deterministic, especially in the case of asynchronous hyperproperties. We report on a set of experiments about monitoring asynchronous version of observational determinism."}],"file":[{"creator":"dernst","relation":"main_file","file_name":"2023_LNCS_RV_Chalupa.pdf","content_type":"application/pdf","date_created":"2023-10-16T07:15:11Z","success":1,"access_level":"open_access","checksum":"ee33bd6f1a26f4dae7a8192584869fd8","date_updated":"2023-10-16T07:15:11Z","file_id":"14430","file_size":867256}],"article_processing_charge":"Yes (in subscription journal)","title":"Monitoring hyperproperties with prefix transducers","related_material":{"record":[{"relation":"research_data","status":"public","id":"15035"}]},"date_created":"2023-08-16T20:46:08Z","publication_status":"published","oa_version":"Published Version","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","conference":{"end_date":"2023-10-07","name":"RV: Conference on Runtime Verification","location":"Thessaloniki, Greek","start_date":"2023-10-04"},"oa":1,"has_accepted_license":"1","status":"public","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","alternative_title":["LNCS"],"author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}]},{"ec_funded":1,"publication_identifier":{"isbn":["9781577358800"]},"month":"06","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14242","date_updated":"2025-03-31T16:01:08Z","date_published":"2023-06-26T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.16187"}],"day":"26","doi":"10.1609/aaai.v37i12.26747","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        37","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Research was sponsored by the United\r\nStates Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-\r\n1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied,\r\nof the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright\r\nnotation herein. The research was also funded in part by the AI2050 program at Schmidt Futures (Grant G-22-63172) and Capgemini SE.","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","volume":37,"citation":{"mla":"Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &#38; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>"},"type":"conference","publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"oa":1,"scopus_import":"1","conference":{"start_date":"2023-02-07","location":"Washington, DC, United States","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14"},"status":"public","date_created":"2023-08-27T22:01:17Z","publication_status":"published","oa_version":"Preprint","title":"Quantization-aware interval bound propagation for training certifiably robust quantized neural networks","article_processing_charge":"No","arxiv":1,"issue":"12","abstract":[{"lang":"eng","text":"We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs."}],"external_id":{"arxiv":["2211.16187"]},"page":"14964-14973"},{"quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project\r\nSpyCoDe F8502, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant\r\nVAMOS 101020093.","publication":"34th International Conference on Concurrency Theory","intvolume":"       279","volume":279,"ddc":["000"],"type":"conference","citation":{"ista":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. 2023. Hypernode automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 21.","apa":"Bartocci, E., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2023). Hypernode automata. In <i>34th International Conference on Concurrency Theory</i> (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.21</a>","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” <i>34th International Conference on Concurrency Theory</i>, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">10.4230/LIPIcs.CONCUR.2023.21</a>.","chicago":"Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In <i>34th International Conference on Concurrency Theory</i>, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.21</a>.","ama":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: <i>34th International Conference on Concurrency Theory</i>. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">10.4230/LIPIcs.CONCUR.2023.21</a>","short":"E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in <i>34th International Conference on Concurrency Theory</i>, Antwerp, Belgium, 2023, vol. 279."},"article_number":"21","date_published":"2023-09-01T00:00:00Z","day":"01","doi":"10.4230/LIPIcs.CONCUR.2023.21","year":"2023","_id":"14405","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-01-05T12:27:40Z","ec_funded":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772990"]},"month":"09","file_date_updated":"2023-10-09T07:42:45Z","file":[{"creator":"dernst","relation":"main_file","file_name":"2023_LIPcs_Bartocci.pdf","content_type":"application/pdf","checksum":"215765e40454d806174ac0a223e8d6fa","success":1,"date_created":"2023-10-09T07:42:45Z","access_level":"open_access","date_updated":"2023-10-09T07:42:45Z","file_size":795790,"file_id":"14413"}],"abstract":[{"lang":"eng","text":"We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs."}],"external_id":{"arxiv":["2305.02836"]},"publication_status":"published","related_material":{"record":[{"id":"20866","status":"public","relation":"later_version"}]},"oa_version":"Published Version","date_created":"2023-10-08T22:01:16Z","arxiv":1,"title":"Hypernode automata","article_processing_charge":"Yes","conference":{"end_date":"2023-09-22","name":"CONCUR: Conference on Concurrency Theory","start_date":"2023-09-19","location":"Antwerp, Belgium"},"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Oliveira da Costa","first_name":"Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","orcid":"0000-0002-8741-5799","full_name":"Oliveira da Costa, Ana"}],"corr_author":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"alternative_title":["LIPIcs"]},{"year":"2023","_id":"14411","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-09T14:25:46Z","ec_funded":1,"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031426964"],"issn":["0302-9743"]},"month":"09","quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by the Czech Foundation grant No. GA22-10845S, Grant Agency of Masaryk University grant No. MUNI/G/1771/2020, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","publication":"21st International Conference on Computational Methods in Systems Biology","intvolume":"     14137","volume":14137,"ddc":["000"],"citation":{"ista":"Beneš N, Brim L, Pastva S, Šafránek D, Šmijáková E. 2023. Phenotype control of partially specified boolean networks. 21st International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNBI, vol. 14137, 18–35.","apa":"Beneš, N., Brim, L., Pastva, S., Šafránek, D., &#38; Šmijáková, E. (2023). Phenotype control of partially specified boolean networks. In <i>21st International Conference on Computational Methods in Systems Biology</i> (Vol. 14137, pp. 18–35). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-42697-1_2\">https://doi.org/10.1007/978-3-031-42697-1_2</a>","short":"N. Beneš, L. Brim, S. Pastva, D. Šafránek, E. Šmijáková, in:, 21st International Conference on Computational Methods in Systems Biology, Springer Nature, 2023, pp. 18–35.","ama":"Beneš N, Brim L, Pastva S, Šafránek D, Šmijáková E. Phenotype control of partially specified boolean networks. In: <i>21st International Conference on Computational Methods in Systems Biology</i>. Vol 14137. Springer Nature; 2023:18-35. doi:<a href=\"https://doi.org/10.1007/978-3-031-42697-1_2\">10.1007/978-3-031-42697-1_2</a>","mla":"Beneš, Nikola, et al. “Phenotype Control of Partially Specified Boolean Networks.” <i>21st International Conference on Computational Methods in Systems Biology</i>, vol. 14137, Springer Nature, 2023, pp. 18–35, doi:<a href=\"https://doi.org/10.1007/978-3-031-42697-1_2\">10.1007/978-3-031-42697-1_2</a>.","chicago":"Beneš, Nikola, Luboš Brim, Samuel Pastva, David Šafránek, and Eva Šmijáková. “Phenotype Control of Partially Specified Boolean Networks.” In <i>21st International Conference on Computational Methods in Systems Biology</i>, 14137:18–35. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-42697-1_2\">https://doi.org/10.1007/978-3-031-42697-1_2</a>.","ieee":"N. Beneš, L. Brim, S. Pastva, D. Šafránek, and E. Šmijáková, “Phenotype control of partially specified boolean networks,” in <i>21st International Conference on Computational Methods in Systems Biology</i>, Luxembourg City, Luxembourg, 2023, vol. 14137, pp. 18–35."},"type":"conference","date_published":"2023-09-09T00:00:00Z","day":"09","doi":"10.1007/978-3-031-42697-1_2","conference":{"location":"Luxembourg City, Luxembourg","start_date":"2023-09-13","end_date":"2023-09-15","name":"CMSB: Computational Methods in Systems Biology"},"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","has_accepted_license":"1","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"isi":1,"author":[{"full_name":"Beneš, Nikola","first_name":"Nikola","last_name":"Beneš"},{"full_name":"Brim, Luboš","last_name":"Brim","first_name":"Luboš"},{"last_name":"Pastva","first_name":"Samuel","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331"},{"full_name":"Šafránek, David","first_name":"David","last_name":"Šafránek"},{"full_name":"Šmijáková, Eva","first_name":"Eva","last_name":"Šmijáková"}],"project":[{"call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"alternative_title":["LNBI"],"file_date_updated":"2024-02-16T08:26:32Z","file":[{"content_type":"application/pdf","file_name":"cmsb2023.pdf","relation":"main_file","creator":"spastva","access_level":"open_access","success":1,"date_created":"2024-02-16T08:26:32Z","checksum":"6f71bdaedb770b52380222fd9f4d7937","date_updated":"2024-02-16T08:26:32Z","file_id":"14997","file_size":691582}],"page":"18-35","external_id":{"isi":["001156280600002"]},"abstract":[{"lang":"eng","text":"Partially specified Boolean networks (PSBNs) represent a promising framework for the qualitative modelling of biological systems in which the logic of interactions is not completely known. Phenotype control aims to stabilise the network in states exhibiting specific traits.\r\nIn this paper, we define the phenotype control problem in the context of asynchronous PSBNs and propose a novel semi-symbolic algorithm for solving this problem with permanent variable perturbations."}],"date_created":"2023-10-08T22:01:18Z","oa_version":"Submitted Version","publication_status":"published","title":"Phenotype control of partially specified boolean networks","article_processing_charge":"No"},{"year":"2023","_id":"14454","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-14T07:55:55Z","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031442667"],"eissn":["1611-3349"]},"month":"10","quality_controlled":"1","language":[{"iso":"eng"}],"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","publication":"23rd International Conference on Runtime Verification","intvolume":"     14245","volume":14245,"type":"conference","citation":{"ieee":"T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in <i>23rd International Conference on Runtime Verification</i>, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.” In <i>23rd International Conference on Runtime Verification</i>, 14245:291–311. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">https://doi.org/10.1007/978-3-031-44267-4_15</a>.","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.” <i>23rd International Conference on Runtime Verification</i>, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">10.1007/978-3-031-44267-4_15</a>.","short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.","ama":"Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under partial observations. In: <i>23rd International Conference on Runtime Verification</i>. Vol 14245. Springer Nature; 2023:291-311. doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">10.1007/978-3-031-44267-4_15</a>","apa":"Henzinger, T. A., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In <i>23rd International Conference on Runtime Verification</i> (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">https://doi.org/10.1007/978-3-031-44267-4_15</a>","ista":"Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness under partial observations. 23rd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2308.00341"}],"date_published":"2023-10-01T00:00:00Z","day":"01","doi":"10.1007/978-3-031-44267-4_15","conference":{"name":"RV: Conference on Runtime Verification","end_date":"2023-10-06","location":"Thessaloniki, Greece","start_date":"2023-10-03"},"scopus_import":"1","oa":1,"status":"public","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","author":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kueffner","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin"},{"full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","last_name":"Mallik"}],"corr_author":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"alternative_title":["LNCS"],"page":"291-311","external_id":{"arxiv":["2308.00341"]},"abstract":[{"text":"As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples.","lang":"eng"}],"publication_status":"published","oa_version":"Preprint","date_created":"2023-10-29T23:01:15Z","arxiv":1,"article_processing_charge":"No","title":"Monitoring algorithmic fairness under partial observations"},{"publisher":"IOS Press","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"author":[{"last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"full_name":"Sadhukhan, Suman","last_name":"Sadhukhan","first_name":"Suman"},{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"corr_author":"1","oa":1,"scopus_import":"1","conference":{"location":"Krakow, Poland","start_date":"2023-09-30","end_date":"2023-10-04","name":"ECAI: European Conference on Artificial Intelligence"},"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"status":"public","has_accepted_license":"1","oa_version":"Published Version","date_created":"2023-11-12T23:00:56Z","publication_status":"published","title":"Reachability poorman discrete-bidding games","article_processing_charge":"No","arxiv":1,"file_date_updated":"2023-11-13T10:16:10Z","file":[{"date_updated":"2023-11-13T10:16:10Z","file_size":501011,"file_id":"14529","content_type":"application/pdf","file_name":"2023_FAIA_Avni.pdf","relation":"main_file","creator":"dernst","checksum":"1390ca38480fa4cf286b0f1a42e8c12f","access_level":"open_access","date_created":"2023-11-13T10:16:10Z","success":1}],"external_id":{"arxiv":["2307.15218"]},"abstract":[{"text":"We consider bidding games, a class of two-player zero-sum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in favor of Player 1. Player 1 wins the game iff the token visits a designated target vertex. We consider, for the first time, poorman discrete-bidding in which the granularity of the bids is restricted and the higher bid is paid to the bank. Previous work either did not impose granularity restrictions or considered Richman bidding (bids are paid to the opponent). While the latter mechanisms are technically more accessible, the former is more appealing from a practical standpoint. Our study focuses on threshold budgets, which is the necessary and sufficient initial budget required for Player 1 to ensure winning against a given Player 2 budget. We first show existence of thresholds. In DAGs, we show that threshold budgets can be approximated with error bounds by thresholds under continuous-bidding and that they exhibit a periodic behavior. We identify closed-form solutions in special cases. We implement and experiment with an algorithm to find threshold budgets.","lang":"eng"}],"page":"141-148","ec_funded":1,"publication_identifier":{"isbn":["9781643684369"],"issn":["0922-6389"]},"month":"09","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14518","date_updated":"2025-03-31T16:01:09Z","date_published":"2023-09-28T00:00:00Z","day":"28","doi":"10.3233/FAIA230264","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       372","publication":"Frontiers in Artificial Intelligence and Applications","acknowledgement":"This research was supported in part by ISF grant no. 1679/21, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie Grant Agreement No. 665385.","ddc":["000"],"volume":372,"type":"conference","citation":{"apa":"Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &#38; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In <i>Frontiers in Artificial Intelligence and Applications</i> (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>","ista":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.","ieee":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in <i>Frontiers in Artificial Intelligence and Applications</i>, Krakow, Poland, 2023, vol. 372, pp. 141–148.","chicago":"Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde Zikelic. “Reachability Poorman Discrete-Bidding Games.” In <i>Frontiers in Artificial Intelligence and Applications</i>, 372:141–48. IOS Press, 2023. <a href=\"https://doi.org/10.3233/FAIA230264\">https://doi.org/10.3233/FAIA230264</a>.","mla":"Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.” <i>Frontiers in Artificial Intelligence and Applications</i>, vol. 372, IOS Press, 2023, pp. 141–48, doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>.","ama":"Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman discrete-bidding games. In: <i>Frontiers in Artificial Intelligence and Applications</i>. Vol 372. IOS Press; 2023:141-148. doi:<a href=\"https://doi.org/10.3233/FAIA230264\">10.3233/FAIA230264</a>","short":"G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148."}},{"publication_identifier":{"isbn":["9783031453281"],"eissn":["1611-3349"],"issn":["0302-9743"]},"ec_funded":1,"month":"10","year":"2023","date_updated":"2025-09-09T13:20:26Z","_id":"14559","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"22","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2210.05304","open_access":"1"}],"date_published":"2023-10-22T00:00:00Z","doi":"10.1007/978-3-031-45329-8_17","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication":"21st International Symposium on Automated Technology for Verification and Analysis","intvolume":"     14215","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","short":"M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.","ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: <i>21st International Symposium on Automated Technology for Verification and Analysis</i>. Vol 14215. Springer Nature; 2023:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>","chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, 14215:357–79. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>.","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>.","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In <i>21st International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>","ista":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379."},"volume":14215,"isi":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer Nature","alternative_title":["LNCS"],"corr_author":"1","author":[{"first_name":"Matin","last_name":"Ansaripour","full_name":"Ansaripour, Matin"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"scopus_import":"1","conference":{"start_date":"2023-10-24","location":"Singapore, Singapore","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2023-10-27"},"oa":1,"status":"public","arxiv":1,"title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","date_created":"2023-11-19T23:00:56Z","page":"357-379","abstract":[{"lang":"eng","text":"We consider the problem of learning control policies in discrete-time stochastic systems which guarantee that the system stabilizes within some specified stabilization region with probability 1. Our approach is based on the novel notion of stabilizing ranking supermartingales (sRSMs) that we introduce in this work. Our sRSMs overcome the limitation of methods proposed in previous works whose applicability is restricted to systems in which the stabilizing region cannot be left once entered under any control policy. We present a learning procedure that learns a control policy together with an sRSM that formally certifies probability 1 stability, both learned as neural networks. We show that this procedure can also be adapted to formally verifying that, under a given Lipschitz continuous control policy, the stochastic system stabilizes within some stabilizing region with probability 1. Our experimental evaluation shows that our learning procedure can successfully learn provably stabilizing policies in practice."}],"external_id":{"isi":["001456127300017"],"arxiv":["2210.05304"]}}]