[{"type":"journal_article","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Association for the Advancement of Artificial Intelligence","doi":"10.1609/aaai.v34i02.5546","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"first_name":"Josef","full_name":"Tkadlec, Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"}],"issue":"02","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_published":"2020-04-03T00:00:00Z","external_id":{"arxiv":["1911.08360"]},"conference":{"start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2020-02-12","location":"New York, NY, United States"},"oa_version":"Preprint","volume":34,"project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-09-05T12:40:00Z","date_created":"2021-02-25T09:05:18Z","year":"2020","page":"1798-1805","quality_controlled":"1","scopus_import":"1","publication_identifier":{"isbn":["9781577358350"],"issn":["2159-5399"],"eissn":["2374-3468"]},"article_processing_charge":"No","article_type":"original","publication_status":"published","title":"All-pay bidding games on graphs","_id":"9197","month":"04","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve."}],"status":"public","citation":{"ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2020;34(02):1798-1805. doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","apa":"Avni, G., Ibsen-Jensen, R., &#38; Tkadlec, J. (2020). All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>"},"intvolume":"        34","day":"03"},{"department":[{"_id":"ToHe"}],"acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","oa":1,"title":"Hybridization for stability verification of nonlinear switched systems","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"9202","month":"12","citation":{"ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: <i>2020 IEEE Real-Time Systems Symposium</i>. IEEE; 2020:244-256. doi:<a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">10.1109/RTSS49844.2020.00031</a>","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” <i>2020 IEEE Real-Time Systems Symposium</i>, IEEE, 2020, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">10.1109/RTSS49844.2020.00031</a>.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in <i>2020 IEEE Real-Time Systems Symposium</i>, Houston, TX, USA , 2020, pp. 244–256.","apa":"Garcia Soto, M., &#38; Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In <i>2020 IEEE Real-Time Systems Symposium</i> (pp. 244–256). Houston, TX, USA : IEEE. <a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">https://doi.org/10.1109/RTSS49844.2020.00031</a>","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In <i>2020 IEEE Real-Time Systems Symposium</i>, 244–56. IEEE, 2020. <a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">https://doi.org/10.1109/RTSS49844.2020.00031</a>."},"has_accepted_license":"1","day":"01","abstract":[{"lang":"eng","text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function."}],"status":"public","ddc":["000"],"author":[{"last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam","first_name":"Miriam","orcid":"0000-0003-2936-5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Prabhakar","first_name":"Pavithra","full_name":"Prabhakar, Pavithra"}],"publication":"2020 IEEE Real-Time Systems Symposium","date_published":"2020-12-01T00:00:00Z","oa_version":"Submitted Version","conference":{"location":"Houston, TX, USA ","end_date":"2020-12-04","name":"RTTS: Real-Time Systems Symposium","start_date":"2020-12-01"},"external_id":{"isi":["000680435100021"]},"file_date_updated":"2021-02-26T16:38:14Z","type":"conference","language":[{"iso":"eng"}],"publisher":"IEEE","doi":"10.1109/RTSS49844.2020.00031","publication_identifier":{"eisbn":["9781728183244"],"eissn":["2576-3172"]},"article_processing_charge":"No","isi":1,"file":[{"date_updated":"2021-02-26T16:38:14Z","access_level":"open_access","date_created":"2021-02-26T16:38:14Z","content_type":"application/pdf","file_id":"9203","file_name":"main.pdf","creator":"mgarcias","file_size":1125794,"checksum":"8f97f229316c3b3a6f0cf99297aa0941","relation":"main_file"}],"date_updated":"2024-02-22T13:25:19Z","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"quality_controlled":"1","page":"244-256","date_created":"2021-02-26T16:38:24Z","year":"2020"},{"quality_controlled":"1","year":"2020","date_created":"2020-01-21T11:22:21Z","date_updated":"2021-01-12T08:13:12Z","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"volume":152,"file":[{"file_name":"main.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:56Z","date_created":"2020-01-21T11:21:04Z","file_id":"7349","content_type":"application/pdf","checksum":"b9a691d658d075c6369d3304d17fb818","relation":"main_file","creator":"bkragl","file_size":617206}],"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771320"]},"scopus_import":1,"doi":"10.4230/LIPIcs.CSL.2020.20","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:56Z","type":"conference","conference":{"end_date":"2020-01-16","location":"Barcelona, Spain","start_date":"2020-01-13","name":"CSL: Computer Science Logic"},"external_id":{"arxiv":["1910.06097"]},"oa_version":"Published Version","date_published":"2020-01-15T00:00:00Z","publication":"28th EACSL Annual Conference on Computer Science Logic","ddc":["000"],"author":[{"first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117"}],"article_number":"20","status":"public","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"}],"day":"15","has_accepted_license":"1","citation":{"ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: <i>28th EACSL Annual Conference on Computer Science Logic</i>. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2020.20\">10.4230/LIPIcs.CSL.2020.20</a>","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 <i>28th EACSL Annual Conference on Computer Science Logic</i>, Barcelona, Spain, 2020, vol. 152.","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” <i>28th EACSL Annual Conference on Computer Science Logic</i>, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2020.20\">10.4230/LIPIcs.CSL.2020.20</a>.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In <i>28th EACSL Annual Conference on Computer Science Logic</i>, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2020.20\">https://doi.org/10.4230/LIPIcs.CSL.2020.20</a>.","apa":"Ferrere, T., Henzinger, T. A., &#38; Kragl, B. (2020). Monitoring event frequencies. In <i>28th EACSL Annual Conference on Computer Science Logic</i> (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2020.20\">https://doi.org/10.4230/LIPIcs.CSL.2020.20</a>","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."},"intvolume":"       152","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7348","month":"01","oa":1,"title":"Monitoring event frequencies","publication_status":"published","department":[{"_id":"ToHe"}],"alternative_title":["LIPIcs"]},{"department":[{"_id":"ToHe"}],"article_type":"original","title":"Abstraction based verification of stability of polyhedral switched systems","oa":1,"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7426","month":"05","citation":{"apa":"Garcia Soto, M., &#38; Prabhakar, P. (2020). Abstraction based verification of stability of polyhedral switched systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2020.100856\">https://doi.org/10.1016/j.nahs.2020.100856</a>","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.nahs.2020.100856\">https://doi.org/10.1016/j.nahs.2020.100856</a>.","ista":"Garcia Soto M, Prabhakar P. 2020. Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 36(5), 100856.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 36, no. 5, 100856, Elsevier, 2020, doi:<a href=\"https://doi.org/10.1016/j.nahs.2020.100856\">10.1016/j.nahs.2020.100856</a>.","ieee":"M. Garcia Soto and P. Prabhakar, “Abstraction based verification of stability of polyhedral switched systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 36, no. 5. Elsevier, 2020.","short":"M. Garcia Soto, P. Prabhakar, Nonlinear Analysis: Hybrid Systems 36 (2020).","ama":"Garcia Soto M, Prabhakar P. Abstraction based verification of stability of polyhedral switched systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2020;36(5). doi:<a href=\"https://doi.org/10.1016/j.nahs.2020.100856\">10.1016/j.nahs.2020.100856</a>"},"intvolume":"        36","has_accepted_license":"1","day":"01","abstract":[{"text":"This paper presents a novel abstraction technique for analyzing Lyapunov and asymptotic stability of polyhedral switched systems. A polyhedral switched system is a hybrid system in which the continuous dynamics is specified by polyhedral differential inclusions, the invariants and guards are specified by polyhedral sets and the switching between the modes do not involve reset of variables. A finite state weighted graph abstracting the polyhedral switched system is constructed from a finite partition of the state–space, such that the satisfaction of certain graph conditions, such as the absence of cycles with product of weights on the edges greater than (or equal) to 1, implies the stability of the system. However, the graph is in general conservative and hence, the violation of the graph conditions does not imply instability. If the analysis fails to establish stability due to the conservativeness in the approximation, a counterexample (cycle with product of edge weights greater than or equal to 1) indicating a potential reason for the failure is returned. Further, a more precise approximation of the switched system can be constructed by considering a finer partition of the state–space in the construction of the finite weighted graph. We present experimental results on analyzing stability of switched systems using the above method.","lang":"eng"}],"article_number":"100856","status":"public","ddc":["000"],"author":[{"last_name":"Garcia Soto","first_name":"Miriam","full_name":"Garcia Soto, Miriam","orcid":"0000−0003−2936−5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Prabhakar, Pavithra","first_name":"Pavithra","last_name":"Prabhakar"}],"publication":"Nonlinear Analysis: Hybrid Systems","issue":"5","date_published":"2020-05-01T00:00:00Z","oa_version":"Submitted Version","external_id":{"isi":["000528828600003"]},"file_date_updated":"2022-05-16T22:30:04Z","type":"journal_article","language":[{"iso":"eng"}],"publisher":"Elsevier","doi":"10.1016/j.nahs.2020.100856","scopus_import":"1","publication_identifier":{"issn":["1751-570X"]},"article_processing_charge":"No","tmp":{"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","short":"CC BY-NC-ND (4.0)"},"volume":36,"file":[{"checksum":"560abfddb53f9fe921b6744f59f2cfaa","relation":"main_file","creator":"dernst","file_size":818774,"embargo":"2022-05-15","file_name":"2020_NAHS_GarciaSoto.pdf","date_updated":"2022-05-16T22:30:04Z","access_level":"open_access","date_created":"2020-10-21T13:16:45Z","content_type":"application/pdf","file_id":"8688"}],"isi":1,"date_updated":"2023-08-17T14:32:54Z","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"quality_controlled":"1","year":"2020","date_created":"2020-02-02T23:00:59Z"},{"volume":325,"isi":1,"file":[{"checksum":"80642fa0b6cd7da95dcd87d63789ad5e","relation":"main_file","creator":"dernst","file_size":1692214,"file_name":"2020_ECAI_Henzinger.pdf","access_level":"open_access","date_updated":"2020-09-21T07:12:32Z","success":1,"content_type":"application/pdf","date_created":"2020-09-21T07:12:32Z","file_id":"8540"}],"date_updated":"2023-08-18T06:38:16Z","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"quality_controlled":"1","page":"2433-2440","year":"2020","date_created":"2020-02-21T16:44:03Z","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"article_processing_charge":"No","file_date_updated":"2020-09-21T07:12:32Z","type":"conference","arxiv":1,"language":[{"iso":"eng"}],"publisher":"IOS Press","doi":"10.3233/FAIA200375","ddc":["000"],"author":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Anna","full_name":"Lukina, Anna","last_name":"Lukina","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"},{"orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Schilling, Christian","last_name":"Schilling"}],"publication":"24th European Conference on Artificial Intelligence","date_published":"2020-02-24T00:00:00Z","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc/4.0/","conference":{"start_date":"2020-08-29","name":"ECAI: European Conference on Artificial Intelligence","end_date":"2020-09-08","location":"Santiago de Compostela, Spain"},"external_id":{"isi":["000650971303002"],"arxiv":["1911.09032"]},"abstract":[{"text":"Neural networks have demonstrated unmatched performance in a range of classification tasks. Despite numerous efforts of the research community, novelty detection remains one of the significant limitations of neural networks. The ability to identify previously unseen inputs as novel is crucial for our understanding of the decisions made by neural networks. At runtime, inputs not falling into any of the categories learned during training cannot be classified correctly by the neural network. Existing approaches treat the neural network as a black box and try to detect novel inputs based on the confidence of the output predictions. However, neural networks are not trained to reduce their confidence for novel inputs, which limits the effectiveness of these approaches. We propose a framework to monitor a neural network by observing the hidden layers. We employ a common abstraction from program analysis - boxes - to identify novel behaviors in the monitored layers, i.e., inputs that cause behaviors outside the box. For each neuron, the boxes range over the values seen in training. The framework is efficient and flexible to achieve a desired trade-off between raising false warnings and detecting novel inputs. We illustrate the performance and the robustness to variability in the unknown classes on popular image-classification benchmarks.","lang":"eng"}],"status":"public","ec_funded":1,"citation":{"ama":"Henzinger TA, Lukina A, Schilling C. Outside the box: Abstraction-based monitoring of neural networks. In: <i>24th European Conference on Artificial Intelligence</i>. Vol 325. IOS Press; 2020:2433-2440. doi:<a href=\"https://doi.org/10.3233/FAIA200375\">10.3233/FAIA200375</a>","short":"T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.","mla":"Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” <i>24th European Conference on Artificial Intelligence</i>, vol. 325, IOS Press, 2020, pp. 2433–40, doi:<a href=\"https://doi.org/10.3233/FAIA200375\">10.3233/FAIA200375</a>.","ieee":"T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based monitoring of neural networks,” in <i>24th European Conference on Artificial Intelligence</i>, Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.","chicago":"Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” In <i>24th European Conference on Artificial Intelligence</i>, 325:2433–40. IOS Press, 2020. <a href=\"https://doi.org/10.3233/FAIA200375\">https://doi.org/10.3233/FAIA200375</a>.","ista":"Henzinger TA, Lukina A, Schilling C. 2020. Outside the box: Abstraction-based monitoring of neural networks. 24th European Conference on Artificial Intelligence. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 325, 2433–2440.","apa":"Henzinger, T. A., Lukina, A., &#38; Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In <i>24th European Conference on Artificial Intelligence</i> (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press. <a href=\"https://doi.org/10.3233/FAIA200375\">https://doi.org/10.3233/FAIA200375</a>"},"intvolume":"       325","has_accepted_license":"1","day":"24","oa":1,"title":"Outside the box: Abstraction-based monitoring of neural networks","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7505","month":"02","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"department":[{"_id":"ToHe"}],"acknowledgement":"We thank Christoph Lampert and Nikolaus Mayer for fruitful discussions. This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie grant agreement No. 754411."},{"has_accepted_license":"1","day":"17","intvolume":"     12079","citation":{"short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 12079. Springer Nature; 2020:79-97. doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>","ista":"Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 12079:79–97. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>.","apa":"Giacobbe, M., Henzinger, T. A., &#38; Lechner, M. (2020). How many bits does it take to quantize your neural network? In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>.","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Dublin, Ireland, 2020, vol. 12079, pp. 79–97."},"abstract":[{"lang":"eng","text":"Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades."}],"status":"public","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"month":"04","_id":"7808","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"How many bits does it take to quantize your neural network?","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","scopus_import":1,"publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030452360"]},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"date_updated":"2023-06-23T07:01:11Z","date_created":"2020-05-10T22:00:49Z","year":"2020","page":"79-97","quality_controlled":"1","file":[{"file_name":"2020_TACAS_Giacobbe.pdf","file_id":"7893","date_created":"2020-05-26T12:48:15Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:03Z","relation":"main_file","checksum":"f19905a42891fe5ce93d69143fa3f6fb","file_size":2744030,"creator":"dernst"}],"volume":12079,"date_published":"2020-04-17T00:00:00Z","oa_version":"Published Version","conference":{"end_date":"2020-04-30","location":"Dublin, Ireland","start_date":"2020-04-25","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"author":[{"full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"}],"ddc":["000"],"publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer Nature","doi":"10.1007/978-3-030-45237-7_5","type":"conference","file_date_updated":"2020-07-14T12:48:03Z","language":[{"iso":"eng"}]},{"author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Mutluergil","first_name":"Suha Orhun","full_name":"Mutluergil, Suha Orhun"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","date_published":"2020-06-01T00:00:00Z","external_id":{"isi":["000614622300016"]},"conference":{"name":"PLDI: Programming Language Design and Implementation","start_date":"2020-06-15","location":"London, United Kingdom","end_date":"2020-06-20"},"oa_version":"Published Version","type":"conference","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","doi":"10.1145/3385412.3385980","main_file_link":[{"url":"https://doi.org/10.1145/3385412.3385980","open_access":"1"}],"scopus_import":"1","publication_identifier":{"isbn":["9781450376136"]},"article_processing_charge":"No","isi":1,"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-09-07T13:18:00Z","date_created":"2020-06-25T11:40:16Z","year":"2020","page":"227-242","quality_controlled":"1","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8332"}]},"oa":1,"title":"Inductive sequentialization of asynchronous programs","_id":"8012","month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2020:227-242. doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>","short":"B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, London, United Kingdom, 2020, pp. 227–242.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2020, pp. 227–42, doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>.","ista":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 227–242.","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 227–42. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>.","apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., &#38; Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 227–242). London, United Kingdom: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>"},"day":"01","abstract":[{"lang":"eng","text":"Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos."}],"status":"public"},{"date_created":"2020-08-02T22:00:59Z","year":"2020","page":"13-31","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-08-22T08:27:25Z","isi":1,"volume":12166,"article_processing_charge":"No","publication_identifier":{"isbn":["9783030510732"],"issn":["03029743"],"eissn":["16113349"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-51074-9_2"}],"scopus_import":"1","doi":"10.1007/978-3-030-51074-9_2","publisher":"Springer Nature","language":[{"iso":"eng"}],"type":"conference","oa_version":"Published Version","conference":{"name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2020-07-01","location":"Paris, France","end_date":"2020-07-04"},"external_id":{"isi":["000884318000002"]},"date_published":"2020-06-24T00:00:00Z","publication":"Automated Reasoning","author":[{"first_name":"Marek","full_name":"Baranowski, Marek","last_name":"Baranowski"},{"last_name":"He","full_name":"He, Shaobo","first_name":"Shaobo"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nguyen","full_name":"Nguyen, Thanh Son","first_name":"Thanh Son"},{"first_name":"Zvonimir","full_name":"Rakamarić, Zvonimir","last_name":"Rakamarić"}],"status":"public","abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"day":"24","intvolume":"     12166","citation":{"ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31."},"month":"06","_id":"8194","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","title":"An SMT theory of fixed-point arithmetic","oa":1,"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"]},{"publication":"Computer Aided Verification","ddc":["000"],"author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"external_id":{"isi":["000695276000014"]},"oa_version":"Published Version","date_published":"2020-07-14T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2020-08-06T08:14:54Z","type":"conference","doi":"10.1007/978-3-030-53288-8_14","publisher":"Springer Nature","publication_identifier":{"isbn":["9783030532871"],"eisbn":["9783030532888"],"issn":["0302-9743"],"eissn":["1611-3349"]},"scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","volume":12224,"isi":1,"file":[{"access_level":"open_access","date_updated":"2020-08-06T08:14:54Z","success":1,"date_created":"2020-08-06T08:14:54Z","file_id":"8201","content_type":"application/pdf","file_name":"2020_LNCS_Kragl.pdf","creator":"dernst","file_size":804237,"relation":"main_file"}],"page":"275-298","quality_controlled":"1","year":"2020","date_created":"2020-08-03T11:45:35Z","date_updated":"2023-09-07T13:18:00Z","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","department":[{"_id":"ToHe"}],"related_material":{"record":[{"id":"8332","relation":"dissertation_contains","status":"public"}]},"title":"Refinement for structured concurrent programs","oa":1,"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"07","_id":"8195","citation":{"mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298."},"intvolume":"     12224","day":"14","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}]},{"article_processing_charge":"No","scopus_import":"1","publication_identifier":{"issn":["03043975"]},"project":[{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_updated":"2023-08-17T13:52:49Z","date_created":"2019-08-04T21:59:20Z","year":"2020","page":"42-55","quality_controlled":"1","isi":1,"file":[{"success":1,"date_updated":"2020-10-09T06:31:22Z","access_level":"open_access","file_id":"8639","date_created":"2020-10-09T06:31:22Z","content_type":"application/pdf","file_name":"2020_TheoreticalCS_Avni.pdf","creator":"dernst","file_size":1413001,"checksum":"e86635417f45eb2cd75778f91382f737","relation":"main_file"}],"volume":807,"date_published":"2020-02-06T00:00:00Z","external_id":{"isi":["000512219400004"]},"oa_version":"Submitted Version","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"ddc":["000"],"publication":"Theoretical Computer Science","publisher":"Elsevier","doi":"10.1016/j.tcs.2019.06.031","type":"journal_article","file_date_updated":"2020-10-09T06:31:22Z","language":[{"iso":"eng"}],"has_accepted_license":"1","day":"06","citation":{"short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. <i>Theoretical Computer Science</i>. 2020;807:42-55. doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.06.031\">10.1016/j.tcs.2019.06.031</a>","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” <i>Theoretical Computer Science</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.tcs.2019.06.031\">https://doi.org/10.1016/j.tcs.2019.06.031</a>.","apa":"Avni, G., Henzinger, T. A., &#38; Kupferman, O. (2020). Dynamic resource allocation games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2019.06.031\">https://doi.org/10.1016/j.tcs.2019.06.031</a>","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” <i>Theoretical Computer Science</i>, vol. 807, Elsevier, 2020, pp. 42–55, doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.06.031\">10.1016/j.tcs.2019.06.031</a>.","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” <i>Theoretical Computer Science</i>, vol. 807. Elsevier, pp. 42–55, 2020."},"intvolume":"       807","abstract":[{"text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.","lang":"eng"}],"status":"public","department":[{"_id":"ToHe"}],"_id":"6761","month":"02","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","publication_status":"published","oa":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1341"}]},"title":"Dynamic resource allocation games"},{"publication_status":"published","oa":1,"title":"Learning representations for binary-classification without backpropagation","month":"03","_id":"10672","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","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."}],"status":"public","citation":{"short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: <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.","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.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In <i>8th International Conference on Learning Representations</i>. ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in <i>8th International Conference on Learning Representations</i>, Virtual ; Addis Ababa, Ethiopia, 2020.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” <i>8th International Conference on Learning Representations</i>, ICLR, 2020."},"has_accepted_license":"1","day":"11","type":"conference","file_date_updated":"2022-01-26T07:35:17Z","language":[{"iso":"eng"}],"publisher":"ICLR","author":[{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"publication":"8th International Conference on Learning Representations","date_published":"2020-03-11T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","oa_version":"Published Version","conference":{"start_date":"2020-04-26","name":"ICLR: International Conference on Learning Representations","end_date":"2020-05-01","location":"Virtual ; Addis Ababa, Ethiopia"},"file":[{"date_created":"2022-01-26T07:35:17Z","content_type":"application/pdf","file_id":"10677","success":1,"access_level":"open_access","date_updated":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf","file_size":249431,"creator":"mlechner","relation":"main_file","checksum":"ea13d42dd4541ddb239b6a75821fd6c9"}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"date_updated":"2023-04-03T07:33:40Z","date_created":"2022-01-25T15:50:00Z","year":"2020","quality_controlled":"1","main_file_link":[{"url":"https://openreview.net/forum?id=Bke61krFvS","open_access":"1"}],"scopus_import":"1","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)"}},{"citation":{"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.","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.","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.","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.","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.","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.","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."},"has_accepted_license":"1","abstract":[{"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.","lang":"eng"}],"status":"public","alternative_title":["PMLR"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"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","publication_status":"published","oa":1,"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","_id":"10673","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"scopus_import":"1","publication_identifier":{"issn":["2640-3498"]},"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)"},"file":[{"file_name":"2020_PMLR_Hasani.pdf","success":1,"access_level":"open_access","date_updated":"2022-01-26T11:08:51Z","content_type":"application/pdf","file_id":"10691","date_created":"2022-01-26T11:08:51Z","checksum":"c9a4a29161777fc1a89ef451c040e3b1","relation":"main_file","creator":"cchlebak","file_size":2329798}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"date_updated":"2022-01-26T11:14:27Z","date_created":"2022-01-25T15:50:34Z","year":"2020","series_title":"PMLR","page":"4082-4093","quality_controlled":"1","author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"ddc":["000"],"publication":"Proceedings of the 37th International Conference on Machine Learning","date_published":"2020-01-01T00:00:00Z","oa_version":"Published Version","conference":{"location":"Virtual","end_date":"2020-07-18","name":"ML: Machine Learning","start_date":"2020-07-12"},"type":"conference","file_date_updated":"2022-01-26T11:08:51Z","language":[{"iso":"eng"}]},{"ec_funded":1,"status":"public","abstract":[{"lang":"eng","text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."}],"day":"06","intvolume":"        33","citation":{"ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.","chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In <i>Advances in Neural Information Processing Systems</i>, 33:18098–109. Curran Associates, 2020.","apa":"Singh, S. P., &#38; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In <i>Advances in Neural Information Processing Systems</i> (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” <i>Advances in Neural Information Processing Systems</i>, vol. 33, Curran Associates, 2020, pp. 18098–109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in <i>Advances in Neural Information Processing Systems</i>, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: <i>Advances in Neural Information Processing Systems</i>. Vol 33. Curran Associates; 2020:18098-18109."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9632","month":"12","oa":1,"title":"WoodFisher: Efficient second-order approximation for neural network compression","publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"quality_controlled":"1","page":"18098-18109","year":"2020","date_created":"2021-07-04T22:01:26Z","date_updated":"2023-02-23T14:03:06Z","project":[{"call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"volume":33,"article_processing_charge":"No","publication_identifier":{"isbn":["9781713829546"],"issn":["10495258"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html"}],"publisher":"Curran Associates","arxiv":1,"language":[{"iso":"eng"}],"type":"conference","external_id":{"arxiv":["2004.14340"]},"oa_version":"Published Version","conference":{"location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Conference on Neural Information Processing Systems","start_date":"2020-12-06"},"date_published":"2020-12-06T00:00:00Z","publication":"Advances in Neural Information Processing Systems","author":[{"id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","full_name":"Singh, Sidak Pal","first_name":"Sidak Pal","last_name":"Singh"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}]},{"publisher":"Springer Nature","doi":"10.1007/s10009-020-00582-z","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2020-08-03T00:00:00Z","external_id":{"isi":["000555398600001"]},"oa_version":"None","author":[{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lebeltel","first_name":"Olivier","full_name":"Lebeltel, Olivier"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ulus","full_name":"Ulus, Dogan","first_name":"Dogan"}],"issue":"6","publication":"International Journal on Software Tools for Technology Transfer","date_updated":"2023-09-08T11:52:02Z","page":"741-758","quality_controlled":"1","date_created":"2022-03-18T10:10:53Z","year":"2020","volume":22,"isi":1,"article_processing_charge":"No","scopus_import":"1","publication_identifier":{"eissn":["1433-2787"],"issn":["1433-2779"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10861","month":"08","article_type":"original","related_material":{"record":[{"id":"299","relation":"earlier_version","status":"public"}]},"title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","publication_status":"published","department":[{"_id":"ToHe"}],"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."}],"status":"public","day":"03","citation":{"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.","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>.","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>","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>.","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.","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>"},"intvolume":"        22","keyword":["Information Systems","Software"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8570","doi":"10.29007/bj1w","month":"05","publisher":"EasyChair","oa":1,"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","location":"Montreal, Canada"},"oa_version":"Published Version","date_published":"2019-05-25T00:00:00Z","department":[{"_id":"ToHe"}],"publication":"EPiC Series in Computing","author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"last_name":"Bak","full_name":"Bak, Stanley","first_name":"Stanley"},{"full_name":"Forets, Marcelo","first_name":"Marcelo","last_name":"Forets"},{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"last_name":"Ray","first_name":"Rajarshi","full_name":"Ray, Rajarshi"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian"},{"last_name":"Schupp","full_name":"Schupp, Stefan","first_name":"Stefan"}],"quality_controlled":"1","page":"14-40","date_created":"2020-09-26T14:23:54Z","year":"2019","date_updated":"2021-01-12T08:20:05Z","status":"public","volume":61,"abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, 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.</jats:p>"}],"day":"25","article_processing_charge":"No","publication_identifier":{"eissn":["23987340"]},"citation":{"short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair; 2019:14-40. doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.","chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In <i>EPiC Series in Computing</i>, 61:14–40. EasyChair, 2019. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>.","apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>","mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair, 2019, pp. 14–40, doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>.","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 14–40."},"intvolume":"        61","main_file_link":[{"url":"https://easychair.org/publications/open/1gbP","open_access":"1"}]},{"department":[{"_id":"ToHe"}],"date_published":"2019-09-30T00:00:00Z","oa_version":"Preprint","external_id":{"arxiv":["1809.03864"]},"conference":{"name":"IJCNN: International Joint Conference on Neural Networks","start_date":"2019-07-14","location":"Budapest, Hungary","end_date":"2019-07-19"},"author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Felix","full_name":"Naser, Felix","last_name":"Naser"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"}],"publication":"Proceedings of the International Joint Conference on Neural Networks","publisher":"IEEE","_id":"6985","month":"09","doi":"10.1109/ijcnn.2019.8851954","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication_status":"published","arxiv":1,"language":[{"iso":"eng"}],"title":"Response characterization for auditing cell dynamics in long short-term memory networks","oa":1,"day":"30","citation":{"ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: <i>Proceedings of the International Joint Conference on Neural Networks</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ijcnn.2019.8851954\">10.1109/ijcnn.2019.8851954</a>","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” <i>Proceedings of the International Joint Conference on Neural Networks</i>, 8851954, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ijcnn.2019.8851954\">10.1109/ijcnn.2019.8851954</a>.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in <i>Proceedings of the International Joint Conference on Neural Networks</i>, Budapest, Hungary, 2019.","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In <i>Proceedings of the International Joint Conference on Neural Networks</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ijcnn.2019.8851954\">https://doi.org/10.1109/ijcnn.2019.8851954</a>.","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., &#38; Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In <i>Proceedings of the International Joint Conference on Neural Networks</i>. Budapest, Hungary: IEEE. <a href=\"https://doi.org/10.1109/ijcnn.2019.8851954\">https://doi.org/10.1109/ijcnn.2019.8851954</a>"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.03864"}],"scopus_import":1,"publication_identifier":{"isbn":["9781728119854"]},"date_updated":"2021-01-12T08:11:19Z","year":"2019","date_created":"2019-11-04T15:59:58Z","quality_controlled":"1","abstract":[{"text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets.","lang":"eng"}],"status":"public","article_number":"8851954"},{"language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1145/3286976","publisher":"ACM","issue":"3","publication":"Journal of the ACM","author":[{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"full_name":"Ničković, Dejan","first_name":"Dejan","last_name":"Ničković"},{"first_name":"Amir","full_name":"Pnueli, Amir","last_name":"Pnueli"}],"oa_version":"None","external_id":{"isi":["000495406300005"]},"date_published":"2019-05-01T00:00:00Z","isi":1,"volume":66,"year":"2019","date_created":"2019-11-26T10:22:32Z","quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"date_updated":"2023-09-06T11:11:56Z","publication_identifier":{"issn":["0004-5411"]},"scopus_import":"1","article_processing_charge":"No","publication_status":"published","title":"From real-time logic to timed automata","article_type":"original","month":"05","_id":"7109","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"}],"status":"public","article_number":"19","abstract":[{"lang":"eng","text":"We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended."}],"intvolume":"        66","citation":{"ama":"Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata. <i>Journal of the ACM</i>. 2019;66(3). doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>","short":"T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).","ieee":"T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” <i>Journal of the ACM</i>, vol. 66, no. 3. ACM, 2019.","mla":"Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>, vol. 66, no. 3, 19, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>.","ista":"Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed automata. Journal of the ACM. 66(3), 19.","apa":"Ferrere, T., Maler, O., Ničković, D., &#38; Pnueli, A. (2019). From real-time logic to timed automata. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>","chicago":"Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>."},"day":"01"},{"date_created":"2019-12-04T16:07:50Z","year":"2019","page":"155-187","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"24573","name":"Design principles underlying genetic switch architecture","_id":"251EE76E-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-09-06T11:18:08Z","isi":1,"volume":11773,"article_processing_charge":"No","publication_identifier":{"isbn":["9783030313036","9783030313043"],"eissn":["1611-3349"],"issn":["0302-9743"]},"scopus_import":"1","doi":"10.1007/978-3-030-31304-3_9","publisher":"Springer Nature","language":[{"iso":"eng"}],"type":"conference","external_id":{"isi":["000557875100009"]},"oa_version":"None","conference":{"start_date":"2019-09-18","name":"CMSB: Computational Methods in Systems Biology","end_date":"2019-09-20","location":"Trieste, Italy"},"date_published":"2019-09-17T00:00:00Z","publication":"17th International Conference on Computational Methods in Systems Biology","author":[{"last_name":"Guet","full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Igler","first_name":"Claudia","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana","first_name":"Tatjana","last_name":"Petrov"},{"full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","abstract":[{"lang":"eng","text":"The expression of a gene is characterised by its transcription factors and the function processing them. If the transcription factors are not affected by gene products, the regulating function is often represented as a combinational logic circuit, where the outputs (product) are determined by current input values (transcription factors) only, and are hence independent on their relative arrival times. However, the simultaneous arrival of transcription factors (TFs) in genetic circuits is a strong assumption, given that the processes of transcription and translation of a gene into a protein introduce intrinsic time delays and that there is no global synchronisation among the arrival times of different molecular species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally implementable genetic circuit with two inputs and a single output, such that, in presence of small delays in input arrival, the circuit exhibits qualitatively distinct observable phenotypes. In particular, these phenotypes are long lived transients: they all converge to a single value, but so slowly, that they seem stable for an extended time period, longer than typical experiment duration. We used rule-based language to prototype our circuit, and we implemented a search for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe behaviour of our prototype circuit has wide implications. First, it suggests that GRNs can exploit event timing to create phenotypes. Second, it opens the possibility that GRNs are using event timing to react to stimuli and memorise events, without explicit feedback in regulation. From the modelling perspective, our prototype circuit demonstrates the critical importance of analysing the transient dynamics at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions."}],"day":"17","intvolume":"     11773","citation":{"ama":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene regulation. In: <i>17th International Conference on Computational Methods in Systems Biology</i>. Vol 11773. Springer Nature; 2019:155-187. doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>","short":"C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.","mla":"Guet, Calin C., et al. “Transient Memory in Gene Regulation.” <i>17th International Conference on Computational Methods in Systems Biology</i>, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>.","ieee":"C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in <i>17th International Conference on Computational Methods in Systems Biology</i>, Trieste, Italy, 2019, vol. 11773, pp. 155–187.","ista":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187.","apa":"Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &#38; Sezgin, A. (2019). Transient memory in gene regulation. In <i>17th International Conference on Computational Methods in Systems Biology</i> (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>","chicago":"Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.” In <i>17th International Conference on Computational Methods in Systems Biology</i>, 11773:155–87. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>."},"month":"09","_id":"7147","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","title":"Transient memory in gene regulation","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"alternative_title":["LNCS"]},{"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030320782","9783030320799"]},"scopus_import":"1","article_processing_charge":"No","isi":1,"volume":11757,"date_created":"2019-12-09T08:47:55Z","year":"2019","quality_controlled":"1","page":"292-309","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF"}],"date_updated":"2023-09-06T11:24:10Z","publication":"19th International Conference on Runtime Verification","author":[{"full_name":"Ničković, Dejan","first_name":"Dejan","last_name":"Ničković"},{"first_name":"Xin","full_name":"Qin, Xin","last_name":"Qin"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"first_name":"Cristinel","full_name":"Mateis, Cristinel","last_name":"Mateis"},{"first_name":"Jyotirmoy","full_name":"Deshmukh, Jyotirmoy","last_name":"Deshmukh"}],"external_id":{"isi":["000570006300017"]},"oa_version":"None","conference":{"location":"Porto, Portugal","end_date":"2019-10-11","name":"RV: Runtime Verification","start_date":"2019-10-08"},"date_published":"2019-10-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","doi":"10.1007/978-3-030-32079-9_17","publisher":"Springer Nature","intvolume":"     11757","citation":{"apa":"Ničković, D., Qin, X., Ferrere, T., Mateis, C., &#38; Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In <i>19th International Conference on Runtime Verification</i> (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>","ista":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. 2019. Shape expressions for specifying and extracting signal features. 19th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 11757, 292–309.","chicago":"Ničković, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.” In <i>19th International Conference on Runtime Verification</i>, 11757:292–309. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>.","mla":"Ničković, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.” <i>19th International Conference on Runtime Verification</i>, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>.","ieee":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, and J. Deshmukh, “Shape expressions for specifying and extracting signal features,” in <i>19th International Conference on Runtime Verification</i>, Porto, Portugal, 2019, vol. 11757, pp. 292–309.","short":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, J. Deshmukh, in:, 19th International Conference on Runtime Verification, Springer Nature, 2019, pp. 292–309.","ama":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. Shape expressions for specifying and extracting signal features. In: <i>19th International Conference on Runtime Verification</i>. Vol 11757. Springer Nature; 2019:292-309. doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>"},"day":"01","status":"public","abstract":[{"text":"Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a tremendous amount of generated, measured and recorded time-series data. Extracting temporal segments that encode patterns with useful information out of these huge amounts of data is an extremely difficult problem. We propose shape expressions as a declarative formalism for specifying, querying and extracting sophisticated temporal patterns from possibly noisy data. Shape expressions are regular expressions with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters as atomic predicates and additional constraints on these parameters. We equip shape expressions with a novel noisy semantics that combines regular expression matching semantics with statistical regression. We characterize essential properties of the formalism and propose an efficient approximate shape expression matching procedure. We demonstrate the wide applicability of this technique on two case studies. ","lang":"eng"}],"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"publication_status":"published","title":"Shape expressions for specifying and extracting signal features","month":"10","_id":"7159","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"language":[{"iso":"eng"}],"arxiv":1,"type":"conference","doi":"10.1007/978-3-030-29662-9_8","publisher":"Springer Nature","publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","author":[{"last_name":"Kong","first_name":"Hui","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3066-6941"},{"last_name":"Bartocci","full_name":"Bartocci, Ezio","first_name":"Ezio"},{"full_name":"Jiang, Yu","first_name":"Yu","last_name":"Jiang"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"conference":{"location":"Amsterdam, The Netherlands","end_date":"2019-08-29","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2019-08-27"},"external_id":{"isi":["000611677700008"],"arxiv":["1907.11514"]},"oa_version":"Preprint","date_published":"2019-08-13T00:00:00Z","volume":11750,"isi":1,"quality_controlled":"1","page":"123-141","date_created":"2020-01-05T23:00:47Z","year":"2019","date_updated":"2023-09-06T14:55:15Z","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-0302-9661-2"]},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1907.11514","open_access":"1"}],"article_processing_charge":"No","oa":1,"title":"Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty","publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7231","month":"08","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"status":"public","abstract":[{"lang":"eng","text":"Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation for nonlinear systems with polynomial dynamics, which leverages a combination of barrier certificates. PBT has advantages over traditional time-step based methods in dealing with those nonlinear dynamical systems in which there is a large difference in speed between trajectories, producing an overapproximation that is time independent. However, the existing approach for PBT is not efficient due to the application of interval methods for enclosure-box computation, and it can only deal with continuous dynamical systems without uncertainty. In this paper, we extend the approach with the ability to handle both continuous and hybrid dynamical systems with uncertainty that can reside in parameters and/or noise. We also improve the efficiency of the method significantly, by avoiding the use of interval-based methods for the enclosure-box computation without loosing soundness. We have developed a C++ prototype implementing the proposed approach and we evaluate it on several benchmarks. The experiments show that our approach is more efficient and precise than other methods in the literature."}],"intvolume":"     11750","citation":{"ama":"Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In: <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 11750. Springer Nature; 2019:123-141. doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">10.1007/978-3-030-29662-9_8</a>","short":"H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141.","ieee":"H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty,” in <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 123–141.","mla":"Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">10.1007/978-3-030-29662-9_8</a>.","ista":"Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11750, 123–141.","apa":"Kong, H., Bartocci, E., Jiang, Y., &#38; Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">https://doi.org/10.1007/978-3-030-29662-9_8</a>","chicago":"Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 11750:123–41. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">https://doi.org/10.1007/978-3-030-29662-9_8</a>."},"day":"13"}]