[{"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"file_date_updated":"2022-05-12T12:13:27Z","date_updated":"2023-08-10T14:11:19Z","ddc":["004"],"article_type":"original","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","_id":"9647","volume":893,"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","file":[{"file_size":2566504,"date_updated":"2022-05-12T12:13:27Z","creator":"dernst","file_name":"2021_TheoreticalComputerScience_Petrov.pdf","date_created":"2022-05-12T12:13:27Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"11364","checksum":"d3aef34cfb13e53bba4cf44d01680793"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"06","intvolume":" 893","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."}],"oa_version":"Published Version","author":[{"full_name":"Petrov, Tatjana","last_name":"Petrov","first_name":"Tatjana"},{"id":"46613666-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia","full_name":"Igler, Claudia","last_name":"Igler"},{"first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","full_name":"Sezgin, Ali"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"}],"article_processing_charge":"No","external_id":{"isi":["000710180500002"]},"title":"Long lived transients in gene regulation","citation":{"ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science. Elsevier, 2021. https://doi.org/10.1016/j.tcs.2021.05.023.","short":"T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.","ieee":"T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. Theoretical Computer Science. 2021;893:1-16. doi:10.1016/j.tcs.2021.05.023","apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., & Guet, C. C. (2021). Long lived transients in gene regulation. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2021.05.023","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"page":"1-16","date_published":"2021-06-04T00:00:00Z","doi":"10.1016/j.tcs.2021.05.023","date_created":"2021-07-11T22:01:18Z","isi":1,"has_accepted_license":"1","year":"2021","day":"04","publication":"Theoretical Computer Science","quality_controlled":"1","publisher":"Elsevier","oa":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)."},{"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:10.1007/978-3-030-88494-9_12.","ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:10.1007/978-3-030-88494-9_12","apa":"Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. In International Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_12","short":"F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243.","ieee":"F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In International Conference on Runtime Verification, 12974:231–43. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_12.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000719383800012"]},"article_processing_charge":"No","author":[{"full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"title":"Differential monitoring","acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Mae 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.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","year":"2021","isi":1,"has_accepted_license":"1","publication":"International Conference on Runtime Verification","day":"06","page":"231-243","date_created":"2021-10-07T23:30:10Z","doi":"10.1007/978-3-030-88494-9_12","date_published":"2021-10-06T00:00:00Z","_id":"10108","conference":{"start_date":"2021-10-11","end_date":"2021-10-14","location":"Virtual","name":"RV: Runtime Verification"},"type":"conference","keyword":["run-time verification","software engineering","implicit specification"],"status":"public","date_updated":"2023-08-14T07:20:30Z","ddc":["005"],"department":[{"_id":"ToHe"}],"file_date_updated":"2021-10-07T23:32:18Z","abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 12974","place":"Cham","month":"10","publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-030-88493-2"],"issn":["0302-9743"],"eisbn":["978-3-030-88494-9"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10109","checksum":"554c7fdb259eda703a8b6328a6dad55a","success":1,"date_updated":"2021-10-07T23:32:18Z","file_size":350632,"creator":"fmuehlbo","date_created":"2021-10-07T23:32:18Z","file_name":"differentialmonitoring-cameraready-openaccess.pdf"}],"related_material":{"record":[{"id":"9946","status":"public","relation":"extended_version"}]},"volume":12974},{"publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","file":[{"date_created":"2021-08-20T19:59:44Z","file_name":"differentialmonitoring-techreport.pdf","date_updated":"2021-09-03T12:34:28Z","file_size":"320453","creator":"fmuehlbo","checksum":"0f9aafd59444cb6bdca6925d163ab946","file_id":"9948","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"9281","status":"public","relation":"other"},{"id":"10108","status":"public","relation":"shorter_version"}]},"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_version":"Published Version","alternative_title":["IST Austria Technical Report"],"month":"09","date_updated":"2023-08-14T07:20:29Z","ddc":["005"],"department":[{"_id":"ToHe"}],"file_date_updated":"2021-09-03T12:34:28Z","_id":"9946","type":"technical_report","status":"public","keyword":["run-time verification","software engineering","implicit specification"],"has_accepted_license":"1","year":"2021","day":"01","page":"17","date_published":"2021-09-01T00:00:00Z","doi":"10.15479/AT:ISTA:9946","date_created":"2021-08-20T20:00:37Z","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.","publisher":"IST Austria","oa":1,"citation":{"ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring, IST Austria, 17p.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. Differential Monitoring. IST Austria, 2021. https://doi.org/10.15479/AT:ISTA:9946.","short":"F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021.","ieee":"F. Mühlböck and T. A. Henzinger, Differential monitoring. IST Austria, 2021.","apa":"Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. IST Austria. https://doi.org/10.15479/AT:ISTA:9946","ama":"Mühlböck F, Henzinger TA. Differential Monitoring. IST Austria; 2021. doi:10.15479/AT:ISTA:9946","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. Differential Monitoring. IST Austria, 2021, doi:10.15479/AT:ISTA:9946."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Differential monitoring","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"_id":"10404","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-08-14T13:11:42Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","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."}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2110.07667","open_access":"1"}],"scopus_import":"1","intvolume":" 40","month":"11","publication_status":"published","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"language":[{"iso":"eng"}],"issue":"7","volume":40,"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"citation":{"chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” Computer Graphics Forum. Wiley, 2021. https://doi.org/10.1111/cgf.14418.","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.” Computer Graphics Forum, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:10.1111/cgf.14418.","ieee":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive analysis of CNN robustness,” Computer Graphics Forum, vol. 40, no. 7. Wiley, pp. 253–264, 2021.","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264.","ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. Computer Graphics Forum. 2021;40(7):253-264. doi:10.1111/cgf.14418","apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., & Waldner, M. (2021). Interactive analysis of CNN robustness. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.14418"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","external_id":{"arxiv":["2110.07667"],"isi":["000722952000024"]},"author":[{"first_name":"Stefan","last_name":"Sietzen","full_name":"Sietzen, Stefan"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"full_name":"Borowski, Judy","last_name":"Borowski","first_name":"Judy"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Waldner","full_name":"Waldner, Manuela","first_name":"Manuela"}],"title":"Interactive analysis of CNN robustness","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","oa":1,"publisher":"Wiley","quality_controlled":"1","year":"2021","isi":1,"publication":"Computer Graphics Forum","day":"27","page":"253-264","date_created":"2021-12-05T23:01:40Z","date_published":"2021-11-27T00:00:00Z","doi":"10.1111/cgf.14418"},{"file":[{"checksum":"b35586a50ed1ca8f44767de116d18d81","file_id":"10690","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-01-26T08:04:50Z","file_name":"2021_LMCS_AGHAJOHAR.pdf","creator":"alisjak","date_updated":"2022-01-26T08:04:50Z","file_size":819878}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1860-5974"]},"publication_status":"published","volume":17,"issue":"1","oa_version":"Published Version","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.","lang":"eng"}],"month":"02","intvolume":" 17","scopus_import":"1","ddc":["510"],"date_updated":"2023-08-17T06:56:42Z","file_date_updated":"2022-01-26T08:04:50Z","department":[{"_id":"ToHe"}],"_id":"10674","status":"public","keyword":["computer science","computer science and game theory","logic in computer science"],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"03","publication":"Logical Methods in Computer Science","has_accepted_license":"1","isi":1,"year":"2021","date_published":"2021-02-03T00:00:00Z","doi":"10.23638/LMCS-17(1:10)2021","date_created":"2022-01-25T16:32:13Z","page":"10:1-10:23","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","quality_controlled":"1","publisher":"International Federation for Computational Logic","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” Logical Methods in Computer Science, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” Logical Methods in Computer Science, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” Logical Methods in Computer Science. International Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021."},"title":"Determinacy in discrete-bidding infinite-duration games","author":[{"full_name":"Aghajohari, Milad","last_name":"Aghajohari","first_name":"Milad"},{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"external_id":{"arxiv":["1905.03588"],"isi":["000658724600010"]},"article_processing_charge":"No","project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}]},{"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2023-08-17T06:58:38Z","ddc":["000"],"type":"conference","conference":{"location":"Xi'an, China","end_date":"2021-06-05","start_date":"2021-05-30","name":"ICRA: International Conference on Robotics and Automation"},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"status":"public","series_title":"ICRA","_id":"10666","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","publication_identifier":{"eisbn":["978-1-7281-9077-8"],"eissn":["2577-087X"],"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"abstract":[{"lang":"eng","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."}],"oa_version":"None","author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"external_id":{"arxiv":["2103.08187"],"isi":["000765738803040"]},"article_processing_charge":"No","title":"Adversarial training is not ready for robot learning","citation":{"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.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In 2021 IEEE International Conference on Robotics and Automation, 4140–47. ICRA, 2021. https://doi.org/10.1109/ICRA48506.2021.9561036.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., & Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In 2021 IEEE International Conference on Robotics and Automation (pp. 4140–4147). Xi’an, China. https://doi.org/10.1109/ICRA48506.2021.9561036","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: 2021 IEEE International Conference on Robotics and Automation. ICRA. ; 2021:4140-4147. doi:10.1109/ICRA48506.2021.9561036","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.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in 2021 IEEE International Conference on Robotics and Automation, Xi’an, China, 2021, pp. 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–47, doi:10.1109/ICRA48506.2021.9561036."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"page":"4140-4147","doi":"10.1109/ICRA48506.2021.9561036","date_published":"2021-01-01T00:00:00Z","date_created":"2022-01-25T15:44:54Z","isi":1,"has_accepted_license":"1","year":"2021","publication":"2021 IEEE International Conference on Robotics and Automation","quality_controlled":"1","oa":1,"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)."},{"ec_funded":1,"volume":"12974 ","related_material":{"record":[{"relation":"extended_version","id":"13234","status":"public"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"isbn":["9-783-0308-8493-2"],"issn":["0302-9743"]},"month":"10","place":"Cham","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"department":[{"_id":"ToHe"}],"date_updated":"2024-01-30T12:06:56Z","keyword":["monitoring","neural networks","novelty detection"],"status":"public","conference":{"end_date":"2021-10-14","location":"Virtual","start_date":"2021-10-11","name":"RV: Runtime Verification"},"type":"conference","_id":"10206","date_created":"2021-10-31T23:01:31Z","date_published":"2021-10-06T00:00:00Z","doi":"10.1007/978-3-030-88494-9_3","page":"42-61","publication":"21st International Conference on Runtime Verification","day":"06","year":"2021","isi":1,"oa":1,"publisher":"Springer Nature","quality_controlled":"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.","title":"Into the unknown: active monitoring of neural networks","article_processing_charge":"No","external_id":{"isi":["000719383800003"],"arxiv":["2009.06429"]},"author":[{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","full_name":"Lukina, Anna","last_name":"Lukina"},{"last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” 21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: 21st International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:10.1007/978-3-030-88494-9_3","apa":"Lukina, A., Schilling, C., & Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_3","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in 21st International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 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 21st International Conference on Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_3.","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."},"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Alexander","full_name":"Amini, Alexander","last_name":"Amini"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","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 Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.","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.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (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: Proceedings of the 37th International Conference on Machine Learning. 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.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"quality_controlled":"1","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","page":"4082-4093","date_created":"2022-01-25T15:50:34Z","date_published":"2020-01-01T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"Proceedings of the 37th International Conference on Machine Learning","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"end_date":"2020-07-18","location":"Virtual","start_date":"2020-07-12","name":"ML: Machine Learning"},"type":"conference","status":"public","series_title":"PMLR","_id":"10673","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T11:08:51Z","date_updated":"2022-01-26T11:14:27Z","ddc":["000"],"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"alternative_title":["PMLR"],"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."}],"oa_version":"Published Version","publication_status":"published","publication_identifier":{"issn":["2640-3498"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_PMLR_Hasani.pdf","date_created":"2022-01-26T11:08:51Z","file_size":2329798,"date_updated":"2022-01-26T11:08:51Z","creator":"cchlebak","success":1,"file_id":"10691","checksum":"c9a4a29161777fc1a89ef451c040e3b1","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}]},{"article_number":"20","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20.","ista":"Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.","ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","short":"T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152."},"title":"Monitoring event frequencies","author":[{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl"}],"external_id":{"arxiv":["1910.06097"]},"article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"15","publication":"28th EACSL Annual Conference on Computer Science Logic","has_accepted_license":"1","year":"2020","date_published":"2020-01-15T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2020.20","date_created":"2020-01-21T11:22:21Z","_id":"7348","status":"public","type":"conference","conference":{"name":"CSL: Computer Science Logic","start_date":"2020-01-13","end_date":"2020-01-16","location":"Barcelona, Spain"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2021-01-12T08:13:12Z","file_date_updated":"2020-07-14T12:47:56Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"text":"The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. ","lang":"eng"}],"month":"01","intvolume":" 152","scopus_import":1,"alternative_title":["LIPIcs"],"file":[{"date_updated":"2020-07-14T12:47:56Z","file_size":617206,"creator":"bkragl","date_created":"2020-01-21T11:21:04Z","file_name":"main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b9a691d658d075c6369d3304d17fb818","file_id":"7349"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771320"]},"publication_status":"published","volume":152},{"project":[{"grant_number":"Z00312","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"author":[{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bao, Zongnan","last_name":"Bao","first_name":"Zongnan"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"last_name":"Freire","full_name":"Freire, Daniel","first_name":"Daniel"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"full_name":"Li, Yangge","last_name":"Li","first_name":"Yangge"},{"first_name":"Sayan","full_name":"Mitra, Sayan","last_name":"Mitra"},{"first_name":"Rajarshi","full_name":"Ray, Rajarshi","last_name":"Ray"},{"orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schupp, Stefan","last_name":"Schupp","first_name":"Stefan"},{"first_name":"Mark","full_name":"Wetzlinger, Mark","last_name":"Wetzlinger"}],"article_processing_charge":"No","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","citation":{"mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2","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.","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"EasyChair","oa":1,"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.","page":"16-48","date_published":"2020-09-25T00:00:00Z","doi":"10.29007/7dt2","date_created":"2020-09-26T14:49:43Z","year":"2020","day":"25","publication":"EPiC Series in Computing","type":"conference","conference":{"end_date":"2020-07-12","start_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"status":"public","_id":"8572","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:20:06Z","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"month":"09","intvolume":" 74","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"oa_version":"Published Version","volume":74,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}]}]