[{"article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2019-08-01T00:00:00Z","citation":{"chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (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.20","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20"},"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 winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. "}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"file_id":"6915","relation":"main_file","checksum":"4df6d3575c506edb17215adada03cc8e","date_updated":"2020-07-14T12:47:43Z","date_created":"2019-09-27T12:21:38Z","access_level":"open_access","file_name":"2019_LIPIcs_Aghajohari.pdf","creator":"kschuh","file_size":741425,"content_type":"application/pdf"}],"oa_version":"Published Version","intvolume":" 140","status":"public","title":"Determinacy in discrete-bidding infinite-duration games","ddc":["000"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"6886","month":"08","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.CONCUR.2019.20","conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","start_date":"2019-08-27","location":"Amsterdam, Netherlands"},"project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","external_id":{"arxiv":["1905.03588"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2020-07-14T12:47:43Z","article_number":"20","volume":140,"date_updated":"2022-01-26T08:27:10Z","date_created":"2019-09-18T08:06:58Z","author":[{"last_name":"Aghajohari","first_name":"Milad","full_name":"Aghajohari, Milad"},{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2019"},{"date_published":"2019-08-01T00:00:00Z","citation":{"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.","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.","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.","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","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.","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"},"day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:43Z","date_created":"2019-09-27T12:09:35Z","checksum":"4985e26e1572d1575d64d38acabd71d6","file_id":"6914","relation":"main_file","creator":"kschuh","file_size":538120,"content_type":"application/pdf","file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access"}],"_id":"6885","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Long-run average behavior of vector addition systems with states","status":"public","intvolume":" 140","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"}],"type":"conference","alternative_title":["LIPIcs"],"conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands","start_date":"2019-08-27"},"doi":"10.4230/LIPICS.CONCUR.2019.27","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"month":"08","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"date_created":"2019-09-18T08:06:14Z","date_updated":"2021-01-12T08:09:27Z","volume":140,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","article_number":"27"},{"month":"08","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.CONCUR.2019.6","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30"},"project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file_date_updated":"2020-07-14T12:47:43Z","article_number":"6","volume":140,"date_updated":"2021-01-12T08:09:28Z","date_created":"2019-09-18T08:11:43Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2019","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2019-08-01T00:00:00Z","citation":{"ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (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.6","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6."},"abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:43Z","date_created":"2019-10-01T08:49:45Z","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","relation":"main_file","file_id":"6923","file_size":509163,"content_type":"application/pdf","creator":"kschuh","file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access"}],"intvolume":" 140","ddc":["000"],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6889"},{"file_date_updated":"2020-07-14T12:47:44Z","ec_funded":1,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"author":[{"full_name":"Nowak, Thomas","first_name":"Thomas","last_name":"Nowak"},{"full_name":"Rybicki, Joel","first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646"}],"date_updated":"2021-01-12T08:09:38Z","date_created":"2019-10-08T12:41:38Z","volume":146,"publication_identifier":{"eisbn":["978-3-95977-126-9"]},"external_id":{"arxiv":["1908.02743"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"conference":{"name":"DISC: International Symposium on Distributed Computing","end_date":"2019-10-18","start_date":"2019-10-14","location":"Budapest, Hungary"},"doi":"10.4230/LIPICS.DISC.2019.29","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures.","lang":"eng"}],"_id":"6931","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Byzantine approximate agreement on graphs","status":"public","ddc":["004"],"intvolume":" 146","file":[{"relation":"main_file","file_id":"6934","date_updated":"2020-07-14T12:47:44Z","date_created":"2019-10-08T12:47:19Z","checksum":"2d2202f90c6ac991e50876451627c4b5","file_name":"LIPIcs-DISC-2019-29.pdf","access_level":"open_access","content_type":"application/pdf","file_size":639378,"creator":"jrybicki"}],"oa_version":"Published Version","scopus_import":1,"keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"has_accepted_license":"1","article_processing_charge":"No","publication":"33rd International Symposium on Distributed Computing","citation":{"ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.","short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.","mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29."},"page":"29:1--29:17","date_published":"2019-01-01T00:00:00Z"},{"scopus_import":1,"publication_identifier":{"isbn":["9781728119854"]},"month":"09","day":"30","oa":1,"external_id":{"arxiv":["1809.03864"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.03864"}],"citation":{"short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954."},"publication":"Proceedings of the International Joint Conference on Neural Networks","quality_controlled":"1","doi":"10.1109/ijcnn.2019.8851954","date_published":"2019-09-30T00:00:00Z","conference":{"name":"IJCNN: International Joint Conference on Neural Networks","end_date":"2019-07-19","location":"Budapest, Hungary","start_date":"2019-07-14"},"language":[{"iso":"eng"}],"type":"conference","article_number":"8851954","abstract":[{"lang":"eng","text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets."}],"year":"2019","_id":"6985","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","status":"public","title":"Response characterization for auditing cell dynamics in long short-term memory networks","author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Felix","last_name":"Naser","full_name":"Naser, Felix"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:11:19Z","date_created":"2019-11-04T15:59:58Z"},{"scopus_import":1,"has_accepted_license":"1","day":"18","citation":{"ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218","ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218.","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218."},"publication":"Algorithms","article_type":"original","date_published":"2019-10-18T00:00:00Z","type":"journal_article","issue":"10","abstract":[{"text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.","lang":"eng"}],"_id":"7007","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12","title":"A new coding paradigm for the primitive relay channel","ddc":["510"],"status":"public","oa_version":"Published Version","file":[{"creator":"dernst","file_size":696791,"content_type":"application/pdf","file_name":"2019_Algorithms_Mondelli.pdf","access_level":"open_access","date_created":"2019-11-12T14:48:45Z","date_updated":"2020-07-14T12:47:47Z","checksum":"267756d8f9db572f496cd1663c89d59a","file_id":"7008","relation":"main_file"}],"publication_identifier":{"issn":["1999-4893"]},"month":"10","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1801.03153"]},"oa":1,"quality_controlled":"1","doi":"10.3390/a12100218","language":[{"iso":"eng"}],"article_number":"218","file_date_updated":"2020-07-14T12:47:47Z","year":"2019","department":[{"_id":"MaMo"}],"publisher":"MDPI","publication_status":"published","related_material":{"record":[{"id":"6675","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Hassani, S. Hamed","last_name":"Hassani","first_name":"S. Hamed"},{"full_name":"Urbanke, Rüdiger","last_name":"Urbanke","first_name":"Rüdiger"}],"volume":12,"date_created":"2019-11-12T14:46:19Z","date_updated":"2023-02-23T12:49:28Z"},{"conference":{"name":"Research on isometries as preserver problems and related topics","end_date":"2019-01-30","start_date":"2019-01-28","location":"Kyoto, Japan"},"date_published":"2019-01-30T00:00:00Z","language":[{"iso":"eng"}],"publication":"Kyoto RIMS Kôkyûroku","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html"}],"citation":{"ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41."},"quality_controlled":"1","page":"34-41","day":"30","month":"01","article_processing_charge":"No","author":[{"full_name":"Geher, Gyorgy Pal","last_name":"Geher","first_name":"Gyorgy Pal"},{"full_name":"Titkos, Tamas","last_name":"Titkos","first_name":"Tamas"},{"first_name":"Daniel","last_name":"Virosztek","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511","full_name":"Virosztek, Daniel"}],"date_updated":"2021-01-12T08:11:33Z","date_created":"2019-11-18T15:39:53Z","oa_version":"Submitted Version","volume":2125,"_id":"7035","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Dirac masses and isometric rigidity","status":"public","department":[{"_id":"LaEr"}],"intvolume":" 2125","publisher":"Research Institute for Mathematical Sciences, Kyoto University","abstract":[{"text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question.","lang":"eng"}],"type":"conference"},{"date_published":"2019-10-30T00:00:00Z","doi":"10.1007/978-3-658-26763-6","language":[{"iso":"ger"}],"citation":{"ama":"Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019. doi:10.1007/978-3-658-26763-6","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","apa":"Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature. https://doi.org/10.1007/978-3-658-26763-6","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.","mla":"Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6."},"page":"XIV, 245","quality_controlled":"1","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"article_processing_charge":"No","day":"30","month":"10","related_material":{"link":[{"description":"News on IST Website","relation":"press_release","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/"}]},"edition":"1","oa_version":"None","date_updated":"2021-12-22T14:40:58Z","date_created":"2019-12-11T14:15:56Z","year":"2019","_id":"7171","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Springer Nature","department":[{"_id":"ChLa"}],"editor":[{"last_name":"Kersting","first_name":"Kristian","full_name":"Kersting, Kristian"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"},{"last_name":"Rothkopf","first_name":"Constantin","full_name":"Rothkopf, Constantin"}],"publication_status":"published","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","status":"public","abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"type":"book_editor","place":"Wiesbaden"},{"date_created":"2020-01-29T16:17:05Z","date_updated":"2021-01-12T08:13:24Z","volume":129,"author":[{"orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav"},{"full_name":"Kyncl, Jan","last_name":"Kyncl","first_name":"Jan"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"year":"2019","file_date_updated":"2020-07-14T12:47:57Z","article_number":"39","language":[{"iso":"eng"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2019-06-21","location":"Portland, OR, United States","start_date":"2019-06-18"},"doi":"10.4230/LIPICS.SOCG.2019.39","quality_controlled":"1","project":[{"grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1903.08637"]},"oa":1,"month":"06","publication_identifier":{"isbn":["978-3-95977-104-7"],"issn":["1868-8969"]},"file":[{"relation":"main_file","file_id":"7445","checksum":"aac37b09118cc0ab58cf77129e691f8c","date_updated":"2020-07-14T12:47:57Z","date_created":"2020-02-04T09:14:31Z","access_level":"open_access","file_name":"2019_LIPIcs_Fulek.pdf","file_size":628347,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","ddc":["000"],"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","status":"public","intvolume":" 129","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7401","abstract":[{"text":"The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. ","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2019-06-01T00:00:00Z","publication":"35th International Symposium on Computational Geometry (SoCG 2019)","citation":{"mla":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.","short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.","ama":"Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39","ista":"Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.","ieee":"R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.","apa":"Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39"},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7453","intvolume":" 10000","status":"public","title":"Continuous-time models for system design and analysis","oa_version":"Published Version","type":"book_chapter","alternative_title":["Lecture Notes in Computer Science"],"abstract":[{"lang":"eng","text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement."}],"citation":{"chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in Computing and Software Science, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen & G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22"},"publication":"Computing and Software Science","page":"452-477","date_published":"2019-10-05T00:00:00Z","scopus_import":"1","series_title":"LNCS","article_processing_charge":"No","day":"05","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","year":"2019","department":[{"_id":"ToHe"}],"editor":[{"first_name":"Bernhard","last_name":"Steffen","full_name":"Steffen, Bernhard"},{"full_name":"Woeginger, Gerhard","first_name":"Gerhard","last_name":"Woeginger"}],"publisher":"Springer Nature","publication_status":"published","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","first_name":"Mirco","full_name":"Giacobbe, Mirco"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."},{"last_name":"Mikučionis","first_name":"Marius","full_name":"Mikučionis, Marius"}],"volume":10000,"date_created":"2020-02-05T10:51:44Z","date_updated":"2022-09-06T08:25:52Z","main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"oa":1,"project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","doi":"10.1007/978-3-319-91908-9_22","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783319919089"],"issn":["1611-3349"],"isbn":["9783319919072"],"eissn":["0302-9743"]},"month":"10"}]