[{"ddc":["000"],"volume":12399,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","isi":1,"external_id":{"isi":["000728160600001"]},"date_updated":"2023-09-05T15:08:26Z","citation":{"short":"T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020, pp. 3–18.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.” Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.","ista":"Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification. RV: Runtime Verification, LNCS, vol. 12399, 3–18.","apa":"Henzinger, T. A., & Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-60508-7_1","ama":"Henzinger TA, Sarac NE. Monitorability under assumptions. In: Runtime Verification. Vol 12399. Springer Nature; 2020:3-18. doi:10.1007/978-3-030-60508-7_1","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.” In Runtime Verification, 12399:3–18. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-60508-7_1.","ieee":"T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18."},"year":"2020","abstract":[{"lang":"eng","text":"We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers."}],"doi":"10.1007/978-3-030-60508-7_1","day":"02","file_date_updated":"2020-10-15T14:28:06Z","page":"3-18","quality_controlled":"1","publisher":"Springer Nature","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"_id":"8623","scopus_import":"1","alternative_title":["LNCS"],"title":"Monitorability under assumptions","intvolume":" 12399","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2020-10-07T15:05:37Z","article_processing_charge":"No","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"checksum":"00661f9b7034f52e18bf24fa552b8194","file_size":478148,"date_created":"2020-10-15T14:28:06Z","content_type":"application/pdf","file_name":"monitorability.pdf","date_updated":"2020-10-15T14:28:06Z","access_level":"open_access","relation":"main_file","success":1,"creator":"esarac","file_id":"8665"}],"date_published":"2020-10-02T00:00:00Z","type":"conference","oa":1,"publication_identifier":{"isbn":["9783030605070","9783030605087"],"eissn":["1611-3349"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2020-10-09","location":"Los Angeles, CA, United States","name":"RV: Runtime Verification","start_date":"2020-10-06"},"publication":"Runtime Verification","has_accepted_license":"1","month":"10","oa_version":"Submitted Version","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}]},{"type":"journal_article","date_published":"2020-10-01T00:00:00Z","publication_identifier":{"eissn":["2522-5839"]},"status":"public","related_material":{"link":[{"url":"https://ist.ac.at/en/news/new-deep-learning-models/","relation":"press_release","description":"News on IST Homepage"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication":"Nature Machine Intelligence","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","month":"10","language":[{"iso":"eng"}],"year":"2020","citation":{"mla":"Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3.","short":"M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652.","ista":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.","apa":"Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., & Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature. https://doi.org/10.1038/s42256-020-00237-3","ama":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2020;2:642-652. doi:10.1038/s42256-020-00237-3","ieee":"M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” Nature Machine Intelligence, vol. 2. Springer Nature, pp. 642–652, 2020.","chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence. Springer Nature, 2020. https://doi.org/10.1038/s42256-020-00237-3."},"date_updated":"2023-08-22T10:36:06Z","external_id":{"isi":["000583337200011"]},"isi":1,"day":"01","doi":"10.1038/s42256-020-00237-3","abstract":[{"lang":"eng","text":"A central goal of artificial intelligence in high-stakes decision-making applications is to design a single algorithm that simultaneously expresses generalizability by learning coherent representations of their world and interpretable explanations of its dynamics. Here, we combine brain-inspired neural computation principles and scalable deep learning architectures to design compact neural controllers for task-specific compartments of a full-stack autonomous vehicle control system. We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated input features to outputs by 253 synapses, learns to map high-dimensional inputs into steering commands. This system shows superior generalizability, interpretability and robustness compared with orders-of-magnitude larger black-box learning systems. The obtained neural agents enable high-fidelity autonomy for task-specific parts of a complex autonomous system."}],"volume":2,"scopus_import":"1","_id":"8679","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"department":[{"_id":"ToHe"}],"date_created":"2020-10-19T13:46:06Z","article_processing_charge":"No","publication_status":"published","intvolume":" 2","title":"Neural circuit policies enabling auditable autonomy","quality_controlled":"1","page":"642-652","publisher":"Springer Nature","article_type":"original"},{"has_accepted_license":"1","publication":"Proceedings - IEEE International Conference on Robotics and Automation","month":"05","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"location":"Paris, France","end_date":"2020-08-31","start_date":"2020-05-31","name":"ICRA: International Conference on Robotics and Automation"},"type":"conference","date_published":"2020-05-01T00:00:00Z","oa":1,"publication_identifier":{"isbn":["9781728173955"],"issn":["10504729"]},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_id":"8733","creator":"dernst","relation":"main_file","success":1,"access_level":"open_access","date_updated":"2020-11-06T10:58:49Z","content_type":"application/pdf","file_name":"2020_ICRA_Lechner.pdf","date_created":"2020-11-06T10:58:49Z","file_size":1070010,"checksum":"fccf7b986ac78046918a298cc6849a50"}],"author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"scopus_import":"1","_id":"8704","alternative_title":["ICRA"],"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","department":[{"_id":"ToHe"}],"date_created":"2020-10-25T23:01:19Z","article_processing_charge":"No","publication_status":"published","file_date_updated":"2020-11-06T10:58:49Z","quality_controlled":"1","page":"5446-5452","publisher":"IEEE","external_id":{"isi":["000712319503110"]},"isi":1,"citation":{"mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: Proceedings - IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452. doi:10.1109/ICRA40945.2020.9196608","apa":"Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in Proceedings - IEEE International Conference on Robotics and Automation, Paris, France, 2020, pp. 5446–5452.","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In Proceedings - IEEE International Conference on Robotics and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608."},"year":"2020","date_updated":"2023-08-22T10:40:15Z","abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"day":"01","doi":"10.1109/ICRA40945.2020.9196608","ddc":["000"],"acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company."},{"isi":1,"external_id":{"arxiv":["2006.12325"],"isi":["000661920400013"]},"date_updated":"2023-08-22T12:48:18Z","citation":{"short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020.","mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, 9314994, IEEE, 2020, doi:10.1109/MEMOCODE51338.2020.9314994.","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994.","apa":"Forets, M., Freire, D., & Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE. https://doi.org/10.1109/MEMOCODE51338.2020.9314994","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In: 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE; 2020. doi:10.1109/MEMOCODE51338.2020.9314994","chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE, 2020. https://doi.org/10.1109/MEMOCODE51338.2020.9314994.","ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions,” in 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, Virtual Conference, 2020."},"year":"2020","abstract":[{"text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost.","lang":"eng"}],"doi":"10.1109/MEMOCODE51338.2020.9314994","arxiv":1,"day":"04","quality_controlled":"1","ec_funded":1,"publisher":"IEEE","author":[{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"full_name":"Freire, Daniel","last_name":"Freire","first_name":"Daniel"},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"_id":"8750","scopus_import":"1","title":"Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2020-11-10T07:04:57Z","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.12325"}],"date_published":"2020-12-04T00:00:00Z","type":"conference","oa":1,"publication_identifier":{"isbn":["9781728191485"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2020-12-04","location":"Virtual Conference","name":"MEMOCODE: Conference on Formal Methods and Models for System Design","start_date":"2020-12-02"},"publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","month":"12","article_number":"9314994","oa_version":"Preprint","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","month":"11","oa_version":"Preprint","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"date_published":"2020-11-01T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"eissn":["19374151"],"issn":["02780070"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"relation":"earlier_version","id":"8287","status":"public"}]},"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1905.02458","open_access":"1"}],"author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","first_name":"Sergiy","last_name":"Bogomolov"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"full_name":"Potomkin, Kostiantyn","last_name":"Potomkin","first_name":"Kostiantyn"},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"issue":"11","_id":"8790","scopus_import":"1","title":"Reachability analysis of linear hybrid systems via block decomposition","intvolume":" 39","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2020-11-22T23:01:25Z","article_processing_charge":"No","page":"4018-4029","quality_controlled":"1","ec_funded":1,"article_type":"original","publisher":"IEEE","isi":1,"external_id":{"isi":["000587712700072"],"arxiv":["1905.02458"]},"date_updated":"2023-08-22T13:27:33Z","citation":{"ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029.","mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 4018–4029, 2020.","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012859.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012859","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):4018-4029. doi:10.1109/TCAD.2020.3012859"},"year":"2020","abstract":[{"lang":"eng","text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this article, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks."}],"arxiv":1,"doi":"10.1109/TCAD.2020.3012859","day":"01","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Air Force. ","volume":39},{"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Theoretical Computer Science","month":"02","project":[{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"}],"oa_version":"Submitted Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","related_material":{"record":[{"relation":"earlier_version","id":"1341","status":"public"}]},"file":[{"creator":"dernst","file_id":"8639","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2020_TheoreticalCS_Avni.pdf","date_updated":"2020-10-09T06:31:22Z","checksum":"e86635417f45eb2cd75778f91382f737","file_size":1413001,"date_created":"2020-10-09T06:31:22Z"}],"type":"journal_article","date_published":"2020-02-06T00:00:00Z","oa":1,"publication_identifier":{"issn":["03043975"]},"file_date_updated":"2020-10-09T06:31:22Z","quality_controlled":"1","page":"42-55","article_type":"original","publisher":"Elsevier","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"scopus_import":"1","_id":"6761","intvolume":" 807","title":"Dynamic resource allocation games","date_created":"2019-08-04T21:59:20Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","ddc":["000"],"volume":807,"external_id":{"isi":["000512219400004"]},"isi":1,"citation":{"ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55."},"year":"2020","date_updated":"2023-08-17T13:52:49Z","abstract":[{"lang":"eng","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."}],"day":"06","doi":"10.1016/j.tcs.2019.06.031"},{"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:56Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"7348","scopus_import":1,"author":[{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"}],"publication_status":"published","date_created":"2020-01-21T11:22:21Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Monitoring event frequencies","alternative_title":["LIPIcs"],"intvolume":" 152","volume":152,"ddc":["000"],"date_updated":"2021-01-12T08:13:12Z","year":"2020","citation":{"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.","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.","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20.","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20"},"external_id":{"arxiv":["1910.06097"]},"arxiv":1,"doi":"10.4230/LIPIcs.CSL.2020.20","day":"15","abstract":[{"lang":"eng","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. "}],"language":[{"iso":"eng"}],"conference":{"name":"CSL: Computer Science Logic","start_date":"2020-01-13","location":"Barcelona, Spain","end_date":"2020-01-16"},"publication":"28th EACSL Annual Conference on Computer Science Logic","has_accepted_license":"1","oa_version":"Published Version","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"month":"01","article_number":"20","file":[{"date_created":"2020-01-21T11:21:04Z","file_size":617206,"checksum":"b9a691d658d075c6369d3304d17fb818","date_updated":"2020-07-14T12:47:56Z","content_type":"application/pdf","file_name":"main.pdf","access_level":"open_access","relation":"main_file","file_id":"7349","creator":"bkragl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2020-01-15T00:00:00Z","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771320"]},"oa":1},{"oa":1,"publication_identifier":{"issn":["1751-570X"]},"date_published":"2020-05-01T00:00:00Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_name":"2020_NAHS_GarciaSoto.pdf","content_type":"application/pdf","date_updated":"2022-05-16T22:30:04Z","checksum":"560abfddb53f9fe921b6744f59f2cfaa","file_size":818774,"embargo":"2022-05-15","date_created":"2020-10-21T13:16:45Z","creator":"dernst","file_id":"8688","access_level":"open_access","relation":"main_file"}],"month":"05","article_number":"100856","oa_version":"Submitted Version","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication":"Nonlinear Analysis: Hybrid Systems","has_accepted_license":"1","language":[{"iso":"eng"}],"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"}],"doi":"10.1016/j.nahs.2020.100856","day":"01","isi":1,"external_id":{"isi":["000528828600003"]},"date_updated":"2023-08-17T14:32:54Z","year":"2020","citation":{"short":"M. Garcia Soto, P. Prabhakar, Nonlinear Analysis: Hybrid Systems 36 (2020).","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems, vol. 36, no. 5, 100856, Elsevier, 2020, doi:10.1016/j.nahs.2020.100856.","ista":"Garcia Soto M, Prabhakar P. 2020. Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 36(5), 100856.","ama":"Garcia Soto M, Prabhakar P. Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 2020;36(5). doi:10.1016/j.nahs.2020.100856","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2020.100856","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2020. https://doi.org/10.1016/j.nahs.2020.100856.","ieee":"M. Garcia Soto and P. Prabhakar, “Abstraction based verification of stability of polyhedral switched systems,” Nonlinear Analysis: Hybrid Systems, vol. 36, no. 5. Elsevier, 2020."},"ddc":["000"],"volume":36,"title":"Abstraction based verification of stability of polyhedral switched systems","intvolume":" 36","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2020-02-02T23:00:59Z","article_processing_charge":"No","author":[{"full_name":"Garcia Soto, Miriam","orcid":"0000−0003−2936−5719","last_name":"Garcia Soto","first_name":"Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"issue":"5","_id":"7426","scopus_import":"1","article_type":"original","publisher":"Elsevier","file_date_updated":"2022-05-16T22:30:04Z","quality_controlled":"1"},{"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.","volume":325,"ddc":["000"],"day":"24","arxiv":1,"doi":"10.3233/FAIA200375","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"}],"citation":{"mla":"Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” 24th European Conference on Artificial Intelligence, vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.","short":"T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.","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., & Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press. https://doi.org/10.3233/FAIA200375","ama":"Henzinger TA, Lukina A, Schilling C. Outside the box: Abstraction-based monitoring of neural networks. In: 24th European Conference on Artificial Intelligence. Vol 325. IOS Press; 2020:2433-2440. doi:10.3233/FAIA200375","ieee":"T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based monitoring of neural networks,” in 24th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.","chicago":"Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” In 24th European Conference on Artificial Intelligence, 325:2433–40. IOS Press, 2020. https://doi.org/10.3233/FAIA200375."},"year":"2020","date_updated":"2023-08-18T06:38:16Z","external_id":{"arxiv":["1911.09032"],"isi":["000650971303002"]},"isi":1,"publisher":"IOS Press","quality_controlled":"1","ec_funded":1,"page":"2433-2440","file_date_updated":"2020-09-21T07:12:32Z","date_created":"2020-02-21T16:44:03Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","intvolume":" 325","title":"Outside the box: Abstraction-based monitoring of neural networks","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"_id":"7505","author":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","full_name":"Lukina, Anna","last_name":"Lukina","first_name":"Anna"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"}],"file":[{"access_level":"open_access","success":1,"relation":"main_file","file_id":"8540","creator":"dernst","date_created":"2020-09-21T07:12:32Z","checksum":"80642fa0b6cd7da95dcd87d63789ad5e","file_size":1692214,"date_updated":"2020-09-21T07:12:32Z","content_type":"application/pdf","file_name":"2020_ECAI_Henzinger.pdf"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"type":"conference","date_published":"2020-02-24T00:00:00Z","conference":{"name":"ECAI: European Conference on Artificial Intelligence","start_date":"2020-08-29","location":"Santiago de Compostela, Spain","end_date":"2020-09-08"},"language":[{"iso":"eng"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Published Version","month":"02","has_accepted_license":"1","publication":"24th European Conference on Artificial Intelligence"},{"publication_identifier":{"eissn":["2708-7824"],"isbn":["9783854480426"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2020-09-21T00:00:00Z","type":"conference","file":[{"date_updated":"2021-02-09T09:39:02Z","file_name":"2020_FMCAD_Alamdari.pdf","content_type":"application/pdf","date_created":"2021-02-09T09:39:02Z","file_size":990999,"checksum":"d616d549a0ade78606b16f8a9540820f","file_id":"9109","creator":"dernst","relation":"main_file","success":1,"access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"Published Version","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"09","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","has_accepted_license":"1","conference":{"start_date":"2020-09-21","name":" FMCAD: Formal Methods in Computer-Aided Design","end_date":"2020-09-24","location":"Online Conference"},"language":[{"iso":"eng"}],"doi":"10.34727/2020/isbn.978-3-85448-042-6_21","day":"21","abstract":[{"lang":"eng","text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training."}],"date_updated":"2021-02-09T09:39:59Z","year":"2020","citation":{"mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21","ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.","chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21."},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","ddc":["000"],"publication_status":"published","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2021-01-24T23:01:10Z","title":"Formal methods with a touch of magic","_id":"9040","scopus_import":"1","author":[{"first_name":"Par Alizadeh","last_name":"Alamdari","full_name":"Alamdari, Par Alizadeh"},{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Lukina, Anna","last_name":"Lukina","first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"}],"publisher":"TU Wien Academic Press","page":"138-147","quality_controlled":"1","file_date_updated":"2021-02-09T09:39:02Z"},{"publisher":"IEEE","page":"1556-1563","quality_controlled":"1","title":"Lagrangian reachtubes: The next generation","intvolume":" 2020","publication_status":"published","date_created":"2021-02-07T23:01:14Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"author":[{"first_name":"Sophie","last_name":"Gruenbacher","full_name":"Gruenbacher, Sophie"},{"first_name":"Jacek","last_name":"Cyranka","full_name":"Cyranka, Jacek"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Islam, Md Ariful","last_name":"Islam","first_name":"Md Ariful"},{"last_name":"Smolka","first_name":"Scott A.","full_name":"Smolka, Scott A."},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"_id":"9103","scopus_import":"1","volume":2020,"acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","abstract":[{"lang":"eng","text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*."}],"doi":"10.1109/CDC42340.2020.9304042","arxiv":1,"day":"14","external_id":{"arxiv":["2012.07458"]},"date_updated":"2021-02-09T09:20:58Z","year":"2020","citation":{"chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042."},"conference":{"start_date":"2020-12-14","name":"CDC: Conference on Decision and Control","end_date":"2020-12-18","location":"Jeju Islang, Korea (South)"},"language":[{"iso":"eng"}],"month":"12","oa_version":"Preprint","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"publication":"Proceedings of the 59th IEEE Conference on Decision and Control","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"oa":1,"publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"date_published":"2020-12-14T00:00:00Z","type":"conference"},{"publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["9781577358350"]},"type":"journal_article","date_published":"2020-04-03T00:00:00Z","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"04","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","conference":{"location":"New York, NY, United States","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence","start_date":"2020-02-07"},"language":[{"iso":"eng"}],"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."}],"day":"03","doi":"10.1609/aaai.v34i02.5546","arxiv":1,"external_id":{"arxiv":["1911.08360"]},"citation":{"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.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546"},"year":"2020","date_updated":"2023-09-05T12:40:00Z","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).","volume":34,"intvolume":" 34","title":"All-pay bidding games on graphs","date_created":"2021-02-25T09:05:18Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_processing_charge":"No","publication_status":"published","issue":"02","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"}],"scopus_import":"1","_id":"9197","article_type":"original","publisher":"Association for the Advancement of Artificial Intelligence","quality_controlled":"1","page":"1798-1805"},{"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.","ddc":["000"],"date_updated":"2024-02-22T13:25:19Z","year":"2020","citation":{"apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","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.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256."},"isi":1,"external_id":{"isi":["000680435100021"]},"doi":"10.1109/RTSS49844.2020.00031","day":"01","abstract":[{"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.","lang":"eng"}],"page":"244-256","quality_controlled":"1","file_date_updated":"2021-02-26T16:38:14Z","publisher":"IEEE","_id":"9202","author":[{"last_name":"Garcia Soto","first_name":"Miriam","full_name":"Garcia Soto, Miriam","orcid":"0000-0003-2936-5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Prabhakar","first_name":"Pavithra","full_name":"Prabhakar, Pavithra"}],"publication_status":"published","date_created":"2021-02-26T16:38:24Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Hybridization for stability verification of nonlinear switched systems","file":[{"content_type":"application/pdf","file_name":"main.pdf","date_updated":"2021-02-26T16:38:14Z","checksum":"8f97f229316c3b3a6f0cf99297aa0941","file_size":1125794,"date_created":"2021-02-26T16:38:14Z","creator":"mgarcias","file_id":"9203","relation":"main_file","access_level":"open_access"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2020-12-01T00:00:00Z","type":"conference","publication_identifier":{"eissn":["2576-3172"],"eisbn":["9781728183244"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2020-12-04","location":"Houston, TX, USA ","start_date":"2020-12-01","name":"RTTS: Real-Time Systems Symposium"},"publication":"2020 IEEE Real-Time Systems Symposium","has_accepted_license":"1","oa_version":"Submitted Version","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"month":"12"},{"publication":"Advances in Neural Information Processing Systems","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","month":"12","language":[{"iso":"eng"}],"conference":{"end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06","name":"NeurIPS: Conference on Neural Information Processing Systems"},"type":"conference","date_published":"2020-12-06T00:00:00Z","publication_identifier":{"isbn":["9781713829546"],"issn":["10495258"]},"oa":1,"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","scopus_import":"1","_id":"9632","author":[{"full_name":"Singh, Sidak Pal","last_name":"Singh","first_name":"Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425"},{"last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"DaAl"},{"_id":"ToHe"}],"date_created":"2021-07-04T22:01:26Z","article_processing_charge":"No","publication_status":"published","intvolume":" 33","title":"WoodFisher: Efficient second-order approximation for neural network compression","quality_controlled":"1","ec_funded":1,"page":"18098-18109","publisher":"Curran Associates","citation":{"chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.","apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.","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.","short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109."},"year":"2020","date_updated":"2023-02-23T14:03:06Z","external_id":{"arxiv":["2004.14340"]},"day":"06","arxiv":1,"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."}],"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.","volume":33},{"acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","volume":61,"ddc":["000"],"year":"2019","citation":{"ieee":"G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol. 61, pp. 1–13.","chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse & M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn","ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn."},"date_updated":"2022-05-17T07:09:47Z","day":"25","doi":"10.29007/rjwn","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot 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 probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date."}],"quality_controlled":"1","page":"1-13","file_date_updated":"2022-05-17T06:55:49Z","editor":[{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"}],"publisher":"EasyChair","scopus_import":"1","_id":"10877","author":[{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"full_name":"Adzkiya, Dieky","first_name":"Dieky","last_name":"Adzkiya"},{"first_name":"Anna","last_name":"Becchi","full_name":"Becchi, Anna"},{"full_name":"Bu, Lei","first_name":"Lei","last_name":"Bu"},{"last_name":"Cimatti","first_name":"Alessandro","full_name":"Cimatti, Alessandro"},{"last_name":"Giacobbe","first_name":"Mirco","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alberto","last_name":"Griggio","full_name":"Griggio, Alberto"},{"full_name":"Mover, Sergio","last_name":"Mover","first_name":"Sergio"},{"full_name":"Mufid, Muhammad Syifa'ul","first_name":"Muhammad Syifa'ul","last_name":"Mufid"},{"full_name":"Riouak, Idriss","first_name":"Idriss","last_name":"Riouak"},{"last_name":"Tonetta","first_name":"Stefano","full_name":"Tonetta, Stefano"},{"first_name":"Enea","last_name":"Zaffanella","full_name":"Zaffanella, Enea"}],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2022-03-18T12:29:23Z","publication_status":"published","intvolume":" 61","alternative_title":["EPiC Series in Computing"],"title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","file":[{"file_id":"11391","creator":"dernst","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2022-05-17T06:55:49Z","content_type":"application/pdf","file_name":"2019_EPiCs_Frehse.pdf","date_created":"2022-05-17T06:55:49Z","file_size":346415,"checksum":"4b92e333db7b4e2349501a804dfede69"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_published":"2019-05-25T00:00:00Z","publication_identifier":{"issn":["2398-7340"]},"oa":1,"language":[{"iso":"eng"}],"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"},"has_accepted_license":"1","publication":"ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems","oa_version":"Published Version","month":"05"},{"date_published":"2019-05-25T00:00:00Z","type":"conference","date_updated":"2021-01-12T08:20:05Z","citation":{"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.","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.","mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.","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 EPiC Series in Computing, 61:14–40. EasyChair, 2019. https://doi.org/10.29007/bj1w.","ieee":"M. Althoff et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, 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: EPiC Series in Computing. Vol 61. EasyChair; 2019:14-40. doi:10.29007/bj1w","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 EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. https://doi.org/10.29007/bj1w"},"year":"2019","abstract":[{"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.","lang":"eng"}],"oa":1,"doi":"10.29007/bj1w","publication_identifier":{"eissn":["23987340"]},"day":"25","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":61,"main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/open/1gbP"}],"author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"full_name":"Bak, Stanley","first_name":"Stanley","last_name":"Bak"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"full_name":"Kochdumper, Niklas","first_name":"Niklas","last_name":"Kochdumper"},{"full_name":"Ray, Rajarshi","last_name":"Ray","first_name":"Rajarshi"},{"orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefan","last_name":"Schupp","full_name":"Schupp, Stefan"}],"publication":"EPiC Series in Computing","_id":"8570","month":"05","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","intvolume":" 61","oa_version":"Published Version","publication_status":"published","article_processing_charge":"No","date_created":"2020-09-26T14:23:54Z","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"page":"14-40","quality_controlled":"1","conference":{"location":"Montreal, Canada","end_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15"},"publisher":"EasyChair"},{"publication":"Journal of the ACM","oa_version":"Preprint","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"}],"month":"07","article_number":"31","language":[{"iso":"eng"}],"date_published":"2019-07-16T00:00:00Z","type":"journal_article","publication_identifier":{"eissn":["1557735X"],"issn":["00045411"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.01433","open_access":"1"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"950"}]},"_id":"6752","scopus_import":"1","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K","first_name":"Ventsislav K","last_name":"Chonev"}],"issue":"4","publication_status":"published","date_created":"2019-08-04T21:59:16Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Infinite-duration bidding games","intvolume":" 66","quality_controlled":"1","publisher":"ACM","date_updated":"2023-08-29T07:02:13Z","year":"2019","citation":{"ama":"Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. Journal of the ACM. 2019;66(4). doi:10.1145/3340295","apa":"Avni, G., Henzinger, T. A., & Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM. ACM. https://doi.org/10.1145/3340295","ieee":"G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” Journal of the ACM, vol. 66, no. 4. ACM, 2019.","chicago":"Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3340295.","short":"G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).","mla":"Avni, Guy, et al. “Infinite-Duration Bidding Games.” Journal of the ACM, vol. 66, no. 4, 31, ACM, 2019, doi:10.1145/3340295.","ista":"Avni G, Henzinger TA, Chonev VK. 2019. Infinite-duration bidding games. Journal of the ACM. 66(4), 31."},"isi":1,"external_id":{"isi":["000487714900008"],"arxiv":["1705.01433"]},"doi":"10.1145/3340295","arxiv":1,"day":"16","abstract":[{"text":"Two-player games on graphs are widely studied in formal methods, as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. The following bidding rule was previously defined and called Richman bidding. Both players have separate budgets, which sum up to 1. In each turn, a bidding takes place: Both players submit bids simultaneously, where a bid is legal if it does not exceed the available budget, and the higher bidder pays his bid to the other player and moves the token. The central question studied in bidding games is a necessary and sufficient initial budget for winning the game: a threshold budget in a vertex is a value t ∈ [0, 1] such that if Player 1’s budget exceeds t, he can win the game; and if Player 2’s budget exceeds 1 − t, he can win the game. Threshold budgets were previously shown to exist in every vertex of a reachability game, which have an interesting connection with random-turn games—a sub-class of simple stochastic games in which the player who moves is chosen randomly. We show the existence of threshold budgets for a qualitative class of infinite-duration games, namely parity games, and a quantitative class, namely mean-payoff games. The key component of the proof is a quantitative solution to strongly connected mean-payoff bidding games in which we extend the connection with random-turn games to these games, and construct explicit optimal strategies for both players.","lang":"eng"}],"volume":66},{"citation":{"ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1."},"year":"2019","date_updated":"2021-01-12T08:09:12Z","day":"06","doi":"10.1007/978-3-030-30806-3_1","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"volume":11674,"ddc":["000"],"scopus_import":1,"_id":"6822","author":[{"full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Novotny, Petr","first_name":"Petr","last_name":"Novotny"}],"department":[{"_id":"ToHe"}],"date_created":"2019-08-19T07:58:10Z","publication_status":"published","intvolume":" 11674","alternative_title":["LNCS"],"title":"Bidding games on Markov decision processes","quality_controlled":"1","page":"1-12","file_date_updated":"2020-07-14T12:47:41Z","publisher":"Springer","type":"conference","date_published":"2019-09-06T00:00:00Z","publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"oa":1,"file":[{"relation":"main_file","access_level":"open_access","file_id":"6823","creator":"gavni","date_created":"2019-08-19T07:56:40Z","file_size":436635,"checksum":"45ebbc709af2b247d28c7c293c01504b","date_updated":"2020-07-14T12:47:41Z","content_type":"application/pdf","file_name":"prob.pdf"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publication":" Proceedings of the 13th International Conference of Reachability Problems","project":[{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Submitted Version","month":"09","language":[{"iso":"eng"}],"conference":{"start_date":"2019-09-11","name":"RP: Reachability Problems","location":"Brussels, Belgium","end_date":"2019-09-13"}},{"volume":138,"ddc":["004"],"day":"01","doi":"10.4230/LIPICS.MFCS.2019.11","arxiv":1,"abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. ","lang":"eng"}],"year":"2019","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11.","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.","apa":"Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11","ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11."},"date_updated":"2023-08-07T14:08:34Z","external_id":{"arxiv":["1905.03835"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:42Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2019-09-18T08:04:26Z","publication_status":"published","intvolume":" 138","title":"Bidding mechanisms in graph games","alternative_title":["LIPIcs"],"scopus_import":1,"_id":"6884","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"file":[{"relation":"main_file","access_level":"open_access","file_id":"6913","creator":"kschuh","date_created":"2019-09-27T11:45:15Z","checksum":"6346e116a4f4ed1414174d96d2c4fbd7","file_size":554457,"date_updated":"2020-07-14T12:47:42Z","content_type":"application/pdf","file_name":"2019_LIPIcs_Avni.pdf"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"9239","status":"public"}]},"status":"public","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","date_published":"2019-08-01T00:00:00Z","conference":{"start_date":"2019-08-26","name":"MFCS: nternational Symposium on Mathematical Foundations of Computer Science","end_date":"2019-08-30","location":"Aachen, Germany"},"language":[{"iso":"eng"}],"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","article_number":"11","month":"08","has_accepted_license":"1"},{"project":[{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Published Version","article_number":"27","month":"08","has_accepted_license":"1","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","end_date":"2019-08-30","location":"Amsterdam, Netherlands"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","date_published":"2019-08-01T00:00:00Z","file":[{"creator":"kschuh","file_id":"6914","access_level":"open_access","relation":"main_file","file_name":"2019_LIPIcs_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:43Z","checksum":"4985e26e1572d1575d64d38acabd71d6","file_size":538120,"date_created":"2019-09-27T12:09:35Z"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2019-09-18T08:06:14Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","intvolume":" 140","alternative_title":["LIPIcs"],"title":"Long-run average behavior of vector addition systems with states","scopus_import":1,"_id":"6885","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:43Z","day":"01","doi":"10.4230/LIPICS.CONCUR.2019.27","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"year":"2019","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27"},"date_updated":"2021-01-12T08:09:27Z","volume":140,"ddc":["000"]}]