[{"ddc":["000"],"file":[{"creator":"dernst","content_type":"application/pdf","file_name":"2020_LNCS_Kragl.pdf","date_updated":"2020-08-06T08:14:54Z","date_created":"2020-08-06T08:14:54Z","success":1,"file_id":"8201","access_level":"open_access","relation":"main_file","file_size":804237}],"quality_controlled":"1","month":"07","volume":12224,"external_id":{"isi":["000695276000014"]},"language":[{"iso":"eng"}],"oa_version":"Published Version","intvolume":" 12224","type":"conference","date_published":"2020-07-14T00:00:00Z","corr_author":"1","status":"public","has_accepted_license":"1","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-030-53288-8_14","related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"scopus_import":"1","fulldoi":"https://doi.org/10.1007/978-3-030-53288-8_14","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"publisher":"Springer Nature","date_created":"2020-08-03T11:45:35Z","citation":{"short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298. doi:10.1007/978-3-030-53288-8_14","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298."},"file_date_updated":"2020-08-06T08:14:54Z","oa":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030532871"],"eissn":["1611-3349"],"eisbn":["9783030532888"]},"_id":"8195","year":"2020","alternative_title":["LNCS"],"abstract":[{"text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier.","lang":"eng"}],"page":"275-298","author":[{"full_name":"Kragl, Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"}],"publication":"Computer Aided Verification","title":"Refinement for structured concurrent programs","date_updated":"2026-04-08T07:23:52Z","publication_status":"published","article_processing_charge":"No","day":"14"},{"external_id":{"isi":["000587712700072"],"arxiv":["1905.02458"]},"language":[{"iso":"eng"}],"keyword":["reachability","hybrid systems","decomposition"],"oa_version":"Preprint","date_published":"2020-10-01T00:00:00Z","type":"conference","ddc":["000"],"file":[{"file_name":"2020EMSOFT.pdf","date_updated":"2020-08-24T12:53:15Z","checksum":"d19e97d0f8a3a441dc078ec812297d75","creator":"cschilli","content_type":"application/pdf","relation":"main_file","file_size":696384,"date_created":"2020-08-24T12:53:15Z","file_id":"8288","success":1,"access_level":"open_access"}],"quality_controlled":"1","month":"10","related_material":{"record":[{"relation":"later_version","id":"8790","status":"public"}]},"has_accepted_license":"1","status":"public","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"department":[{"_id":"ToHe"}],"citation":{"ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” in Proceedings of the International Conference on Embedded Software, Virtual , 2020.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. Proceedings of the International Conference on Embedded Software. EMSOFT: Embedded Software.","mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” Proceedings of the International Conference on Embedded Software, 2020.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. In: Proceedings of the International Conference on Embedded Software. ; 2020.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual .","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the International Conference on Embedded Software, 2020.","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” In Proceedings of the International Conference on Embedded Software, 2020."},"file_date_updated":"2020-08-24T12:53:15Z","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_created":"2020-08-24T12:56:20Z","arxiv":1,"date_updated":"2026-04-03T09:32:00Z","ec_funded":1,"publication_status":"published","article_processing_charge":"No","day":"01","_id":"8287","year":"2020","conference":{"end_date":"2020-09-25","start_date":"2020-09-20","name":"EMSOFT: Embedded Software","location":"Virtual "},"abstract":[{"lang":"eng","text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this paper, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks."}],"publication":"Proceedings of the International Conference on Embedded Software","title":"Reachability analysis of linear hybrid systems via block decomposition","author":[{"first_name":"Sergiy","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"first_name":"Kostiantyn","full_name":"Potomkin, Kostiantyn","last_name":"Potomkin"},{"first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian"}]},{"ddc":["000"],"file":[{"file_name":"kragl-thesis.pdf","date_updated":"2020-09-04T12:17:47Z","checksum":"26fe261550f691280bda4c454bf015c7","creator":"bkragl","content_type":"application/pdf","relation":"main_file","file_size":1348815,"date_created":"2020-09-04T12:17:47Z","file_id":"8333","access_level":"open_access"},{"file_size":372312,"relation":"source_file","file_id":"8335","access_level":"closed","date_created":"2020-09-04T13:00:17Z","date_updated":"2020-09-04T13:00:17Z","file_name":"kragl-thesis.zip","content_type":"application/zip","checksum":"b9694ce092b7c55557122adba8337ebc","creator":"bkragl"}],"month":"09","language":[{"iso":"eng"}],"oa_version":"Published Version","degree_awarded":"PhD","type":"dissertation","date_published":"2020-09-03T00:00:00Z","corr_author":"1","has_accepted_license":"1","status":"public","OA_place":"publisher","department":[{"_id":"ToHe"}],"doi":"10.15479/AT:ISTA:8332","related_material":{"record":[{"relation":"part_of_dissertation","id":"8195","status":"public"},{"status":"public","id":"133","relation":"part_of_dissertation"},{"id":"160","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"8012","relation":"part_of_dissertation"}]},"fulldoi":"https://doi.org/10.15479/AT:ISTA:8332","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Institute of Science and Technology Austria","date_created":"2020-09-04T12:24:12Z","citation":{"ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:10.15479/AT:ISTA:8332","mla":"Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.","apa":"Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020."},"file_date_updated":"2020-09-04T13:00:17Z","oa":1,"publication_identifier":{"issn":["2663-337X"]},"year":"2020","_id":"8332","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step."}],"page":"120","title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117"}],"date_updated":"2026-06-18T19:29:42Z","supervisor":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publication_status":"published","day":"03","article_processing_charge":"No"},{"ec_funded":1,"publication_status":"published","day":"25","article_processing_charge":"No","date_updated":"2026-06-18T19:34:03Z","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}],"page":"49-75","author":[{"last_name":"Geretti","full_name":"Geretti, Luca","first_name":"Luca"},{"full_name":"Alexandre Dit Sandretto, Julien","last_name":"Alexandre Dit Sandretto","first_name":"Julien"},{"first_name":"Matthias","full_name":"Althoff, Matthias","last_name":"Althoff"},{"full_name":"Benet, Luis","last_name":"Benet","first_name":"Luis"},{"first_name":"Alexandre","full_name":"Chapoutot, Alexandre","last_name":"Chapoutot"},{"first_name":"Xin","full_name":"Chen, Xin","last_name":"Chen"},{"full_name":"Collins, Pieter","last_name":"Collins","first_name":"Pieter"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"full_name":"Freire, Daniel","last_name":"Freire","first_name":"Daniel"},{"first_name":"Fabian","full_name":"Immler, Fabian","last_name":"Immler"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"last_name":"Sanders","full_name":"Sanders, David","first_name":"David"},{"full_name":"Schilling, Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","publication":"EPiC Series in Computing","year":"2020","_id":"8571","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12","end_date":"2020-07-12"},"citation":{"chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","ieee":"L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.","ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"EasyChair","date_created":"2020-09-26T14:41:29Z","acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","fulldoi":"https://doi.org/10.29007/zkf6","scopus_import":"1","doi":"10.29007/zkf6","status":"public","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"department":[{"_id":"ToHe"}],"corr_author":"1","oa_version":"Published Version","intvolume":" 74","date_published":"2020-09-25T00:00:00Z","type":"conference","volume":74,"language":[{"iso":"eng"}],"month":"09","ddc":["000"],"main_file_link":[{"url":"https://easychair.org/publications/download/nrdD","open_access":"1"}],"quality_controlled":"1"},{"intvolume":" 74","date_published":"2020-09-25T00:00:00Z","type":"conference","oa_version":"Published Version","volume":74,"language":[{"iso":"eng"}],"month":"09","main_file_link":[{"url":"https://easychair.org/publications/download/DRpS","open_access":"1"}],"quality_controlled":"1","ddc":["000"],"scopus_import":"1","doi":"10.29007/7dt2","project":[{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"department":[{"_id":"ToHe"}],"status":"public","corr_author":"1","oa":1,"citation":{"ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48."},"publisher":"EasyChair","date_created":"2020-09-26T14:49:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.29007/7dt2","acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","publication_status":"published","article_processing_charge":"No","day":"25","ec_funded":1,"date_updated":"2026-06-18T19:34:29Z","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","author":[{"last_name":"Althoff","full_name":"Althoff, Matthias","first_name":"Matthias"},{"full_name":"Bak, Stanley","last_name":"Bak","first_name":"Stanley"},{"first_name":"Zongnan","last_name":"Bao","full_name":"Bao, Zongnan"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"full_name":"Li, Yangge","last_name":"Li","first_name":"Yangge"},{"first_name":"Sayan","full_name":"Mitra, Sayan","last_name":"Mitra"},{"first_name":"Rajarshi","full_name":"Ray, Rajarshi","last_name":"Ray"},{"last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"},{"first_name":"Stefan","full_name":"Schupp, Stefan","last_name":"Schupp"},{"first_name":"Mark","full_name":"Wetzlinger, Mark","last_name":"Wetzlinger"}],"publication":"EPiC Series in Computing","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"page":"16-48","year":"2020","_id":"8572","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2020-07-12","start_date":"2020-07-12"}},{"file_date_updated":"2020-10-05T14:13:19Z","citation":{"mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.","apa":"Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2","ista":"Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2."},"oa":1,"article_number":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-04T22:01:36Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2","tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"day":"06","article_processing_charge":"No","publication_status":"published","date_updated":"2025-07-10T11:57:09Z","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"title":"A survey of bidding games on graphs","publication":"31st International Conference on Concurrency Theory","author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","last_name":"Avni","full_name":"Avni, Guy"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publication_identifier":{"isbn":["9783959771603"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Virtual","end_date":"2020-09-04","start_date":"2020-09-01"},"_id":"8599","year":"2020","oa_version":"Published Version","date_published":"2020-08-06T00:00:00Z","type":"conference","intvolume":" 171","language":[{"iso":"eng"}],"volume":171,"month":"08","file":[{"date_updated":"2020-10-05T14:13:19Z","file_name":"2020_LIPIcsCONCUR_Avni.pdf","content_type":"application/pdf","checksum":"8f33b098e73724e0ac817f764d8e1a2d","creator":"dernst","file_size":868510,"relation":"main_file","file_id":"8611","success":1,"access_level":"open_access","date_created":"2020-10-05T14:13:19Z"}],"ddc":["000"],"quality_controlled":"1","scopus_import":"1","doi":"10.4230/LIPIcs.CONCUR.2020.2","status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"corr_author":"1"},{"scopus_import":"1","doi":"10.4230/LIPIcs.CONCUR.2020.23","has_accepted_license":"1","status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"corr_author":"1","oa_version":"Published Version","type":"conference","date_published":"2020-08-06T00:00:00Z","intvolume":" 171","language":[{"iso":"eng"}],"external_id":{"arxiv":["2007.08917"]},"volume":171,"month":"08","file":[{"relation":"main_file","file_size":601231,"date_created":"2020-10-05T14:04:25Z","access_level":"open_access","file_id":"8610","success":1,"file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","date_updated":"2020-10-05T14:04:25Z","creator":"dernst","checksum":"5039752f644c4b72b9361d21a5e31baf","content_type":"application/pdf"}],"ddc":["000"],"quality_controlled":"1","article_processing_charge":"No","day":"06","publication_status":"published","date_updated":"2025-07-10T11:57:10Z","arxiv":1,"abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating."}],"title":"Multi-dimensional long-run average problems for vector addition systems with states","publication":"31st International Conference on Concurrency Theory","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"isbn":["9783959771603"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"conference":{"location":"Virtual","name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","end_date":"2020-09-04"},"_id":"8600","year":"2020","file_date_updated":"2020-10-05T14:04:25Z","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23"},"oa":1,"article_number":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-04T22:01:36Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23","tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"}},{"month":"10","file":[{"relation":"main_file","file_size":478148,"date_created":"2020-10-15T14:28:06Z","access_level":"open_access","file_id":"8665","success":1,"file_name":"monitorability.pdf","date_updated":"2020-10-15T14:28:06Z","creator":"esarac","checksum":"00661f9b7034f52e18bf24fa552b8194","content_type":"application/pdf"}],"ddc":["000"],"quality_controlled":"1","oa_version":"Submitted Version","type":"conference","date_published":"2020-10-02T00:00:00Z","intvolume":" 12399","language":[{"iso":"eng"}],"external_id":{"isi":["000728160600001"]},"volume":12399,"status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","doi":"10.1007/978-3-030-60508-7_1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-10-07T15:05:37Z","publisher":"Springer Nature","isi":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","fulldoi":"https://doi.org/10.1007/978-3-030-60508-7_1","file_date_updated":"2020-10-15T14:28:06Z","citation":{"ieee":"T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.","ista":"Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification. RV: Runtime Verification, LNCS, vol. 12399, 3–18.","apa":"Henzinger, T. A., & Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-60508-7_1","ama":"Henzinger TA, Sarac NE. Monitorability under assumptions. In: Runtime Verification. Vol 12399. Springer Nature; 2020:3-18. doi:10.1007/978-3-030-60508-7_1","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.” Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.” In Runtime Verification, 12399:3–18. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-60508-7_1.","short":"T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020, pp. 3–18."},"oa":1,"page":"3-18","abstract":[{"text":"We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers.","lang":"eng"}],"title":"Monitorability under assumptions","publication":"Runtime Verification","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","full_name":"Sarac, Naci E"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030605070"],"eisbn":["9783030605087"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"year":"2020","_id":"8623","conference":{"end_date":"2020-10-09","start_date":"2020-10-06","location":"Los Angeles, CA, United States","name":"RV: Runtime Verification"},"article_processing_charge":"No","day":"02","publication_status":"published","date_updated":"2026-04-16T10:22:01Z"},{"author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"publication":"Nature Machine Intelligence","title":"Neural circuit policies enabling auditable autonomy","page":"642-652","abstract":[{"text":"A central goal of artificial intelligence in high-stakes decision-making applications is to design a single algorithm that simultaneously expresses generalizability by learning coherent representations of their world and interpretable explanations of its dynamics. Here, we combine brain-inspired neural computation principles and scalable deep learning architectures to design compact neural controllers for task-specific compartments of a full-stack autonomous vehicle control system. We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated input features to outputs by 253 synapses, learns to map high-dimensional inputs into steering commands. This system shows superior generalizability, interpretability and robustness compared with orders-of-magnitude larger black-box learning systems. The obtained neural agents enable high-fidelity autonomy for task-specific parts of a complex autonomous system.","lang":"eng"}],"year":"2020","_id":"8679","publication_identifier":{"eissn":["2522-5839"]},"day":"01","article_processing_charge":"No","publication_status":"published","date_updated":"2025-04-15T06:25:57Z","date_created":"2020-10-19T13:46:06Z","isi":1,"publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","fulldoi":"https://doi.org/10.1038/s42256-020-00237-3","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence. Springer Nature, 2020. https://doi.org/10.1038/s42256-020-00237-3.","short":"M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652.","ista":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.","ama":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2020;2:642-652. doi:10.1038/s42256-020-00237-3","apa":"Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., & Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature. https://doi.org/10.1038/s42256-020-00237-3","mla":"Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3.","ieee":"M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” Nature Machine Intelligence, vol. 2. Springer Nature, pp. 642–652, 2020."},"article_type":"original","department":[{"_id":"ToHe"}],"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"status":"public","scopus_import":"1","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/new-deep-learning-models/"}]},"doi":"10.1038/s42256-020-00237-3","month":"10","quality_controlled":"1","type":"journal_article","date_published":"2020-10-01T00:00:00Z","intvolume":" 2","oa_version":"None","language":[{"iso":"eng"}],"volume":2,"external_id":{"isi":["000583337200011"]}},{"scopus_import":"1","doi":"10.1109/ICRA40945.2020.9196608","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"status":"public","has_accepted_license":"1","date_published":"2020-05-01T00:00:00Z","type":"conference","oa_version":"Submitted Version","language":[{"iso":"eng"}],"external_id":{"isi":["000712319503110"]},"month":"05","quality_controlled":"1","file":[{"file_name":"2020_ICRA_Lechner.pdf","date_updated":"2020-11-06T10:58:49Z","creator":"dernst","checksum":"fccf7b986ac78046918a298cc6849a50","content_type":"application/pdf","relation":"main_file","file_size":1070010,"date_created":"2020-11-06T10:58:49Z","access_level":"open_access","file_id":"8733","success":1}],"ddc":["000"],"day":"01","article_processing_charge":"No","publication_status":"published","date_updated":"2025-07-10T12:01:21Z","author":[{"last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","publication":"Proceedings - IEEE International Conference on Robotics and Automation","page":"5446-5452","abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"alternative_title":["ICRA"],"year":"2020","_id":"8704","conference":{"end_date":"2020-08-31","start_date":"2020-05-31","location":"Paris, France","name":"ICRA: International Conference on Robotics and Automation"},"publication_identifier":{"issn":["1050-4729"],"isbn":["9781728173955"]},"oa":1,"file_date_updated":"2020-11-06T10:58:49Z","citation":{"ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in Proceedings - IEEE International Conference on Robotics and Automation, Paris, France, 2020, pp. 5446–5452.","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: Proceedings - IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452. doi:10.1109/ICRA40945.2020.9196608","apa":"Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In Proceedings - IEEE International Conference on Robotics and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608."},"date_created":"2020-10-25T23:01:19Z","isi":1,"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","fulldoi":"https://doi.org/10.1109/ICRA40945.2020.9196608"},{"date_updated":"2025-04-15T06:26:12Z","arxiv":1,"ec_funded":1,"article_processing_charge":"No","day":"04","publication_status":"published","publication_identifier":{"isbn":["9781728191485"]},"_id":"8750","conference":{"location":"Virtual Conference","name":"MEMOCODE: Conference on Formal Methods and Models for System Design","start_date":"2020-12-02","end_date":"2020-12-04"},"year":"2020","abstract":[{"lang":"eng","text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost."}],"publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","title":"Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions","author":[{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"full_name":"Freire, Daniel","last_name":"Freire","first_name":"Daniel"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling"}],"citation":{"ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions,” in 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, Virtual Conference, 2020.","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994.","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In: 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE; 2020. doi:10.1109/MEMOCODE51338.2020.9314994","mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, 9314994, IEEE, 2020, doi:10.1109/MEMOCODE51338.2020.9314994.","apa":"Forets, M., Freire, D., & Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE. https://doi.org/10.1109/MEMOCODE51338.2020.9314994","chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE, 2020. https://doi.org/10.1109/MEMOCODE51338.2020.9314994.","short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020."},"oa":1,"article_number":"9314994","fulldoi":"https://doi.org/10.1109/MEMOCODE51338.2020.9314994","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-11-10T07:04:57Z","isi":1,"publisher":"IEEE","doi":"10.1109/MEMOCODE51338.2020.9314994","scopus_import":"1","status":"public","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000661920400013"],"arxiv":["2006.12325"]},"oa_version":"Preprint","date_published":"2020-12-04T00:00:00Z","type":"conference","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2006.12325","open_access":"1"}],"month":"12"},{"related_material":{"record":[{"relation":"earlier_version","id":"8287","status":"public"}]},"doi":"10.1109/TCAD.2020.3012859","scopus_import":"1","status":"public","department":[{"_id":"ToHe"}],"OA_place":"publisher","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"volume":39,"external_id":{"arxiv":["1905.02458"],"isi":["000587712700072"]},"oa_version":"Preprint","date_published":"2020-11-01T00:00:00Z","type":"journal_article","intvolume":" 39","OA_type":"hybrid","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.02458"}],"quality_controlled":"1","month":"11","arxiv":1,"date_updated":"2026-04-03T09:32:00Z","ec_funded":1,"article_processing_charge":"No","day":"01","publication_status":"published","publication_identifier":{"eissn":["1937-4151"],"issn":["0278-0070"]},"year":"2020","_id":"8790","page":"4018-4029","abstract":[{"lang":"eng","text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this article, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks."}],"author":[{"last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"last_name":"Forets","full_name":"Forets, Marcelo","first_name":"Marcelo"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"last_name":"Potomkin","full_name":"Potomkin, Kostiantyn","first_name":"Kostiantyn"},{"full_name":"Schilling, Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","title":"Reachability analysis of linear hybrid systems via block decomposition","article_type":"original","issue":"11","citation":{"ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 4018–4029, 2020.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029.","mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):4018-4029. doi:10.1109/TCAD.2020.3012859","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012859","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012859.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029."},"oa":1,"fulldoi":"https://doi.org/10.1109/TCAD.2020.3012859","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Air Force. ","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-11-22T23:01:25Z","publisher":"IEEE","isi":1},{"scopus_import":"1","doi":"10.34727/2020/isbn.978-3-85448-042-6_21","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","date_published":"2020-09-21T00:00:00Z","type":"conference","oa_version":"Published Version","language":[{"iso":"eng"}],"month":"09","quality_controlled":"1","ddc":["000"],"file":[{"file_id":"9109","success":1,"access_level":"open_access","date_created":"2021-02-09T09:39:02Z","file_size":990999,"relation":"main_file","content_type":"application/pdf","checksum":"d616d549a0ade78606b16f8a9540820f","creator":"dernst","date_updated":"2021-02-09T09:39:02Z","file_name":"2020_FMCAD_Alamdari.pdf"}],"publication_status":"published","article_processing_charge":"No","day":"21","date_updated":"2025-07-10T12:01:32Z","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","title":"Formal methods with a touch of magic","author":[{"first_name":"Par Alizadeh","full_name":"Alamdari, Par Alizadeh","last_name":"Alamdari"},{"last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"}],"abstract":[{"text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.","lang":"eng"}],"page":"138-147","_id":"9040","year":"2020","conference":{"start_date":"2020-09-21","end_date":"2020-09-24","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Online Conference"},"publication_identifier":{"eissn":["2708-7824"],"isbn":["9783854480426"]},"oa":1,"citation":{"ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.","chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147."},"file_date_updated":"2021-02-09T09:39:02Z","publisher":"TU Wien Academic Press","date_created":"2021-01-24T23:01:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","fulldoi":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21"},{"intvolume":" 2020","type":"conference","date_published":"2020-12-14T00:00:00Z","oa_version":"Preprint","external_id":{"arxiv":["2012.07458"]},"volume":2020,"language":[{"iso":"eng"}],"month":"12","main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"quality_controlled":"1","scopus_import":"1","doi":"10.1109/CDC42340.2020.9304042","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"status":"public","oa":1,"citation":{"ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563."},"publisher":"IEEE","date_created":"2021-02-07T23:01:14Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","fulldoi":"https://doi.org/10.1109/CDC42340.2020.9304042","publication_status":"published","day":"14","article_processing_charge":"No","date_updated":"2026-04-16T09:34:59Z","arxiv":1,"title":"Lagrangian reachtubes: The next generation","author":[{"first_name":"Sophie","full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher"},{"last_name":"Cyranka","full_name":"Cyranka, Jacek","first_name":"Jacek"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Md Ariful","last_name":"Islam","full_name":"Islam, Md Ariful"},{"last_name":"Smolka","full_name":"Smolka, Scott A.","first_name":"Scott A."},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"publication":"Proceedings of the 59th IEEE Conference on Decision and Control","abstract":[{"lang":"eng","text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*."}],"page":"1556-1563","_id":"9103","year":"2020","conference":{"start_date":"2020-12-14","end_date":"2020-12-18","location":"Jeju Islang, Korea (South)","name":"CDC: Conference on Decision and Control"},"publication_identifier":{"issn":["0743-1546"],"isbn":["9781728174471"]}},{"issue":"02","article_type":"original","citation":{"ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546."},"oa":1,"fulldoi":"https://doi.org/10.1609/aaai.v34i02.5546","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for the Advancement of Artificial Intelligence","date_created":"2021-02-25T09:05:18Z","date_updated":"2025-07-03T11:44:58Z","arxiv":1,"publication_status":"published","day":"03","article_processing_charge":"No","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"],"issn":["2159-5399"]},"year":"2020","_id":"9197","conference":{"end_date":"2020-02-12","start_date":"2020-02-07","location":"New York, NY, United States","name":"AAAI: Conference on Artificial Intelligence"},"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"page":"1798-1805","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","author":[{"last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Tkadlec","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684"}],"title":"All-pay bidding games on graphs","volume":34,"external_id":{"arxiv":["1911.08360"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","intvolume":" 34","date_published":"2020-04-03T00:00:00Z","type":"journal_article","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.08360"}],"quality_controlled":"1","month":"04","doi":"10.1609/aaai.v34i02.5546","scopus_import":"1","status":"public","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","call_identifier":"FWF"}],"OA_place":"repository","department":[{"_id":"ToHe"},{"_id":"KrCh"}]},{"doi":"10.1109/RTSS49844.2020.00031","scopus_import":"1","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000680435100021"]},"date_published":"2020-12-01T00:00:00Z","type":"conference","oa_version":"Submitted Version","quality_controlled":"1","file":[{"date_created":"2021-02-26T16:38:14Z","access_level":"open_access","file_id":"9203","relation":"main_file","file_size":1125794,"creator":"mgarcias","checksum":"8f97f229316c3b3a6f0cf99297aa0941","content_type":"application/pdf","file_name":"main.pdf","date_updated":"2021-02-26T16:38:14Z"}],"ddc":["000"],"month":"12","date_updated":"2025-04-15T06:25:57Z","article_processing_charge":"No","day":"01","publication_status":"published","_id":"9202","conference":{"start_date":"2020-12-01","end_date":"2020-12-04","location":"Houston, TX, USA ","name":"RTTS: Real-Time Systems Symposium"},"year":"2020","publication_identifier":{"eissn":["2576-3172"],"eisbn":["9781728183244"]},"publication":"2020 IEEE Real-Time Systems Symposium","title":"Hybridization for stability verification of nonlinear switched systems","author":[{"last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam","first_name":"Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2936-5719"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"page":"244-256","abstract":[{"lang":"eng","text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function."}],"oa":1,"file_date_updated":"2021-02-26T16:38:14Z","citation":{"short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256.","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256."},"acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","fulldoi":"https://doi.org/10.1109/RTSS49844.2020.00031","date_created":"2021-02-26T16:38:24Z","isi":1,"publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"intvolume":" 33","date_published":"2020-12-06T00:00:00Z","type":"conference","oa_version":"Published Version","volume":33,"external_id":{"arxiv":["2004.14340"]},"language":[{"iso":"eng"}],"month":"12","quality_controlled":"1","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"ddc":["000"],"scopus_import":"1","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"DaAl"},{"_id":"ToHe"}],"status":"public","corr_author":"1","oa":1,"citation":{"chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression,” 33:18098–109. Neural Information Processing Systems Foundation, 2020.","short":"S.P. Singh, D.-A. Alistarh, in:, Neural Information Processing Systems Foundation, 2020, pp. 18098–18109.","apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression (Vol. 33, pp. 18098–18109). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Vol 33. Neural Information Processing Systems Foundation; 2020:18098-18109.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. WoodFisher: Efficient Second-Order Approximation for Neural Network Compression. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 18098–109.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 18098–18109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109."},"publisher":"Neural Information Processing Systems Foundation","date_created":"2021-07-04T22:01:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","publication_status":"published","article_processing_charge":"No","day":"06","ec_funded":1,"arxiv":1,"date_updated":"2026-06-18T19:55:12Z","title":"WoodFisher: Efficient second-order approximation for neural network compression","author":[{"full_name":"Singh, Sidak Pal","last_name":"Singh","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","first_name":"Sidak Pal"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"abstract":[{"text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher.","lang":"eng"}],"page":"18098-18109","year":"2020","_id":"9632","conference":{"location":"Vancouver, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2020-12-12","start_date":"2020-12-06"},"alternative_title":["Advances in Neural Information Processing Systems"],"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713829546"]}},{"has_accepted_license":"1","status":"public","project":[{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"doi":"10.1016/j.tcs.2019.06.031","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1341"}]},"scopus_import":"1","ddc":["000"],"file":[{"checksum":"e86635417f45eb2cd75778f91382f737","creator":"dernst","content_type":"application/pdf","file_name":"2020_TheoreticalCS_Avni.pdf","date_updated":"2020-10-09T06:31:22Z","date_created":"2020-10-09T06:31:22Z","success":1,"file_id":"8639","access_level":"open_access","relation":"main_file","file_size":1413001}],"quality_controlled":"1","month":"02","volume":807,"external_id":{"isi":["000512219400004"]},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","intvolume":" 807","date_published":"2020-02-06T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["0304-3975"]},"_id":"6761","year":"2020","abstract":[{"text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.","lang":"eng"}],"page":"42-55","publication":"Theoretical Computer Science","author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"title":"Dynamic resource allocation games","date_updated":"2026-04-16T09:35:15Z","publication_status":"published","day":"06","article_processing_charge":"No","fulldoi":"https://doi.org/10.1016/j.tcs.2019.06.031","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","isi":1,"publisher":"Elsevier","date_created":"2019-08-04T21:59:20Z","article_type":"original","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020."},"file_date_updated":"2020-10-09T06:31:22Z","oa":1},{"scopus_import":1,"doi":"10.4230/LIPIcs.CSL.2020.20","has_accepted_license":"1","status":"public","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"oa_version":"Published Version","date_published":"2020-01-15T00:00:00Z","type":"conference","intvolume":" 152","language":[{"iso":"eng"}],"external_id":{"arxiv":["1910.06097"]},"volume":152,"month":"01","file":[{"content_type":"application/pdf","checksum":"b9a691d658d075c6369d3304d17fb818","creator":"bkragl","date_updated":"2020-07-14T12:47:56Z","file_name":"main.pdf","file_id":"7349","access_level":"open_access","date_created":"2020-01-21T11:21:04Z","file_size":617206,"relation":"main_file"}],"ddc":["000"],"quality_controlled":"1","article_processing_charge":"No","day":"15","publication_status":"published","arxiv":1,"date_updated":"2025-04-15T06:26:07Z","abstract":[{"text":"The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. ","lang":"eng"}],"title":"Monitoring event frequencies","author":[{"orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","last_name":"Kragl","full_name":"Kragl, Bernhard"}],"publication":"28th EACSL Annual Conference on Computer Science Logic","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771320"]},"alternative_title":["LIPIcs"],"_id":"7348","year":"2020","conference":{"name":"CSL: Computer Science Logic","location":"Barcelona, Spain","start_date":"2020-01-13","end_date":"2020-01-16"},"file_date_updated":"2020-07-14T12:47:56Z","citation":{"ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","ista":"Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.","short":"T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20."},"oa":1,"article_number":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-01-21T11:22:21Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2020.20","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"quality_controlled":"1","file":[{"content_type":"application/pdf","checksum":"80642fa0b6cd7da95dcd87d63789ad5e","creator":"dernst","date_updated":"2020-09-21T07:12:32Z","file_name":"2020_ECAI_Henzinger.pdf","success":1,"file_id":"8540","access_level":"open_access","date_created":"2020-09-21T07:12:32Z","file_size":1692214,"relation":"main_file"}],"ddc":["000"],"month":"02","language":[{"iso":"eng"}],"volume":325,"external_id":{"arxiv":["1911.09032"],"isi":["000650971303002"]},"date_published":"2020-02-24T00:00:00Z","type":"conference","intvolume":" 325","oa_version":"Published Version","corr_author":"1","department":[{"_id":"ToHe"}],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"has_accepted_license":"1","status":"public","doi":"10.3233/FAIA200375","scopus_import":"1","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"acknowledgement":"We thank Christoph Lampert and Nikolaus Mayer for fruitful discussions. This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie grant agreement No. 754411.","fulldoi":"https://doi.org/10.3233/FAIA200375","date_created":"2020-02-21T16:44:03Z","isi":1,"publisher":"IOS Press","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"file_date_updated":"2020-09-21T07:12:32Z","citation":{"ieee":"T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based monitoring of neural networks,” in 24th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.","ama":"Henzinger TA, Lukina A, Schilling C. Outside the box: Abstraction-based monitoring of neural networks. In: 24th European Conference on Artificial Intelligence. Vol 325. IOS Press; 2020:2433-2440. doi:10.3233/FAIA200375","apa":"Henzinger, T. A., Lukina, A., & Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press. https://doi.org/10.3233/FAIA200375","mla":"Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” 24th European Conference on Artificial Intelligence, vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.","ista":"Henzinger TA, Lukina A, Schilling C. 2020. Outside the box: Abstraction-based monitoring of neural networks. 24th European Conference on Artificial Intelligence. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 325, 2433–2440.","short":"T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.","chicago":"Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” In 24th European Conference on Artificial Intelligence, 325:2433–40. IOS Press, 2020. https://doi.org/10.3233/FAIA200375."},"alternative_title":["Frontiers in Artificial Intelligence and Applications"],"year":"2020","_id":"7505","conference":{"name":"ECAI: European Conference on Artificial Intelligence","location":"Santiago de Compostela, Spain","start_date":"2020-08-29","end_date":"2020-09-08"},"title":"Outside the box: Abstraction-based monitoring of neural networks","publication":"24th European Conference on Artificial Intelligence","author":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"},{"orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian"}],"page":"2433-2440","abstract":[{"text":"Neural networks have demonstrated unmatched performance in a range of classification tasks. Despite numerous efforts of the research community, novelty detection remains one of the significant limitations of neural networks. The ability to identify previously unseen inputs as novel is crucial for our understanding of the decisions made by neural networks. At runtime, inputs not falling into any of the categories learned during training cannot be classified correctly by the neural network. Existing approaches treat the neural network as a black box and try to detect novel inputs based on the confidence of the output predictions. However, neural networks are not trained to reduce their confidence for novel inputs, which limits the effectiveness of these approaches. We propose a framework to monitor a neural network by observing the hidden layers. We employ a common abstraction from program analysis - boxes - to identify novel behaviors in the monitored layers, i.e., inputs that cause behaviors outside the box. For each neuron, the boxes range over the values seen in training. The framework is efficient and flexible to achieve a desired trade-off between raising false warnings and detecting novel inputs. We illustrate the performance and the robustness to variability in the unknown classes on popular image-classification benchmarks.","lang":"eng"}],"date_updated":"2025-04-15T06:26:13Z","arxiv":1,"day":"24","article_processing_charge":"No","publication_status":"published","ec_funded":1}]