[{"article_number":"127","date_published":"2021-10-15T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","publication_identifier":{"eissn":["2475-1421"]},"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"language":[{"iso":"eng"}],"_id":"10153","intvolume":"         5","doi":"10.1145/3485504","oa_version":"Published Version","citation":{"chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>.","apa":"Mühlböck, F., &#38; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5. Association for Computing Machinery, 2021.","ama":"Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5. doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","ista":"Mühlböck F, Tate R. 2021. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 5, 127.","mla":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, 127, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>."},"month":"10","date_created":"2021-10-19T12:48:44Z","publication":"Proceedings of the ACM on Programming Languages","oa":1,"abstract":[{"lang":"eng","text":"Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical untyped patterns, and some research investigating gradually removing types from code exhibiting typical typed patterns. This paper investigates how to extend these established gradual-typing concepts to give formal guarantees not only about how to change types as code evolves but also about how to change such programming patterns as well.\r\n\r\nIn particular, we explore mixing untyped \"structural\" code with typed \"nominal\" code in an object-oriented language. But whereas previous work only allowed \"nominal\" objects to be treated as \"structural\" objects, we also allow \"structural\" objects to dynamically acquire certain nominal types, namely interfaces. We present a calculus that supports such \"cross-paradigm\" code migration and interoperation in a manner satisfying both the static and dynamic gradual guarantees, and demonstrate that the calculus can be implemented efficiently."}],"scopus_import":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","article_type":"original","conference":{"location":"Chicago, IL, United States","start_date":"2021-10-17","name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","end_date":"2021-10-23"},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"file_date_updated":"2021-10-19T12:52:23Z","acknowledgement":"We thank the reviewers for their valuable suggestions towards improving the paper. We also \r\nthank Mae Milano and Adrian Sampson, as well as the members of the Programming Languages Discussion Group at Cornell University and of the Programming Research Laboratory at Northeastern University, for their helpful feedback on preliminary findings of this work.\r\n\r\nThis material is based upon work supported in part by the National Science Foundation (NSF) through grant CCF-1350182 and the Austrian Science Fund (FWF) through grant Z211-N23 (Wittgenstein~Award).\r\nAny opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF or the FWF.","year":"2021","volume":5,"day":"15","article_processing_charge":"No","department":[{"_id":"ToHe"}],"title":"Transitioning from structural to nominal code with efficient gradual typing","date_updated":"2025-04-15T06:25:55Z","has_accepted_license":"1","publication_status":"published","type":"journal_article","file":[{"date_created":"2021-10-19T12:52:23Z","file_id":"10154","success":1,"file_size":770269,"creator":"fmuehlbo","content_type":"application/pdf","file_name":"monnom-oopsla21.pdf","relation":"main_file","date_updated":"2021-10-19T12:52:23Z","checksum":"71011efd2da771cafdec7f0d9693f8c1","access_level":"open_access"}],"ddc":["005"],"publisher":"Association for Computing Machinery","author":[{"orcid":"0000-0003-1548-0177","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","full_name":"Mühlböck, Fabian"},{"last_name":"Tate","first_name":"Ross","full_name":"Tate, Ross"}],"quality_controlled":"1"},{"publication_identifier":{"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"isbn":["9-783-0308-8493-2"],"issn":["0302-9743"]},"arxiv":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","related_material":{"record":[{"relation":"extended_version","status":"public","id":"13234"}]},"date_published":"2021-10-06T00:00:00Z","oa":1,"publication":"21st International Conference on Runtime Verification","month":"10","date_created":"2021-10-31T23:01:31Z","ec_funded":1,"abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios.","lang":"eng"}],"scopus_import":"1","language":[{"iso":"eng"}],"place":"Cham","page":"42-61","oa_version":"Preprint","doi":"10.1007/978-3-030-88494-9_3","citation":{"mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61.","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>"},"_id":"10206","corr_author":"1","acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, 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łodowska-Curie grant agreement No. 754411.","alternative_title":["LNCS"],"isi":1,"day":"06","year":"2021","volume":"12974 ","external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"keyword":["monitoring","neural networks","novelty detection"],"conference":{"end_date":"2021-10-14","start_date":"2021-10-11","name":"RV: Runtime Verification","location":"Virtual"},"publisher":"Springer Nature","author":[{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna","first_name":"Anna"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"date_updated":"2025-04-15T06:26:14Z","article_processing_charge":"No","title":"Into the unknown: active monitoring of neural networks","department":[{"_id":"ToHe"}],"publication_status":"published","type":"conference"},{"acknowledgement":"We thank Robert Geirhos and Roland Zimmermann for their participation in the case study and valuable feedback, Chris Olah and Nick Cammarata for valuable discussions in the early phase of the project, as well as the Distill Slack workspace as a platform for discussions. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). J.B. is supported by the German Federal Ministry of Education and Research\r\n(BMBF) through the Competence Center for Machine Learning (TUE.AI, FKZ 01IS18039A) and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). R.H. is partially supported by Boeing and Horizon-2020 ECSEL (grant 783163, iDev40).\r\n","isi":1,"day":"27","volume":40,"year":"2021","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"external_id":{"isi":["000722952000024"],"arxiv":["2110.07667"]},"article_type":"original","publisher":"Wiley","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2110.07667","open_access":"1"}],"author":[{"last_name":"Sietzen","first_name":"Stefan","full_name":"Sietzen, Stefan"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Judy","full_name":"Borowski, Judy","last_name":"Borowski"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"last_name":"Waldner","first_name":"Manuela","full_name":"Waldner, Manuela"}],"issue":"7","date_updated":"2025-04-15T06:25:55Z","department":[{"_id":"ToHe"}],"title":"Interactive analysis of CNN robustness","article_processing_charge":"No","type":"journal_article","publication_status":"published","arxiv":1,"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-11-27T00:00:00Z","oa":1,"month":"11","publication":"Computer Graphics Forum","date_created":"2021-12-05T23:01:40Z","scopus_import":"1","abstract":[{"text":"While convolutional neural networks (CNNs) have found wide adoption as state-of-the-art models for image-related tasks, their predictions are often highly sensitive to small input perturbations, which the human vision is robust against. This paper presents Perturber, a web-based application that allows users to instantaneously explore how CNN activations and predictions evolve when a 3D input scene is interactively perturbed. Perturber offers a large variety of scene modifications, such as camera controls, lighting and shading effects, background modifications, object morphing, as well as adversarial attacks, to facilitate the discovery of potential vulnerabilities. Fine-tuned model versions can be directly compared for qualitative evaluation of their robustness. Case studies with machine learning experts have shown that Perturber helps users to quickly generate hypotheses about model vulnerabilities and to qualitatively compare model behavior. Using quantitative analyses, we could replicate users’ insights with other CNN architectures and input images, yielding new insights about the vulnerability of adversarially trained models.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"253-264","citation":{"ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. 2021;40(7):253-264. doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>","ieee":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive analysis of CNN robustness,” <i>Computer Graphics Forum</i>, vol. 40, no. 7. Wiley, pp. 253–264, 2021.","chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>.","apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., &#38; Waldner, M. (2021). Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>","ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264.","mla":"Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>.","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264."},"oa_version":"Preprint","doi":"10.1111/cgf.14418","intvolume":"        40","_id":"10404"},{"isi":1,"acknowledgement":"This research was supported 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łodowska-Curie grant agreement No. 754411.","year":"2021","day":"01","license":"https://creativecommons.org/licenses/by/4.0/","conference":{"end_date":"2021-05-21","start_date":"2021-05-19","name":"HSCC: Hybrid Systems - Computation and Control","location":"Nashville, TN, United States"},"external_id":{"arxiv":["2102.12734"],"isi":["000932821700028"]},"keyword":["hybrid automaton","membership","system identification"],"project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"file_date_updated":"2021-05-25T13:53:22Z","ddc":["000"],"publisher":"Association for Computing Machinery","author":[{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam","first_name":"Miriam"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian"}],"quality_controlled":"1","article_processing_charge":"No","title":"Synthesis of hybrid automata with affine dynamics from time-series data","department":[{"_id":"ToHe"}],"date_updated":"2025-07-10T12:01:40Z","has_accepted_license":"1","publication_status":"published","type":"conference","file":[{"date_updated":"2021-05-25T13:53:22Z","access_level":"open_access","checksum":"4c1202c1abf71384c3ee6fea88c2f80e","file_size":1474786,"success":1,"date_created":"2021-05-25T13:53:22Z","file_id":"9424","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_name":"2021_HSCC_Soto.pdf"}],"publication_identifier":{"isbn":["9781450383394"]},"arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_published":"2021-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication":"HSCC '21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control","month":"05","date_created":"2021-02-26T16:30:39Z","oa":1,"ec_funded":1,"abstract":[{"lang":"eng","text":"Formal design of embedded and cyber-physical systems relies on mathematical modeling. In this paper, we consider the model class of hybrid automata whose dynamics are defined by affine differential equations. Given a set of time-series data, we present an algorithmic approach to synthesize a hybrid automaton exhibiting behavior that is close to the data, up to a specified precision, and changes in synchrony with the data. A fundamental problem in our synthesis algorithm is to check membership of a time series in a hybrid automaton. Our solution integrates reachability and optimization techniques for affine dynamical systems to obtain both a sufficient and a necessary condition for membership, combined in a refinement framework. The algorithm processes one time series at a time and hence can be interrupted, provide an intermediate result, and be resumed. We report experimental results demonstrating the applicability of our synthesis approach."}],"scopus_import":"1","page":"2102.12734","language":[{"iso":"eng"}],"_id":"9200","corr_author":"1","oa_version":"Published Version","doi":"10.1145/3447928.3456704","citation":{"short":"M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, Association for Computing Machinery, 2021, p. 2102.12734.","mla":"Garcia Soto, Miriam, et al. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.” <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, Association for Computing Machinery, 2021, p. 2102.12734, doi:<a href=\"https://doi.org/10.1145/3447928.3456704\">10.1145/3447928.3456704</a>.","ista":"Garcia Soto M, Henzinger TA, Schilling C. 2021. Synthesis of hybrid automata with affine dynamics from time-series data. HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 2102.12734.","ama":"Garcia Soto M, Henzinger TA, Schilling C. Synthesis of hybrid automata with affine dynamics from time-series data. In: <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>. Association for Computing Machinery; 2021:2102.12734. doi:<a href=\"https://doi.org/10.1145/3447928.3456704\">10.1145/3447928.3456704</a>","ieee":"M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of hybrid automata with affine dynamics from time-series data,” in <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, Nashville, TN, United States, 2021, p. 2102.12734.","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.” In <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, 2102.12734. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447928.3456704\">https://doi.org/10.1145/3447928.3456704</a>.","apa":"Garcia Soto, M., Henzinger, T. A., &#38; Schilling, C. (2021). Synthesis of hybrid automata with affine dynamics from time-series data. In <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i> (p. 2102.12734). Nashville, TN, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447928.3456704\">https://doi.org/10.1145/3447928.3456704</a>"}},{"language":[{"iso":"eng"}],"page":"133-144","citation":{"ista":"Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.","mla":"Avni, Guy, et al. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8, Elsevier, 2021, pp. 133–44, doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>.","short":"G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.","apa":"Avni, G., Henzinger, T. A., &#38; Žikelić, Đ. (2021). Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>","ieee":"G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.","chicago":"Avni, Guy, Thomas A Henzinger, and Đorđe Žikelić. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>.","ama":"Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. 2021;119(8):133-144. doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>"},"doi":"10.1016/j.jcss.2021.02.008","oa_version":"Preprint","intvolume":"       119","_id":"9239","oa":1,"date_created":"2021-03-14T23:01:32Z","publication":"Journal of Computer and System Sciences","month":"03","scopus_import":"1","abstract":[{"text":"A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant : portion τ of the winning bid is paid to the other player, and portion  to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games: we unify, generalize, and simplify previous equivalences between bidding games and a class of stochastic games called random-turn games.","lang":"eng"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6884"}]},"date_published":"2021-03-03T00:00:00Z","arxiv":1,"publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"issue":"8","date_updated":"2025-07-10T11:53:57Z","title":"Bidding mechanisms in graph games","department":[{"_id":"ToHe"}],"article_processing_charge":"No","type":"journal_article","publication_status":"published","publisher":"Elsevier","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1905.03835","open_access":"1"}],"quality_controlled":"1","author":[{"full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","last_name":"Avni"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"last_name":"Žikelić","full_name":"Žikelić, Đorđe","first_name":"Đorđe"}],"external_id":{"arxiv":["1905.03835"],"isi":["000634149800009"]},"article_type":"original","isi":1,"day":"03","volume":119,"year":"2021"},{"day":"21","arxiv":1,"year":"2021","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-03-21T00:00:00Z","related_material":{"record":[{"id":"9946","relation":"other","status":"public"}]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"external_id":{"arxiv":["2103.11389"]},"article_number":"2103.11389","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.11389"}],"author":[{"full_name":"Dubach, Guillaume","first_name":"Guillaume","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","last_name":"Dubach","orcid":"0000-0001-6892-8137"},{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","first_name":"Fabian"}],"abstract":[{"lang":"eng","text":"We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics."}],"ec_funded":1,"oa":1,"month":"03","publication":"arXiv","date_created":"2021-03-23T05:38:48Z","citation":{"mla":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, 2103.11389, doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>.","ista":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv, 2103.11389.","short":"G. Dubach, F. Mühlböck, ArXiv (n.d.).","chicago":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>.","apa":"Dubach, G., &#38; Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>","ieee":"G. Dubach and F. Mühlböck, “Formal verification of Zagier’s one-sentence proof,” <i>arXiv</i>. .","ama":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>"},"oa_version":"Preprint","doi":"10.48550/arXiv.2103.11389","type":"preprint","publication_status":"submitted","_id":"9281","corr_author":"1","date_updated":"2025-04-15T06:26:12Z","language":[{"iso":"eng"}],"title":"Formal verification of Zagier's one-sentence proof","department":[{"_id":"LaEr"},{"_id":"ToHe"}],"article_processing_charge":"No"},{"month":"06","publication":"Theoretical Computer Science","date_created":"2021-07-11T22:01:18Z","oa":1,"abstract":[{"lang":"eng","text":"Gene expression is regulated by the set of transcription factors (TFs) that bind to the promoter. The ensuing regulating function is often represented as a combinational logic circuit, where output (gene expression) is determined by current input values (promoter bound TFs) only. However, the simultaneous arrival of TFs is a strong assumption, since transcription and translation of genes introduce intrinsic time delays and there is no global synchronisation among the arrival times of different molecular species at their targets. We present an experimentally implementable genetic circuit with two inputs and one output, which in the presence of small delays in input arrival, exhibits qualitatively distinct population-level phenotypes, over timescales that are longer than typical cell doubling times. From a dynamical systems point of view, these phenotypes represent long-lived transients: although they converge to the same value eventually, they do so after a very long time span. The key feature of this toy model genetic circuit is that, despite having only two inputs and one output, it is regulated by twenty-three distinct DNA-TF configurations, two of which are more stable than others (DNA looped states), one promoting and another blocking the expression of the output gene. Small delays in input arrival time result in a majority of cells in the population quickly reaching the stable state associated with the first input, while exiting of this stable state occurs at a slow timescale. In order to mechanistically model the behaviour of this genetic circuit, we used a rule-based modelling language, and implemented a grid-search to find parameter combinations giving rise to long-lived transients. Our analysis shows that in the absence of feedback, there exist path-dependent gene regulatory mechanisms based on the long timescale of transients. The behaviour of this toy model circuit suggests that gene regulatory networks can exploit event timing to create phenotypes, and it opens the possibility that they could use event timing to memorise events, without regulatory feedback. The model reveals the importance of (i) mechanistically modelling the transitions between the different DNA-TF states, and (ii) employing transient analysis thereof."}],"scopus_import":"1","page":"1-16","language":[{"iso":"eng"}],"corr_author":"1","_id":"9647","intvolume":"       893","oa_version":"Published Version","doi":"10.1016/j.tcs.2021.05.023","citation":{"short":"T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.","ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>, vol. 893, Elsevier, 2021, pp. 1–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>.","ieee":"T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” <i>Theoretical Computer Science</i>, vol. 893. Elsevier, pp. 1–16, 2021.","apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., &#38; Guet, C. C. (2021). Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>.","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. 2021;893:1-16. doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>"},"publication_identifier":{"issn":["0304-3975"]},"tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"date_published":"2021-06-04T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","publisher":"Elsevier","ddc":["004"],"author":[{"last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana"},{"full_name":"Igler, Claudia","first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","last_name":"Igler"},{"last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","full_name":"Guet, Calin C","first_name":"Calin C"}],"quality_controlled":"1","article_processing_charge":"No","title":"Long lived transients in gene regulation","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_updated":"2025-04-15T06:25:56Z","has_accepted_license":"1","publication_status":"published","type":"journal_article","file":[{"access_level":"open_access","checksum":"d3aef34cfb13e53bba4cf44d01680793","date_updated":"2022-05-12T12:13:27Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_name":"2021_TheoreticalComputerScience_Petrov.pdf","file_size":2566504,"success":1,"date_created":"2022-05-12T12:13:27Z","file_id":"11364"}],"isi":1,"acknowledgement":"Tatjana Petrov’s research was supported in part by SNSF Advanced Postdoctoral Mobility Fellowship grant number P300P2 161067, the Ministry of Science, Research and the Arts of the state of Baden-Wurttemberg, and the DFG Centre of Excellence 2117 ‘Centre for the Advanced Study of Collective Behaviour’ (ID: 422037984). Claudia Igler is the recipient of a DOC Fellowship of the Austrian Academy of Sciences. Thomas A. Henzinger’s research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2021","volume":893,"day":"04","article_type":"original","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","external_id":{"isi":["000710180500002"]},"project":[{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2022-05-12T12:13:27Z"},{"file":[{"file_name":"differentialmonitoring-techreport.pdf","creator":"fmuehlbo","content_type":"application/pdf","relation":"main_file","file_id":"9948","date_created":"2021-08-20T19:59:44Z","file_size":"320453","checksum":"0f9aafd59444cb6bdca6925d163ab946","access_level":"open_access","date_updated":"2021-09-03T12:34:28Z"}],"publication_status":"published","type":"technical_report","date_updated":"2025-04-15T06:55:00Z","has_accepted_license":"1","article_processing_charge":"No","title":"Differential monitoring","department":[{"_id":"ToHe"}],"author":[{"last_name":"Mühlböck","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","full_name":"Mühlböck, Fabian"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"ddc":["005"],"publisher":"IST Austria","file_date_updated":"2021-09-03T12:34:28Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"}],"keyword":["run-time verification","software engineering","implicit specification"],"day":"01","year":"2021","acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Matthew Milano, Manuel Rigger, Cesar Sanchez, and the members of the IST Verification Seminar for their helpful comments and insights on various stages of this work, as well as the reviewers of RV’21 for their helpful suggestions on the actual paper.","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:ISTA:9946","oa_version":"Published Version","citation":{"apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). <i>Differential monitoring</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>.","ieee":"F. Mühlböck and T. A. Henzinger, <i>Differential monitoring</i>. IST Austria, 2021.","ama":"Mühlböck F, Henzinger TA. <i>Differential Monitoring</i>. IST Austria; 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring, IST Austria, 17p.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>.","short":"F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021."},"_id":"9946","language":[{"iso":"eng"}],"page":"17","abstract":[{"lang":"eng","text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs."}],"oa":1,"date_created":"2021-08-20T20:00:37Z","month":"09","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","related_material":{"record":[{"id":"10108","relation":"shorter_version","status":"public"},{"relation":"other","status":"public","id":"9281"}]},"date_published":"2021-09-01T00:00:00Z","publication_identifier":{"issn":["2664-1690"]}},{"isi":1,"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2021","day":"29","conference":{"location":"Online","end_date":"2021-07-02","name":"LICS: Logic in Computer Science","start_date":"2021-06-29"},"external_id":{"arxiv":["2105.08353"],"isi":["000947350400021"]},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"file_date_updated":"2021-06-16T08:23:54Z","publisher":"Institute of Electrical and Electronics Engineers","ddc":["000"],"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","full_name":"Sarac, Naci E"}],"quality_controlled":"1","article_processing_charge":"No","title":"Quantitative and approximate monitoring","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2026-04-07T12:02:57Z","has_accepted_license":"1","publication_status":"published","type":"conference","file":[{"file_id":"9557","date_created":"2021-06-16T08:23:54Z","file_size":641990,"success":1,"file_name":"qam.pdf","creator":"esarac","content_type":"application/pdf","relation":"main_file","date_updated":"2021-06-16T08:23:54Z","checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","access_level":"open_access"}],"arxiv":1,"article_number":"9470547","related_material":{"record":[{"id":"20147","relation":"dissertation_contains","status":"public"}]},"date_published":"2021-06-29T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","month":"06","date_created":"2021-04-30T17:30:47Z","oa":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision."}],"language":[{"iso":"eng"}],"_id":"9356","doi":"10.1109/LICS52264.2021.9470547","oa_version":"Published Version","citation":{"ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 9470547.","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021."}},{"abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"scopus_import":"1","ec_funded":1,"oa":1,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_created":"2022-01-25T15:15:02Z","month":"05","citation":{"chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795."},"oa_version":"Published Version","intvolume":"        35","_id":"10665","corr_author":"1","language":[{"iso":"eng"}],"page":"3787-3795","arxiv":1,"publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-05-28T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"publisher":"AAAI Press","file":[{"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","access_level":"open_access","date_updated":"2022-01-26T07:41:16Z","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","content_type":"application/pdf","creator":"mlechner","relation":"main_file","file_id":"10684","date_created":"2022-01-26T07:41:16Z","success":1,"file_size":137235}],"type":"conference","publication_status":"published","has_accepted_license":"1","issue":"5A","date_updated":"2026-04-07T14:21:58Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Scalable verification of quantized neural networks","article_processing_charge":"No","day":"28","volume":35,"year":"2021","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","alternative_title":["Technical Tracks"],"file_date_updated":"2022-01-26T07:41:16Z","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"external_id":{"arxiv":["2012.08185"]},"conference":{"location":"Virtual","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09"}},{"external_id":{"arxiv":["2111.03165"]},"project":[{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","conference":{"location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"},"file_date_updated":"2022-01-26T07:39:59Z","alternative_title":[" Advances in Neural Information Processing Systems"],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","day":"01","year":"2021","date_updated":"2026-04-07T14:21:58Z","has_accepted_license":"1","article_processing_charge":"No","title":"Infinite time horizon safety of Bayesian neural networks","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"file":[{"creator":"mlechner","content_type":"application/pdf","file_name":"infinite_time_horizon_safety_o.pdf","relation":"main_file","date_created":"2022-01-26T07:39:59Z","file_id":"10682","success":1,"file_size":452492,"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","access_level":"open_access","date_updated":"2022-01-26T07:39:59Z"}],"publication_status":"published","type":"conference","ddc":["000"],"author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Ðorđe","full_name":"Žikelić, Ðorđe","last_name":"Žikelić"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"quality_controlled":"1","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2021-12-01T00:00:00Z","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"arxiv":1,"language":[{"iso":"eng"}],"oa_version":"Published Version","doi":"10.48550/arXiv.2111.03165","citation":{"mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>"},"corr_author":"1","_id":"10667","oa":1,"date_created":"2022-01-25T15:45:58Z","month":"12","publication":"35th Conference on Neural Information Processing Systems","ec_funded":1,"abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}]},{"oa_version":"Preprint","doi":"10.1109/ICRA48506.2021.9561036","citation":{"short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>."},"_id":"10666","OA_type":"green","language":[{"iso":"eng"}],"page":"4140-4147","abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"scopus_import":"1","OA_place":"repository","oa":1,"month":"06","date_created":"2022-01-25T15:44:54Z","publication":"2021 IEEE International Conference on Robotics and Automation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"date_published":"2021-06-01T00:00:00Z","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"publication_identifier":{"issn":["1050-4729"],"eissn":["2577-087X"],"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"]},"arxiv":1,"publication_status":"published","type":"conference","date_updated":"2026-04-07T14:21:58Z","has_accepted_license":"1","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Adversarial training is not ready for robot learning","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"ddc":["000"],"series_title":"ICRA","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30","end_date":"2021-06-05","location":"Xi'an, China"},"day":"01","year":"2021","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","isi":1},{"ddc":["000"],"publisher":"Elsevier","quality_controlled":"1","author":[{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","full_name":"Sarac, Naci E","first_name":"Naci E"},{"full_name":"Altun, Ömer Faruk","first_name":"Ömer Faruk","last_name":"Altun"},{"last_name":"Atam","first_name":"Kamil Tolga","full_name":"Atam, Kamil Tolga"},{"first_name":"Sertac","full_name":"Karahoda, Sertac","last_name":"Karahoda"},{"first_name":"Kamer","full_name":"Kaya, Kamer","last_name":"Kaya"},{"last_name":"Yenigün","first_name":"Hüsnü","full_name":"Yenigün, Hüsnü"}],"department":[{"_id":"ToHe"}],"title":"Boosting expensive synchronizing heuristics","article_processing_charge":"No","has_accepted_license":"1","issue":"4","date_updated":"2026-04-16T09:15:47Z","type":"journal_article","publication_status":"published","file":[{"file_name":"synchroPaperRevised.pdf","content_type":"application/pdf","creator":"esarac","relation":"main_file","file_id":"8913","date_created":"2020-12-02T13:33:51Z","file_size":634967,"checksum":"600c2f81bc898a725bcfa7cf26ff4fed","access_level":"open_access","date_updated":"2020-12-02T13:33:51Z"}],"isi":1,"acknowledgement":"This work was supported by The Scientific and Technological Research Council of Turkey (TUBITAK) [grant number 114E569]. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). We would like to thank the authors of (Roman & Szykula, 2015) for providing their heuristics implementations, which we used to compare our SynchroP implementation as given in Table 11.","volume":167,"year":"2021","day":"01","article_type":"original","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"external_id":{"isi":["000640531100038"]},"file_date_updated":"2020-12-02T13:33:51Z","publication":"Expert Systems with Applications","month":"04","date_created":"2020-12-02T13:34:25Z","oa":1,"abstract":[{"lang":"eng","text":"For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shortest synchronizing word. Although using shorter words increases the effectiveness in practice, finding a shortest one (which is not necessarily unique) is NP-hard. For this reason, there exist various heuristics in the literature. However, high-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands of states. The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of SynchroP and its variants by using algorithmic techniques. We then focus on adapting SynchroP for many-core architectures,\r\nand overall, we obtain more than 1000× speedup on GPUs compared to naive sequential implementation that has been frequently used as a benchmark to evaluate new heuristics in the literature. We also propose two SynchroP variants and evaluate their performance."}],"scopus_import":"1","language":[{"iso":"eng"}],"intvolume":"       167","corr_author":"1","_id":"8912","citation":{"short":"N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021).","ista":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. 2021. Boosting expensive synchronizing heuristics. Expert Systems with Applications. 167(4), 114203.","mla":"Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>, vol. 167, no. 4, 114203, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>.","chicago":"Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>.","apa":"Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., &#38; Yenigün, H. (2021). Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>","ieee":"N. E. Sarac, Ö. F. Altun, K. T. Atam, S. Karahoda, K. Kaya, and H. Yenigün, “Boosting expensive synchronizing heuristics,” <i>Expert Systems with Applications</i>, vol. 167, no. 4. Elsevier, 2021.","ama":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. 2021;167(4). doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>"},"oa_version":"Submitted Version","doi":"10.1016/j.eswa.2020.114203","publication_identifier":{"eissn":["1873-6793"],"issn":["0957-4174"]},"article_number":"114203","date_published":"2021-04-01T00:00:00Z","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"file_date_updated":"2022-01-26T07:35:17Z","project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"conference":{"end_date":"2020-05-01","start_date":"2020-04-26","name":"ICLR: International Conference on Learning Representations","location":"Virtual ; Addis Ababa, Ethiopia"},"day":"11","year":"2020","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","file":[{"success":1,"file_size":249431,"file_id":"10677","date_created":"2022-01-26T07:35:17Z","relation":"main_file","file_name":"iclr_2020.pdf","content_type":"application/pdf","creator":"mlechner","date_updated":"2022-01-26T07:35:17Z","access_level":"open_access","checksum":"ea13d42dd4541ddb239b6a75821fd6c9"}],"publication_status":"published","type":"conference","date_updated":"2025-04-15T06:25:56Z","has_accepted_license":"1","article_processing_charge":"No","title":"Learning representations for binary-classification without backpropagation","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"}],"quality_controlled":"1","main_file_link":[{"url":"https://openreview.net/forum?id=Bke61krFvS","open_access":"1"}],"publisher":"ICLR","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2020-03-11T00:00:00Z","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"oa_version":"Published Version","citation":{"ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in <i>8th International Conference on Learning Representations</i>, Virtual ; Addis Ababa, Ethiopia, 2020.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In <i>8th International Conference on Learning Representations</i>. ICLR, 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In <i>8th International Conference on Learning Representations</i>. Virtual ; Addis Ababa, Ethiopia: ICLR.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: <i>8th International Conference on Learning Representations</i>. ICLR; 2020.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” <i>8th International Conference on Learning Representations</i>, ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020."},"corr_author":"1","_id":"10672","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity."}],"scopus_import":"1","oa":1,"publication":"8th International Conference on Learning Representations","month":"03","date_created":"2022-01-25T15:50:00Z"},{"publication_identifier":{"issn":["2640-3498"]},"tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"date_published":"2020-01-01T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level."}],"publication":"Proceedings of the 37th International Conference on Machine Learning","date_created":"2022-01-25T15:50:34Z","oa":1,"_id":"10673","oa_version":"Published Version","citation":{"chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 4082–93. PMLR, 2020.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Virtual, 2020, pp. 4082–4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (pp. 4082–4093). Virtual.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. PMLR. ; 2020:4082-4093.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, 2020, pp. 4082–93."},"page":"4082-4093","language":[{"iso":"eng"}],"year":"2020","alternative_title":["PMLR"],"acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","file_date_updated":"2022-01-26T11:08:51Z","conference":{"name":"ML: Machine Learning","start_date":"2020-07-12","end_date":"2020-07-18","location":"Virtual"},"project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"quality_controlled":"1","ddc":["000"],"series_title":"PMLR","publication_status":"published","type":"conference","file":[{"date_updated":"2022-01-26T11:08:51Z","checksum":"c9a4a29161777fc1a89ef451c040e3b1","access_level":"open_access","file_id":"10691","date_created":"2022-01-26T11:08:51Z","success":1,"file_size":2329798,"file_name":"2020_PMLR_Hasani.pdf","creator":"cchlebak","content_type":"application/pdf","relation":"main_file"}],"article_processing_charge":"No","title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2025-04-15T06:25:56Z","has_accepted_license":"1"},{"oa_version":"None","doi":"10.1007/s10009-020-00582-z","citation":{"ama":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. <i>International Journal on Software Tools for Technology Transfer</i>. 2020;22(6):741-758. doi:<a href=\"https://doi.org/10.1007/s10009-020-00582-z\">10.1007/s10009-020-00582-z</a>","apa":"Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &#38; Ulus, D. (2020). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10009-020-00582-z\">https://doi.org/10.1007/s10009-020-00582-z</a>","chicago":"Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10009-020-00582-z\">https://doi.org/10.1007/s10009-020-00582-z</a>.","ieee":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 22, no. 6. Springer Nature, pp. 741–758, 2020.","short":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, International Journal on Software Tools for Technology Transfer 22 (2020) 741–758.","mla":"Nickovic, Dejan, et al. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 22, no. 6, Springer Nature, 2020, pp. 741–58, doi:<a href=\"https://doi.org/10.1007/s10009-020-00582-z\">10.1007/s10009-020-00582-z</a>.","ista":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2020. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. International Journal on Software Tools for Technology Transfer. 22(6), 741–758."},"_id":"10861","intvolume":"        22","language":[{"iso":"eng"}],"page":"741-758","abstract":[{"lang":"eng","text":"We introduce in this paper AMT2.0, a tool for qualitative and quantitative analysis of hybrid continuous and Boolean signals that combine numerical values and discrete events. The evaluation of the signals is based on rich temporal specifications expressed in extended signal temporal logic, which integrates timed regular expressions within signal temporal logic. The tool features qualitative monitoring (property satisfaction checking), trace diagnostics for explaining and justifying property violations and specification-driven measurement of quantitative features of the signal. We demonstrate the tool functionality on several running examples and case studies, and evaluate its performance."}],"scopus_import":"1","date_created":"2022-03-18T10:10:53Z","publication":"International Journal on Software Tools for Technology Transfer","month":"08","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","date_published":"2020-08-03T00:00:00Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"299"}]},"publication_identifier":{"issn":["1433-2779"],"eissn":["1433-2787"]},"publication_status":"published","type":"journal_article","date_updated":"2024-10-09T20:58:18Z","issue":"6","article_processing_charge":"No","title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","department":[{"_id":"ToHe"}],"author":[{"last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","full_name":"Nickovic, Dejan"},{"last_name":"Lebeltel","first_name":"Olivier","full_name":"Lebeltel, Olivier"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ulus, Dogan","first_name":"Dogan","last_name":"Ulus"}],"quality_controlled":"1","publisher":"Springer Nature","external_id":{"isi":["000555398600001"]},"keyword":["Information Systems","Software"],"article_type":"original","day":"03","year":"2020","volume":22,"isi":1},{"oa_version":"Published Version","doi":"10.29007/zkf6","citation":{"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.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 49–75, doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>.","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.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:49-75. doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>","ieee":"L. Geretti <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 49–75.","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 <i>EPiC Series in Computing</i> (Vol. 74, pp. 49–75). EasyChair. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>","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 <i>EPiC Series in Computing</i>, 74:49–75. EasyChair, 2020. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>."},"_id":"8571","corr_author":"1","intvolume":"        74","language":[{"iso":"eng"}],"page":"49-75","abstract":[{"lang":"eng","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."}],"scopus_import":"1","ec_funded":1,"oa":1,"month":"09","date_created":"2020-09-26T14:41:29Z","publication":"EPiC Series in Computing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2020-09-25T00:00:00Z","publication_status":"published","type":"conference","date_updated":"2025-04-15T06:26:12Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","author":[{"first_name":"Luca","full_name":"Geretti, Luca","last_name":"Geretti"},{"first_name":"Julien","full_name":"Alexandre Dit Sandretto, Julien","last_name":"Alexandre Dit Sandretto"},{"last_name":"Althoff","full_name":"Althoff, Matthias","first_name":"Matthias"},{"last_name":"Benet","full_name":"Benet, Luis","first_name":"Luis"},{"last_name":"Chapoutot","full_name":"Chapoutot, Alexandre","first_name":"Alexandre"},{"full_name":"Chen, Xin","first_name":"Xin","last_name":"Chen"},{"last_name":"Collins","first_name":"Pieter","full_name":"Collins, Pieter"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"full_name":"Freire, Daniel","first_name":"Daniel","last_name":"Freire"},{"last_name":"Immler","full_name":"Immler, Fabian","first_name":"Fabian"},{"full_name":"Kochdumper, Niklas","first_name":"Niklas","last_name":"Kochdumper"},{"last_name":"Sanders","full_name":"Sanders, David","first_name":"David"},{"full_name":"Schilling, Christian","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","orcid":"0000-0003-3658-1065"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/nrdD"}],"publisher":"EasyChair","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"conference":{"start_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2020-07-12"},"day":"25","year":"2020","volume":74,"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."},{"author":[{"first_name":"Matthias","full_name":"Althoff, Matthias","last_name":"Althoff"},{"full_name":"Bak, Stanley","first_name":"Stanley","last_name":"Bak"},{"last_name":"Bao","first_name":"Zongnan","full_name":"Bao, Zongnan"},{"last_name":"Forets","full_name":"Forets, Marcelo","first_name":"Marcelo"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"first_name":"Yangge","full_name":"Li, Yangge","last_name":"Li"},{"last_name":"Mitra","full_name":"Mitra, Sayan","first_name":"Sayan"},{"full_name":"Ray, Rajarshi","first_name":"Rajarshi","last_name":"Ray"},{"first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schupp","full_name":"Schupp, Stefan","first_name":"Stefan"},{"last_name":"Wetzlinger","first_name":"Mark","full_name":"Wetzlinger, Mark"}],"main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"quality_controlled":"1","publisher":"EasyChair","publication_status":"published","type":"conference","article_processing_charge":"No","department":[{"_id":"ToHe"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","date_updated":"2025-04-15T08:29:04Z","year":"2020","volume":74,"day":"25","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.","conference":{"end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12"},"project":[{"name":"Synaptic communication in neuronal microcircuits","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"scopus_import":"1","ec_funded":1,"abstract":[{"lang":"eng","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."}],"publication":"EPiC Series in Computing","month":"09","date_created":"2020-09-26T14:49:43Z","oa":1,"_id":"8572","corr_author":"1","intvolume":"        74","doi":"10.29007/7dt2","oa_version":"Published Version","citation":{"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.","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.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 16–48, doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>.","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 <i>EPiC Series in Computing</i>, 74:16–48. EasyChair, 2020. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>.","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 <i>EPiC Series in Computing</i> (Vol. 74, pp. 16–48). EasyChair. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 16–48.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:16-48. doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>"},"page":"16-48","language":[{"iso":"eng"}],"date_published":"2020-09-25T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"},{"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.","alternative_title":["LIPIcs"],"year":"2020","volume":171,"day":"06","license":"https://creativecommons.org/licenses/by/3.0/","conference":{"location":"Virtual","end_date":"2020-09-04","start_date":"2020-09-01","name":"CONCUR: Conference on Concurrency Theory"},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"}],"file_date_updated":"2020-10-05T14:13:19Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"author":[{"full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"quality_controlled":"1","article_processing_charge":"No","title":"A survey of bidding games on graphs","department":[{"_id":"ToHe"}],"date_updated":"2025-07-10T11:57:09Z","has_accepted_license":"1","publication_status":"published","type":"conference","file":[{"success":1,"file_size":868510,"date_created":"2020-10-05T14:13:19Z","file_id":"8611","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_name":"2020_LIPIcsCONCUR_Avni.pdf","date_updated":"2020-10-05T14:13:19Z","access_level":"open_access","checksum":"8f33b098e73724e0ac817f764d8e1a2d"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771603"]},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"article_number":"2","date_published":"2020-08-06T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication":"31st International Conference on Concurrency Theory","month":"08","date_created":"2020-10-04T22:01:36Z","oa":1,"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."}],"scopus_import":"1","language":[{"iso":"eng"}],"_id":"8599","corr_author":"1","intvolume":"       171","doi":"10.4230/LIPIcs.CONCUR.2020.2","oa_version":"Published Version","citation":{"ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>","apa":"Avni, G., &#38; Henzinger, T. A. (2020). A survey of bidding games on graphs. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171.","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>.","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>.","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."}},{"language":[{"iso":"eng"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>.","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.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"doi":"10.4230/LIPIcs.CONCUR.2020.23","oa_version":"Published Version","intvolume":"       171","corr_author":"1","_id":"8600","oa":1,"publication":"31st International Conference on Concurrency Theory","month":"08","date_created":"2020-10-04T22:01:36Z","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."}],"scopus_import":"1","article_number":"23","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-08-06T00:00:00Z","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"arxiv":1,"publication_identifier":{"isbn":["9783959771603"],"issn":["1868-8969"]},"has_accepted_license":"1","date_updated":"2025-07-10T11:57:10Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Multi-dimensional long-run average problems for vector addition systems with states","article_processing_charge":"No","file":[{"checksum":"5039752f644c4b72b9361d21a5e31baf","access_level":"open_access","date_updated":"2020-10-05T14:04:25Z","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_id":"8610","date_created":"2020-10-05T14:04:25Z","success":1,"file_size":601231}],"type":"conference","publication_status":"published","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"external_id":{"arxiv":["2007.08917"]},"conference":{"location":"Virtual","start_date":"2020-09-01","name":"CONCUR: Conference on Concurrency Theory","end_date":"2020-09-04"},"file_date_updated":"2020-10-05T14:04:25Z","alternative_title":["LIPIcs"],"day":"06","volume":171,"year":"2020"}]