[{"conference":{"end_date":"2014-10-03","start_date":"2014-09-30","location":"Monticello, IL, United States","name":"Allerton Conference on Communication, Control, and Computing"},"publisher":"IEEE","date_published":"2014-10-01T00:00:00Z","title":"How to achieve the capacity of asymmetric channels","quality_controlled":"1","date_created":"2019-07-31T07:24:23Z","page":"789-796","year":"2014","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.7373"}],"arxiv":1,"language":[{"iso":"eng"}],"publication":"52nd Annual Allerton Conference on Communication, Control, and Computing","_id":"6740","status":"public","publication_identifier":{"eisbn":["978-1-4799-8009-3"]},"external_id":{"arxiv":["1406.7373"]},"doi":"10.1109/allerton.2014.7028535","abstract":[{"text":"We describe coding techniques that achieve the capacity of a discrete memoryless asymmetric channel. To do so, we discuss how recent advances in coding for symmetric channels yield more efficient solutions also for the asymmetric case. In more detail, we consider three basic approaches. The first one is Gallager's scheme that concatenates a linear code with a non-linear mapper, in order to bias the input distribution. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Further, we derive a scaling law between the gap to capacity, the cardinality of channel input and output alphabets, and the required size of the mapper. The second one is an integrated approach in which the coding scheme is used both for source coding, in order to create codewords with the capacity-achieving distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third approach is based on an idea due to Böcherer and Mathar and separates completely the two tasks of source coding and channel coding by “chaining” together several codewords. We prove that we can combine any suitable source code with any suitable channel code in order to provide optimal schemes for asymmetric channels. In particular, polar codes and spatially coupled codes fulfill the required conditions.","lang":"eng"}],"month":"10","related_material":{"record":[{"status":"public","id":"6678","relation":"later_version"}]},"type":"conference","publication_status":"published","oa_version":"Preprint","date_updated":"2023-02-23T12:49:36Z","extern":"1","author":[{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Urbanke","full_name":"Urbanke, Rudiger","first_name":"Rudiger"},{"first_name":"Hamed","full_name":"Hassani, Hamed","last_name":"Hassani"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Mondelli, M., Urbanke, R., &#38; Hassani, H. (2014). How to achieve the capacity of asymmetric channels. In <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i> (pp. 789–796). Monticello, IL, United States: IEEE. <a href=\"https://doi.org/10.1109/allerton.2014.7028535\">https://doi.org/10.1109/allerton.2014.7028535</a>","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, IEEE, 2014, pp. 789–96, doi:<a href=\"https://doi.org/10.1109/allerton.2014.7028535\">10.1109/allerton.2014.7028535</a>.","ista":"Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric channels. 52nd Annual Allerton Conference on Communication, Control, and Computing. Allerton Conference on Communication, Control, and Computing, 789–796.","chicago":"Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the Capacity of Asymmetric Channels.” In <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, 789–96. IEEE, 2014. <a href=\"https://doi.org/10.1109/allerton.2014.7028535\">https://doi.org/10.1109/allerton.2014.7028535</a>.","ama":"Mondelli M, Urbanke R, Hassani H. How to achieve the capacity of asymmetric channels. In: <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>. IEEE; 2014:789-796. doi:<a href=\"https://doi.org/10.1109/allerton.2014.7028535\">10.1109/allerton.2014.7028535</a>","short":"M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.","ieee":"M. Mondelli, R. Urbanke, and H. Hassani, “How to achieve the capacity of asymmetric channels,” in <i>52nd Annual Allerton Conference on Communication, Control, and Computing</i>, Monticello, IL, United States, 2014, pp. 789–796."},"day":"01"},{"publisher":"IST Austria","title":"Playful Math - An introduction to mathematical games","date_published":"2014-06-30T00:00:00Z","page":"5","ddc":["510"],"date_created":"2019-11-18T15:57:05Z","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2014","status":"public","_id":"7038","file_date_updated":"2020-07-14T12:47:48Z","type":"working_paper","month":"06","has_accepted_license":"1","day":"30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Huszár K, Rolinek M. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria","short":"K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.","chicago":"Huszár, Kristóf, and Michal Rolinek. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria, n.d.","ieee":"K. Huszár and M. Rolinek, <i>Playful Math - An introduction to mathematical games</i>. IST Austria.","ista":"Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.","apa":"Huszár, K., &#38; Rolinek, M. (n.d.). <i>Playful Math - An introduction to mathematical games</i>. IST Austria.","mla":"Huszár, Kristóf, and Michal Rolinek. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria."},"oa":1,"author":[{"last_name":"Huszár","id":"33C26278-F248-11E8-B48F-1D18A9856A87","first_name":"Kristóf","full_name":"Huszár, Kristóf","orcid":"0000-0002-5445-5057"},{"last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rolinek, Michal"}],"oa_version":"Published Version","publication_status":"draft","date_updated":"2020-07-14T23:11:45Z","department":[{"_id":"VlKo"},{"_id":"UlWa"}],"file":[{"creator":"dernst","checksum":"2b94e5e1f4c3fe8ab89b12806276fb09","relation":"main_file","file_id":"7039","date_created":"2019-11-18T15:57:51Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:48Z","file_size":511233,"file_name":"2014_Playful_Math_Huszar.pdf"}]},{"date_published":"2014-06-27T00:00:00Z","title":"Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2014","publication":"Nature Communications","article_processing_charge":"No","volume":5,"ddc":["530"],"date_created":"2019-11-19T13:22:39Z","file_date_updated":"2020-07-14T12:47:48Z","_id":"7071","date_updated":"2021-01-12T08:11:42Z","oa_version":"Published Version","file":[{"access_level":"open_access","date_created":"2019-11-26T12:44:23Z","file_id":"7113","file_name":"2014_NatureComm_Modic.pdf","file_size":4832820,"date_updated":"2020-07-14T12:47:48Z","content_type":"application/pdf","relation":"main_file","checksum":"d290f0bfa93c5169cc6c8086874c5a78","creator":"dernst"}],"citation":{"ieee":"K. A. Modic <i>et al.</i>, “Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate,” <i>Nature Communications</i>, vol. 5. Springer Science and Business Media LLC, 2014.","short":"K.A. Modic, T.E. Smidt, I. Kimchi, N.P. Breznay, A. Biffin, S. Choi, R.D. Johnson, R. Coldea, P. Watkins-Curry, G.T. McCandless, J.Y. Chan, F. Gandara, Z. Islam, A. Vishwanath, A. Shekhter, R.D. McDonald, J.G. Analytis, Nature Communications 5 (2014).","ama":"Modic KA, Smidt TE, Kimchi I, et al. Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. <i>Nature Communications</i>. 2014;5. doi:<a href=\"https://doi.org/10.1038/ncomms5203\">10.1038/ncomms5203</a>","chicago":"Modic, Kimberly A, Tess E. Smidt, Itamar Kimchi, Nicholas P. Breznay, Alun Biffin, Sungkyun Choi, Roger D. Johnson, et al. “Realization of a Three-Dimensional Spin–Anisotropic Harmonic Honeycomb Iridate.” <i>Nature Communications</i>. Springer Science and Business Media LLC, 2014. <a href=\"https://doi.org/10.1038/ncomms5203\">https://doi.org/10.1038/ncomms5203</a>.","ista":"Modic KA, Smidt TE, Kimchi I, Breznay NP, Biffin A, Choi S, Johnson RD, Coldea R, Watkins-Curry P, McCandless GT, Chan JY, Gandara F, Islam Z, Vishwanath A, Shekhter A, McDonald RD, Analytis JG. 2014. Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. Nature Communications. 5, 4203.","apa":"Modic, K. A., Smidt, T. E., Kimchi, I., Breznay, N. P., Biffin, A., Choi, S., … Analytis, J. G. (2014). Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate. <i>Nature Communications</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1038/ncomms5203\">https://doi.org/10.1038/ncomms5203</a>","mla":"Modic, Kimberly A., et al. “Realization of a Three-Dimensional Spin–Anisotropic Harmonic Honeycomb Iridate.” <i>Nature Communications</i>, vol. 5, 4203, Springer Science and Business Media LLC, 2014, doi:<a href=\"https://doi.org/10.1038/ncomms5203\">10.1038/ncomms5203</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","author":[{"last_name":"Modic","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A"},{"last_name":"Smidt","first_name":"Tess E.","full_name":"Smidt, Tess E."},{"full_name":"Kimchi, Itamar","first_name":"Itamar","last_name":"Kimchi"},{"last_name":"Breznay","first_name":"Nicholas P.","full_name":"Breznay, Nicholas P."},{"last_name":"Biffin","first_name":"Alun","full_name":"Biffin, Alun"},{"last_name":"Choi","first_name":"Sungkyun","full_name":"Choi, Sungkyun"},{"first_name":"Roger D.","full_name":"Johnson, Roger D.","last_name":"Johnson"},{"full_name":"Coldea, Radu","first_name":"Radu","last_name":"Coldea"},{"last_name":"Watkins-Curry","full_name":"Watkins-Curry, Pilanda","first_name":"Pilanda"},{"last_name":"McCandless","first_name":"Gregory T.","full_name":"McCandless, Gregory T."},{"last_name":"Chan","first_name":"Julia Y.","full_name":"Chan, Julia Y."},{"full_name":"Gandara, Felipe","first_name":"Felipe","last_name":"Gandara"},{"last_name":"Islam","first_name":"Z.","full_name":"Islam, Z."},{"last_name":"Vishwanath","full_name":"Vishwanath, Ashvin","first_name":"Ashvin"},{"last_name":"Shekhter","full_name":"Shekhter, Arkady","first_name":"Arkady"},{"first_name":"Ross D.","full_name":"McDonald, Ross D.","last_name":"McDonald"},{"last_name":"Analytis","full_name":"Analytis, James G.","first_name":"James G."}],"oa":1,"type":"journal_article","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"article_number":"4203","intvolume":"         5","article_type":"original","abstract":[{"text":"Spin and orbital quantum numbers play a key role in the physics of Mott insulators, but in most systems they are connected only indirectly—via the Pauli exclusion principle and the Coulomb interaction. Iridium-based oxides (iridates) introduce strong spin–orbit coupling directly, such that these numbers become entwined together and the Mott physics attains a strong orbital character. In the layered honeycomb iridates this is thought to generate highly spin–anisotropic magnetic interactions, coupling the spin to a given spatial direction of exchange and leading to strongly frustrated magnetism. Here we report a new iridate structure that has the same local connectivity as the layered honeycomb and exhibits striking evidence for highly spin–anisotropic exchange. The basic structural units of this material suggest that a new family of three-dimensional structures could exist, the ‘harmonic honeycomb’ iridates, of which the present compound is the first example.","lang":"eng"}],"doi":"10.1038/ncomms5203","status":"public","publication_identifier":{"issn":["2041-1723"]},"publication_status":"published","day":"27","extern":"1","month":"06"},{"type":"journal_article","oa_version":"Published Version","date_updated":"2021-01-12T08:14:24Z","file":[{"access_level":"open_access","file_id":"7613","date_created":"2020-03-23T12:23:40Z","file_name":"2014_CellPress_Tan.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:48:01Z","file_size":2755808,"checksum":"23c30de4ac98ce9879fc054121517626","relation":"main_file","creator":"dernst"}],"citation":{"chicago":"Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis by Phosphorylating and Promoting the Turnover of ACS5.” <i>Cell Reports</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.celrep.2014.10.047\">https://doi.org/10.1016/j.celrep.2014.10.047</a>.","ama":"Tan S, Xue H-W. Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting the turnover of ACS5. <i>Cell Reports</i>. 2014;9(5):1692-1702. doi:<a href=\"https://doi.org/10.1016/j.celrep.2014.10.047\">10.1016/j.celrep.2014.10.047</a>","short":"S. Tan, H.-W. Xue, Cell Reports 9 (2014) 1692–1702.","ieee":"S. Tan and H.-W. Xue, “Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting the turnover of ACS5,” <i>Cell Reports</i>, vol. 9, no. 5. Elsevier, pp. 1692–1702, 2014.","apa":"Tan, S., &#38; Xue, H.-W. (2014). Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting the turnover of ACS5. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2014.10.047\">https://doi.org/10.1016/j.celrep.2014.10.047</a>","mla":"Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis by Phosphorylating and Promoting the Turnover of ACS5.” <i>Cell Reports</i>, vol. 9, no. 5, Elsevier, 2014, pp. 1692–702, doi:<a href=\"https://doi.org/10.1016/j.celrep.2014.10.047\">10.1016/j.celrep.2014.10.047</a>.","ista":"Tan S, Xue H-W. 2014. Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting the turnover of ACS5. Cell Reports. 9(5), 1692–1702."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","author":[{"orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","first_name":"Shutang","last_name":"Tan"},{"last_name":"Xue","first_name":"Hong-Wei","full_name":"Xue, Hong-Wei"}],"oa":1,"_id":"7598","file_date_updated":"2020-07-14T12:48:01Z","ddc":["580"],"date_created":"2020-03-21T16:08:18Z","year":"2014","publication":"Cell Reports","article_processing_charge":"No","volume":9,"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"title":"Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting the turnover of ACS5","date_published":"2014-12-11T00:00:00Z","quality_controlled":"1","month":"12","publication_status":"published","day":"11","extern":"1","status":"public","publication_identifier":{"issn":["2211-1247"]},"issue":"5","doi":"10.1016/j.celrep.2014.10.047","intvolume":"         9","page":"1692-1702","article_type":"original","language":[{"iso":"eng"}],"publisher":"Elsevier"},{"date_created":"2018-12-11T11:48:25Z","page":"714 - 723","year":"2014","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1311.3200"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","arxiv":1,"conference":{"name":"STOC: Symposium on Theory of Computing"},"publisher":"ACM","title":"Are lock-free concurrent algorithms practically wait-free?","date_published":"2014-01-01T00:00:00Z","month":"01","type":"conference","publication_status":"published","date_updated":"2023-02-23T13:15:13Z","oa_version":"Preprint","acknowledgement":"Dan Alistarh - Part of this work was performed while the author was a Postdoctoral Associate at MIT CSAIL, where he was supported by SNF\r\nPostdoctoral Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923, and by grants from the Oracle and Intel corporations.\r\nKeron Censor-Hillel - Shalon Fellow\r\nNir Shavit - This work was supported in part by NSF grants CCF-1217921 and\r\nCCF-1301926, DoE ASCR grant ER26116/DE-SC0008923, and\r\nby grants from the Oracle and Intel corporations.","extern":"1","oa":1,"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"full_name":"Censor Hillel, Keren","first_name":"Keren","last_name":"Censor Hillel"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"}],"day":"01","citation":{"ieee":"D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent algorithms practically wait-free?,” presented at the STOC: Symposium on Theory of Computing, 2014, pp. 714–723.","chicago":"Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock-Free Concurrent Algorithms Practically Wait-Free?,” 714–23. ACM, 2014. <a href=\"https://doi.org/10.1145/2591796.2591836\">https://doi.org/10.1145/2591796.2591836</a>.","short":"D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, ACM, 2014, pp. 714–723.","ama":"Alistarh D-A, Censor Hillel K, Shavit N. Are lock-free concurrent algorithms practically wait-free? In: ACM; 2014:714-723. doi:<a href=\"https://doi.org/10.1145/2591796.2591836\">10.1145/2591796.2591836</a>","apa":"Alistarh, D.-A., Censor Hillel, K., &#38; Shavit, N. (2014). Are lock-free concurrent algorithms practically wait-free? (pp. 714–723). Presented at the STOC: Symposium on Theory of Computing, ACM. <a href=\"https://doi.org/10.1145/2591796.2591836\">https://doi.org/10.1145/2591796.2591836</a>","mla":"Alistarh, Dan-Adrian, et al. <i>Are Lock-Free Concurrent Algorithms Practically Wait-Free?</i> ACM, 2014, pp. 714–23, doi:<a href=\"https://doi.org/10.1145/2591796.2591836\">10.1145/2591796.2591836</a>.","ista":"Alistarh D-A, Censor Hillel K, Shavit N. 2014. Are lock-free concurrent algorithms practically wait-free? STOC: Symposium on Theory of Computing, 714–723."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"772","status":"public","external_id":{"arxiv":["1311.3200"]},"abstract":[{"lang":"eng","text":"Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most non-blocking commercial code is only lock-free. This paper suggests a simple solution to this problem. We show that, for a large class of lock-free algorithms, under scheduling conditions which approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can keep on designing simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes with the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1, but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. To the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst case adversary, in a stochastic model capturing their expected asymptotic behavior."}],"publist_id":"6885","doi":"10.1145/2591796.2591836"},{"date_created":"2018-12-11T11:48:26Z","page":"348 - 357","main_file_link":[{"url":"https://arxiv.org/abs/1405.5461","open_access":"1"}],"year":"2014","article_processing_charge":"No","arxiv":1,"language":[{"iso":"eng"}],"conference":{"name":"ICDCS: International Conference on Distributed Computing Systems"},"publisher":"IEEE","title":"The levelarray: A fast, practical long-lived renaming algorithm","date_published":"2014-08-29T00:00:00Z","month":"08","type":"conference","oa_version":"Preprint","publication_status":"published","date_updated":"2023-02-23T13:16:18Z","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Matveev","first_name":"Alexander","full_name":"Matveev, Alexander"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"oa":1,"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","citation":{"apa":"Alistarh, D.-A., Kopinsky, J., Matveev, A., &#38; Shavit, N. (2014). The levelarray: A fast, practical long-lived renaming algorithm (pp. 348–357). Presented at the ICDCS: International Conference on Distributed Computing Systems, IEEE. <a href=\"https://doi.org/10.1109/ICDCS.2014.43\">https://doi.org/10.1109/ICDCS.2014.43</a>","mla":"Alistarh, Dan-Adrian, et al. <i>The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm</i>. IEEE, 2014, pp. 348–57, doi:<a href=\"https://doi.org/10.1109/ICDCS.2014.43\">10.1109/ICDCS.2014.43</a>.","ista":"Alistarh D-A, Kopinsky J, Matveev A, Shavit N. 2014. The levelarray: A fast, practical long-lived renaming algorithm. ICDCS: International Conference on Distributed Computing Systems, 348–357.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Alexander Matveev, and Nir Shavit. “The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm,” 348–57. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICDCS.2014.43\">https://doi.org/10.1109/ICDCS.2014.43</a>.","ama":"Alistarh D-A, Kopinsky J, Matveev A, Shavit N. The levelarray: A fast, practical long-lived renaming algorithm. In: IEEE; 2014:348-357. doi:<a href=\"https://doi.org/10.1109/ICDCS.2014.43\">10.1109/ICDCS.2014.43</a>","short":"D.-A. Alistarh, J. Kopinsky, A. Matveev, N. Shavit, in:, IEEE, 2014, pp. 348–357.","ieee":"D.-A. Alistarh, J. Kopinsky, A. Matveev, and N. Shavit, “The levelarray: A fast, practical long-lived renaming algorithm,” presented at the ICDCS: International Conference on Distributed Computing Systems, 2014, pp. 348–357."},"_id":"775","status":"public","external_id":{"arxiv":["1405.5461"]},"doi":"10.1109/ICDCS.2014.43","abstract":[{"text":"The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of transactional memory, flat combining, thread barriers, and memory reclamation schemes for lock-free data structures. In this paper, we analyze a randomized solution for long-lived renaming. The algorithmic technique we consider, called the Level Array, has previously been used for hashing and one-shot (single-use) renaming. Our main contribution is to prove that, in long-lived executions, where processes may register and deregister polynomially many times, the technique guarantees constant steps on average and O (log log n) steps with high probability for registering, unit cost for deregistering, and O (n) steps for collect queries, where n is an upper bound on the number of processes that may be active at any point in time. We also show that the algorithm has the surprising property that it is self-healing: under reasonable assumptions on the schedule, operations running while the data structure is in a degraded state implicitly help the data structure re-balance itself. This subtle mechanism obviates the need for expensive periodic rebuilding procedures. Our benchmarks validate this approach, showing that, for typical use parameters, the average number of steps a process takes to register is less than two and the worst-case number of steps is bounded by six, even in executions with billions of operations. We contrast this with other randomized implementations, whose worst-case behavior we show to be unreliable, and with deterministic implementations, whose cost is linear in n.","lang":"eng"}],"publist_id":"6883"},{"status":"public","publist_id":"7352","abstract":[{"lang":"eng","text":"Invasive alien parasites and pathogens are a growing threat to biodiversity worldwide, which can contribute to the extinction of endemic species. On the Galápagos Islands, the invasive parasitic fly Philornis downsi poses a major threat to the endemic avifauna. Here, we investigated the influence of this parasite on the breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea) and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island in 2010 and 2012. While the population of the small tree finch appeared to be stable, the warbler finch has experienced a dramatic decline in population size on Santa Cruz Island since 1997. We aimed to identify whether warbler finches are particularly vulnerable during different stages of the breeding cycle. Contrary to our prediction, breeding success was lower in the small tree finch than in the warbler finch. In both species P. downsi had a strong negative impact on breeding success and our data suggest that heavy rain events also lowered the fledging success. On the one hand parents might be less efficient in compensating their chicks' energy loss due to parasitism as they might be less efficient in foraging on days of heavy rain. On the other hand, intense rainfalls might lead to increased humidity and more rapid cooling of the nests. In the case of the warbler finch we found that the control of invasive plant species with herbicides had a significant additive negative impact on the breeding success. It is very likely that the availability of insects (i.e. food abundance) is lower in such controlled areas, as herbicide usage led to the removal of the entire understory. Predation seems to be a minor factor in brood loss."}],"doi":"10.1371/journal.pone.0107518","issue":"9","month":"09","day":"23","publication_status":"published","acknowledgement":"The study was funded by the University of Vienna (Focus of Excellence grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V.","publisher":"Public Library of Science","intvolume":"         9","article_number":"0107518","language":[{"iso":"eng"}],"_id":"468","scopus_import":1,"file_date_updated":"2020-07-14T12:46:34Z","type":"journal_article","pubrep_id":"954","author":[{"first_name":"Arno","full_name":"Cimadom, Arno","last_name":"Cimadom"},{"full_name":"Ulloa, Angel","first_name":"Angel","last_name":"Ulloa"},{"last_name":"Meidl","full_name":"Meidl, Patrick","first_name":"Patrick","id":"4709BCE6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zöttl","first_name":"Markus","full_name":"Zöttl, Markus"},{"full_name":"Zöttl, Elisabet","first_name":"Elisabet","last_name":"Zöttl"},{"first_name":"Birgit","full_name":"Fessl, Birgit","last_name":"Fessl"},{"full_name":"Nemeth, Erwin","first_name":"Erwin","last_name":"Nemeth"},{"last_name":"Dvorak","full_name":"Dvorak, Michael","first_name":"Michael"},{"full_name":"Cunninghame, Francesca","first_name":"Francesca","last_name":"Cunninghame"},{"first_name":"Sabine","full_name":"Tebbich, Sabine","last_name":"Tebbich"}],"oa":1,"has_accepted_license":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth, M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014).","ama":"Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. <i>PLoS One</i>. 2014;9(9). doi:<a href=\"https://doi.org/10.1371/journal.pone.0107518\">10.1371/journal.pone.0107518</a>","chicago":"Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl, Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0107518\">https://doi.org/10.1371/journal.pone.0107518</a>.","ieee":"A. Cimadom <i>et al.</i>, “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” <i>PLoS One</i>, vol. 9, no. 9. Public Library of Science, 2014.","ista":"Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M, Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518.","apa":"Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich, S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0107518\">https://doi.org/10.1371/journal.pone.0107518</a>","mla":"Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding Success in Darwin’s Finches.” <i>PLoS One</i>, vol. 9, no. 9, 0107518, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0107518\">10.1371/journal.pone.0107518</a>."},"file":[{"creator":"system","checksum":"b24e7518ccd41effed0d7d9e2498f67f","relation":"main_file","file_id":"5103","date_created":"2018-12-12T10:14:48Z","access_level":"open_access","date_updated":"2020-07-14T12:46:34Z","content_type":"application/pdf","file_size":489387,"file_name":"IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF"}],"department":[{"_id":"CampIT"}],"oa_version":"Published Version","date_updated":"2021-01-12T08:00:48Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","title":"Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches","date_published":"2014-09-23T00:00:00Z","date_created":"2018-12-11T11:46:38Z","ddc":["576"],"volume":9,"publication":"PLoS One","year":"2014"},{"quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"date_published":"2014-04-01T00:00:00Z","title":"First cycle games","conference":{"name":"SR: Strategic Reasoning","start_date":"2014-04-05","location":"Grenoble, France","end_date":"2014-04-06"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","volume":146,"year":"2014","ddc":["004"],"date_created":"2018-12-11T11:46:41Z","file_date_updated":"2020-07-14T12:46:35Z","scopus_import":1,"_id":"475","has_accepted_license":"1","citation":{"ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>.","apa":"Aminof, B., &#38; Rubin, S. (2014). First cycle games. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","ama":"Aminof B, Rubin S. First cycle games. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 146. Open Publishing Association; 2014:83-90. doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 146:83–90. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>.","ieee":"B. Aminof and S. Rubin, “First cycle games,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Grenoble, France, 2014, vol. 146, pp. 83–90."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Benjamin","full_name":"Aminof, Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","last_name":"Aminof"},{"full_name":"Rubin, Sasha","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin"}],"oa":1,"date_updated":"2021-01-12T08:00:53Z","oa_version":"Published Version","department":[{"_id":"KrCh"}],"file":[{"date_created":"2018-12-12T10:17:08Z","file_id":"5260","access_level":"open_access","file_size":100115,"date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","creator":"system","relation":"main_file","checksum":"4d7b4ab82980cca2b96ac7703992a8c8"}],"type":"conference","pubrep_id":"952","publisher":"Open Publishing Association","language":[{"iso":"eng"}],"page":"83 - 90","intvolume":"       146","publist_id":"7345","doi":"10.4204/EPTCS.146.11","abstract":[{"text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. ","lang":"eng"}],"status":"public","day":"01","ec_funded":1,"publication_status":"published","month":"04","alternative_title":["EPTCS"]},{"doi":"10.1007/s00453-013-9843-7","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help."}],"publist_id":"7282","issue":"3","status":"public","ec_funded":1,"day":"01","publication_status":"published","related_material":{"record":[{"status":"public","id":"10905","relation":"earlier_version"}]},"month":"11","publisher":"Springer","arxiv":1,"language":[{"iso":"eng"}],"page":"457 - 492","article_type":"original","intvolume":"        70","scopus_import":"1","external_id":{"arxiv":["1604.08234"]},"_id":"535","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"citation":{"ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” <i>Algorithmica</i>, vol. 70, no. 3. Springer, pp. 457–492, 2014.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. 2014;70(3):457-492. doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","department":[{"_id":"KrCh"}],"date_updated":"2023-09-05T14:09:29Z","oa_version":"Preprint","type":"journal_article","quality_controlled":"1","date_published":"2014-11-01T00:00:00Z","title":"Polynomial-time algorithms for energy games with special weight structures","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":70,"article_processing_charge":"No","publication":"Algorithmica","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"year":"2014","date_created":"2018-12-11T11:47:01Z"},{"doi":"10.1002/ece3.1150","publist_id":"7280","abstract":[{"lang":"eng","text":"Transgenerational effects are broader than only parental relationships. Despite mounting evidence that multigenerational effects alter phenotypic and life-history traits, our understanding of how they combine to determine fitness is not well developed because of the added complexity necessary to study them. Here, we derive a quantitative genetic model of adaptation to an extraordinary new environment by an additive genetic component, phenotypic plasticity, maternal and grandmaternal effects. We show how, at equilibrium, negative maternal and negative grandmaternal effects maximize expected population mean fitness. We define negative transgenerational effects as those that have a negative effect on trait expression in the subsequent generation, that is, they slow, or potentially reverse, the expected evolutionary dynamic. When maternal effects are positive, negative grandmaternal effects are preferred. As expected under Mendelian inheritance, the grandmaternal effects have a lower impact on fitness than the maternal effects, but this dual inheritance model predicts a more complex relationship between maternal and grandmaternal effects to constrain phenotypic variance and so maximize expected population mean fitness in the offspring."}],"issue":"15","status":"public","day":"19","publication_status":"published","month":"07","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"page":"3139 - 3145","intvolume":"         4","file_date_updated":"2020-07-14T12:46:38Z","scopus_import":1,"_id":"537","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” <i>Ecology and Evolution</i>, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.","short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.","ama":"Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. 2014;4(15):3139-3145. doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>","chicago":"Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>.","ista":"Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal effects. Ecology and Evolution. 4(15), 3139–3145.","mla":"Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal Effects.” <i>Ecology and Evolution</i>, vol. 4, no. 15, Wiley-Blackwell, 2014, pp. 3139–45, doi:<a href=\"https://doi.org/10.1002/ece3.1150\">10.1002/ece3.1150</a>.","apa":"Prizak, R., Ezard, T., &#38; Hoyle, R. (2014). Fitness consequences of maternal and grandmaternal effects. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.1150\">https://doi.org/10.1002/ece3.1150</a>"},"author":[{"first_name":"Roshan","id":"4456104E-F248-11E8-B48F-1D18A9856A87","full_name":"Prizak, Roshan","last_name":"Prizak"},{"last_name":"Ezard","full_name":"Ezard, Thomas","first_name":"Thomas"},{"full_name":"Hoyle, Rebecca","first_name":"Rebecca","last_name":"Hoyle"}],"oa":1,"date_updated":"2021-01-12T08:01:30Z","oa_version":"Published Version","file":[{"relation":"main_file","checksum":"e32abf75a248e7a11811fd7f60858769","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:11:31Z","file_id":"4886","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf","file_size":621582,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:38Z"}],"department":[{"_id":"NiBa"},{"_id":"GaTk"}],"type":"journal_article","pubrep_id":"934","title":"Fitness consequences of maternal and grandmaternal effects","date_published":"2014-07-19T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"Ecology and Evolution","volume":4,"year":"2014","ddc":["530","571"],"date_created":"2018-12-11T11:47:02Z"},{"year":"2014","language":[{"iso":"eng"}],"date_created":"2018-12-12T11:39:11Z","ddc":["000"],"page":"20","date_published":"2014-01-28T00:00:00Z","title":"Compositional specifications for IOCO testing","publisher":"IST Austria","file":[{"access_level":"open_access","file_id":"5543","date_created":"2018-12-12T11:54:21Z","file_name":"IST-2014-148-v2+1_main_tr.pdf","date_updated":"2020-07-14T12:46:46Z","content_type":"application/pdf","file_size":534732,"checksum":"0e03aba625cc334141a3148432aa5760","relation":"main_file","creator":"system"}],"department":[{"_id":"ToHe"}],"publication_status":"published","oa_version":"Published Version","date_updated":"2023-02-23T10:31:07Z","oa":1,"author":[{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Willibald","full_name":"Krenn, Willibald","last_name":"Krenn"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"citation":{"ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. <i>Compositional Specifications for IOCO Testing</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, <i>Compositional specifications for IOCO testing</i>. IST Austria, 2014.","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.","mla":"Daca, Przemyslaw, et al. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>.","apa":"Daca, P., Henzinger, T. A., Krenn, W., &#38; Nickovic, D. (2014). <i>Compositional specifications for IOCO testing</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>"},"day":"28","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"152","alternative_title":["IST Austria Technical Report"],"related_material":{"record":[{"id":"2167","relation":"later_version","status":"public"}]},"month":"01","type":"technical_report","abstract":[{"text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:46Z","doi":"10.15479/AT:IST-2014-148-v2-1","_id":"5411","status":"public","publication_identifier":{"issn":["2664-1690"]}},{"department":[{"_id":"KrCh"}],"file":[{"creator":"system","relation":"main_file","checksum":"4d6cda4bebed970926403ad6ad8c745f","file_size":423322,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:47Z","file_name":"IST-2014-153-v1+1_main.pdf","date_created":"2018-12-12T11:53:39Z","file_id":"5500","access_level":"open_access"}],"publication_status":"published","oa_version":"Published Version","date_updated":"2023-02-23T12:25:18Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"}],"oa":1,"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>."},"day":"29","alternative_title":["IST Austria Technical Report"],"pubrep_id":"153","related_material":{"record":[{"status":"public","relation":"later_version","id":"2063"},{"status":"public","relation":"later_version","id":"5413"},{"status":"public","relation":"later_version","id":"5414"}]},"month":"01","type":"technical_report","doi":"10.15479/AT:IST-2014-153-v1-1","file_date_updated":"2020-07-14T12:46:47Z","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"_id":"5412","status":"public","publication_identifier":{"issn":["2664-1690"]},"year":"2014","language":[{"iso":"eng"}],"date_created":"2018-12-12T11:39:11Z","ddc":["000"],"page":"31","date_published":"2014-01-29T00:00:00Z","title":"CEGAR for qualitative analysis of probabilistic systems","publisher":"IST Austria"},{"language":[{"iso":"eng"}],"year":"2014","page":"33","ddc":["000"],"date_created":"2018-12-12T11:39:11Z","date_published":"2014-02-06T00:00:00Z","title":"CEGAR for qualitative analysis of probabilistic systems","publisher":"IST Austria","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>"},"day":"06","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca"},{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"}],"oa":1,"publication_status":"published","oa_version":"Published Version","date_updated":"2023-02-23T12:25:18Z","department":[{"_id":"KrCh"}],"file":[{"creator":"system","relation":"main_file","checksum":"ce4967a184d84863eec76c66cbac1614","date_created":"2018-12-12T11:54:17Z","file_id":"5539","access_level":"open_access","file_size":606049,"date_updated":"2020-07-14T12:46:47Z","content_type":"application/pdf","file_name":"IST-2014-153-v2+2_main.pdf"}],"type":"technical_report","month":"02","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"status":"public","id":"5412","relation":"earlier_version"},{"relation":"later_version","id":"5414","status":"public"}]},"alternative_title":["IST Austria Technical Report"],"pubrep_id":"164","doi":"10.15479/AT:IST-2014-153-v2-2","file_date_updated":"2020-07-14T12:46:47Z","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"status":"public","_id":"5413"},{"page":"33","date_created":"2018-12-12T11:39:12Z","ddc":["000"],"language":[{"iso":"eng"}],"year":"2014","publisher":"IST Austria","title":"CEGAR for qualitative analysis of probabilistic systems","date_published":"2014-02-07T00:00:00Z","month":"02","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"relation":"earlier_version","id":"5412","status":"public"},{"status":"public","relation":"earlier_version","id":"5413"}]},"type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"165","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"day":"07","has_accepted_license":"1","citation":{"ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T11:53:03Z","file_id":"5464","access_level":"open_access","file_size":606227,"date_updated":"2020-07-14T12:46:48Z","content_type":"application/pdf","file_name":"IST-2014-153-v3+1_main.pdf","creator":"system","relation":"main_file","checksum":"87b93fe9af71fc5c94b0eb6151537e11"}],"department":[{"_id":"KrCh"}],"publication_status":"published","oa_version":"Published Version","date_updated":"2023-02-23T12:25:15Z","publication_identifier":{"issn":["2664-1690"]},"_id":"5414","status":"public","file_date_updated":"2020-07-14T12:46:48Z","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"doi":"10.15479/AT:IST-2014-153-v3-1"},{"oa_version":"Published Version","publication_status":"published","date_updated":"2023-02-23T12:26:19Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"creator":"system","relation":"main_file","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","file_size":573457,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:48Z","file_name":"IST-2014-170-v1+1_main.pdf","date_created":"2018-12-12T11:53:36Z","file_id":"5497","access_level":"open_access"}],"day":"19","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2014). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2014.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>."},"has_accepted_license":"1","oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"pubrep_id":"170","alternative_title":["IST Austria Technical Report"],"type":"technical_report","month":"02","related_material":{"record":[{"relation":"later_version","id":"1656","status":"public"},{"relation":"later_version","id":"467","status":"public"},{"id":"5436","relation":"later_version","status":"public"}]},"doi":"10.15479/AT:IST-2014-170-v1-1","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains.  "}],"file_date_updated":"2020-07-14T12:46:48Z","status":"public","_id":"5415","publication_identifier":{"issn":["2664-1690"]},"year":"2014","language":[{"iso":"eng"}],"ddc":["004"],"date_created":"2018-12-12T11:39:12Z","page":"27","title":"Nested weighted automata","date_published":"2014-02-19T00:00:00Z","publisher":"IST Austria"},{"publication_identifier":{"issn":["2664-1690"]},"_id":"5416","status":"public","doi":"10.15479/AT:IST-2014-171-v1-1","abstract":[{"lang":"eng","text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem."}],"file_date_updated":"2020-07-14T12:46:49Z","related_material":{"record":[{"status":"public","id":"2217","relation":"later_version"}]},"month":"02","type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"171","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"oa":1,"day":"19","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"ieee":"T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST Austria, 2014.","ama":"Henzinger TA, Otop J. <i>Model Measuring for Hybrid Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","chicago":"Henzinger, Thomas A, and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","apa":"Henzinger, T. A., &#38; Otop, J. (2014). <i>Model measuring for hybrid systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>","mla":"Henzinger, Thomas A., and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>."},"department":[{"_id":"ToHe"}],"file":[{"creator":"system","relation":"main_file","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_size":712077,"date_updated":"2020-07-14T12:46:49Z","content_type":"application/pdf","file_name":"IST-2014-171-v1+1_report.pdf","date_created":"2018-12-12T11:53:32Z","file_id":"5492","access_level":"open_access"}],"publication_status":"published","date_updated":"2023-02-23T10:33:21Z","oa_version":"Published Version","publisher":"IST Austria","title":"Model measuring for hybrid systems","date_published":"2014-02-19T00:00:00Z","page":"22","date_created":"2018-12-12T11:39:12Z","ddc":["005"],"language":[{"iso":"eng"}],"year":"2014"},{"status":"public","_id":"5417","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M'within distance ρ from M satisfy (or violate)φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata.\r\nThe model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification.\r\nWe show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.\r\nWe use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. \r\nWe give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:49Z","doi":"10.15479/AT:IST-2014-172-v1-1","pubrep_id":"175","alternative_title":["IST Austria Technical Report"],"type":"technical_report","related_material":{"record":[{"status":"public","relation":"later_version","id":"2327"}]},"month":"02","publication_status":"published","date_updated":"2023-02-23T10:38:10Z","oa_version":"Published Version","department":[{"_id":"ToHe"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:49Z","file_size":383052,"file_name":"IST-2014-172-v1+1_report.pdf","file_id":"5481","date_created":"2018-12-12T11:53:20Z","access_level":"open_access","creator":"system","checksum":"fcc3eab903cfcd3778b338d2d0d44d18","relation":"main_file"}],"day":"19","citation":{"ieee":"T. A. Henzinger and J. Otop, <i>From model checking to model measuring</i>. IST Austria, 2014.","chicago":"Henzinger, Thomas A, and Jan Otop. <i>From Model Checking to Model Measuring</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">https://doi.org/10.15479/AT:IST-2014-172-v1-1</a>.","ama":"Henzinger TA, Otop J. <i>From Model Checking to Model Measuring</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">10.15479/AT:IST-2014-172-v1-1</a>","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.","apa":"Henzinger, T. A., &#38; Otop, J. (2014). <i>From model checking to model measuring</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">https://doi.org/10.15479/AT:IST-2014-172-v1-1</a>","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">10.15479/AT:IST-2014-172-v1-1</a>.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa":1,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publisher":"IST Austria","title":"From model checking to model measuring","date_published":"2014-02-19T00:00:00Z","ddc":["000"],"date_created":"2018-12-12T11:39:13Z","page":"14","year":"2014","language":[{"iso":"eng"}]},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"2163"}]},"month":"03","type":"technical_report","pubrep_id":"176","alternative_title":["IST Austria Technical Report"],"oa":1,"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"citation":{"ieee":"K. Chatterjee and L. Doyen, <i>Games with a weak adversary</i>. IST Austria, 2014.","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","ama":"Chatterjee K, Doyen L. <i>Games with a Weak Adversary</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). <i>Games with a weak adversary</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>."},"has_accepted_license":"1","day":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_id":"5468","date_created":"2018-12-12T11:53:07Z","file_name":"IST-2014-176-v1+1_icalp_14.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:49Z","file_size":328253,"checksum":"1d6958aa60050e1c3e932c6e5f34c39f","relation":"main_file","creator":"system"}],"department":[{"_id":"KrCh"}],"publication_status":"published","oa_version":"Published Version","date_updated":"2023-02-23T10:30:58Z","publication_identifier":{"issn":["2664-1690"]},"_id":"5418","status":"public","file_date_updated":"2020-07-14T12:46:49Z","doi":"10.15479/AT:IST-2014-176-v1-1","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. Our results have tight connections with partial-observation stochastic games for which we derive new complexity results.","lang":"eng"}],"page":"18","date_created":"2018-12-12T11:39:13Z","ddc":["000","005"],"language":[{"iso":"eng"}],"year":"2014","publisher":"IST Austria","date_published":"2014-03-22T00:00:00Z","title":"Games with a weak adversary"},{"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Improved algorithms for reachability and shortest path on low tree-width graphs</i>. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">https://doi.org/10.15479/AT:IST-2014-187-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">10.15479/AT:IST-2014-187-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">10.15479/AT:IST-2014-187-v1-1</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2014). <i>Improved algorithms for reachability and shortest path on low tree-width graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">https://doi.org/10.15479/AT:IST-2014-187-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p."},"day":"14","department":[{"_id":"KrCh"}],"file":[{"creator":"system","relation":"main_file","checksum":"c608e66030a4bf51d2d99b451f539b99","date_created":"2018-12-12T11:54:25Z","file_id":"5548","access_level":"open_access","file_size":670031,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:50Z","file_name":"IST-2014-187-v1+1_main_full_tech.pdf"}],"date_updated":"2021-01-12T08:02:03Z","publication_status":"published","oa_version":"Published Version","month":"04","type":"technical_report","pubrep_id":"187","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2014-187-v1-1","abstract":[{"text":"We consider the reachability and shortest path problems on low tree-width graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize W. We use O to hide polynomial factors of the inverse of the Ackermann function. Our main contributions are three fold:\r\n1. For reachability, we present an algorithm that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space, and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries. Note that for constant t our algorithm uses O(n·logn) time for preprocessing; and O(n/W) time for single-source queries, which is faster than depth first search/breath first search (after the preprocessing).\r\n2. We present an algorithm for shortest path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus query time trade-off algorithm for shortest path that, given any constant >0, requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair queries.\r\nOur algorithms improve all existing results, and use very simple data structures.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:50Z","publication_identifier":{"issn":["2664-1690"]},"_id":"5419","status":"public","language":[{"iso":"eng"}],"year":"2014","page":"34","date_created":"2018-12-12T11:39:13Z","ddc":["000"],"title":"Improved algorithms for reachability and shortest path on low tree-width graphs","date_published":"2014-04-14T00:00:00Z","publisher":"IST Austria"},{"publication_identifier":{"issn":["2664-1690"]},"status":"public","_id":"5420","doi":"10.15479/AT:IST-2014-191-v1-1","abstract":[{"text":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy).","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:50Z","type":"technical_report","month":"04","pubrep_id":"191","alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"14","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">10.15479/AT:IST-2014-191-v1-1</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). <i>The value 1 problem for concurrent mean-payoff games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">https://doi.org/10.15479/AT:IST-2014-191-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.","ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>The value 1 problem for concurrent mean-payoff games</i>. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">https://doi.org/10.15479/AT:IST-2014-191-v1-1</a>.","ama":"Chatterjee K, Ibsen-Jensen R. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">10.15479/AT:IST-2014-191-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014."},"has_accepted_license":"1","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"oa":1,"oa_version":"Published Version","publication_status":"published","date_updated":"2021-01-12T08:02:05Z","department":[{"_id":"KrCh"}],"file":[{"file_name":"IST-2014-191-v1+1_main_full.pdf","file_size":584368,"date_updated":"2020-07-14T12:46:50Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T11:53:58Z","file_id":"5520","relation":"main_file","checksum":"49e0fd3e62650346daf7dc04604f7a0a","creator":"system"}],"publisher":"IST Austria","date_published":"2014-04-14T00:00:00Z","title":"The value 1 problem for concurrent mean-payoff games","page":"49","ddc":["000","005"],"date_created":"2018-12-12T11:39:14Z","language":[{"iso":"eng"}],"year":"2014"}]