[{"date_updated":"2025-09-29T12:09:47Z","day":"05","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"publisher":"Cell Press","citation":{"ieee":"P. Marhavý <i>et al.</i>, “Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral root organogenesis,” <i>Current Biology</i>, vol. 24, no. 9. Cell Press, pp. 1031–1037, 2014.","mla":"Marhavý, Peter, et al. “Cytokinin Controls Polarity of PIN1-Dependent Auxin Transport during Lateral Root Organogenesis.” <i>Current Biology</i>, vol. 24, no. 9, Cell Press, 2014, pp. 1031–37, doi:<a href=\"https://doi.org/10.1016/j.cub.2014.04.002\">10.1016/j.cub.2014.04.002</a>.","apa":"Marhavý, P., Duclercq, J., Weller, B., Feraru, E., Bielach, A., Offringa, R., … Benková, E. (2014). Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral root organogenesis. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2014.04.002\">https://doi.org/10.1016/j.cub.2014.04.002</a>","ama":"Marhavý P, Duclercq J, Weller B, et al. Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral root organogenesis. <i>Current Biology</i>. 2014;24(9):1031-1037. doi:<a href=\"https://doi.org/10.1016/j.cub.2014.04.002\">10.1016/j.cub.2014.04.002</a>","chicago":"Marhavý, Peter, Jérôme Duclercq, Benjamin Weller, Elena Feraru, Agnieszka Bielach, Remko Offringa, Jiří Friml, Claus Schwechheimer, Angus Murphy, and Eva Benková. “Cytokinin Controls Polarity of PIN1-Dependent Auxin Transport during Lateral Root Organogenesis.” <i>Current Biology</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.cub.2014.04.002\">https://doi.org/10.1016/j.cub.2014.04.002</a>.","ista":"Marhavý P, Duclercq J, Weller B, Feraru E, Bielach A, Offringa R, Friml J, Schwechheimer C, Murphy A, Benková E. 2014. Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral root organogenesis. Current Biology. 24(9), 1031–1037.","short":"P. Marhavý, J. Duclercq, B. Weller, E. Feraru, A. Bielach, R. Offringa, J. Friml, C. Schwechheimer, A. Murphy, E. Benková, Current Biology 24 (2014) 1031–1037."},"publication":"Current Biology","_id":"1934","title":"Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral root organogenesis","article_processing_charge":"No","type":"journal_article","ec_funded":1,"status":"public","quality_controlled":"1","doi":"10.1016/j.cub.2014.04.002","page":"1031 - 1037","oa_version":"None","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":24,"month":"05","abstract":[{"text":"The plant hormones auxin and cytokinin mutually coordinate their activities to control various aspects of development [1-9], and their crosstalk occurs at multiple levels [10, 11]. Cytokinin-mediated modulation of auxin transport provides an efficient means to regulate auxin distribution in plant organs. Here, we demonstrate that cytokinin does not merely control the overall auxin flow capacity, but might also act as a polarizing cue and control the auxin stream directionality during plant organogenesis. Cytokinin enhances the PIN-FORMED1 (PIN1) auxin transporter depletion at specific polar domains, thus rearranging the cellular PIN polarities and directly regulating the auxin flow direction. This selective cytokinin sensitivity correlates with the PIN protein phosphorylation degree. PIN1 phosphomimicking mutations, as well as enhanced phosphorylation in plants with modulated activities of PIN-specific kinases and phosphatases, desensitize PIN1 to cytokinin. Our results reveal conceptually novel, cytokinin-driven polarization mechanism that operates in developmental processes involving rapid auxin stream redirection, such as lateral root organogenesis, in which a gradual PIN polarity switch defines the growth axis of the newly formed organ.","lang":"eng"}],"intvolume":"        24","language":[{"iso":"eng"}],"isi":1,"issue":"9","date_created":"2018-12-11T11:54:48Z","publist_id":"5160","year":"2014","date_published":"2014-05-05T00:00:00Z","author":[{"first_name":"Peter","last_name":"Marhavy","full_name":"Marhavy, Peter","orcid":"0000-0001-5227-5741","id":"3F45B078-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Duclercq","first_name":"Jérôme","full_name":"Duclercq, Jérôme"},{"first_name":"Benjamin","last_name":"Weller","full_name":"Weller, Benjamin"},{"first_name":"Elena","last_name":"Feraru","full_name":"Feraru, Elena"},{"first_name":"Agnieszka","last_name":"Bielach","full_name":"Bielach, Agnieszka"},{"first_name":"Remko","last_name":"Offringa","full_name":"Offringa, Remko"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"},{"full_name":"Schwechheimer, Claus","last_name":"Schwechheimer","first_name":"Claus"},{"last_name":"Murphy","first_name":"Angus","full_name":"Murphy, Angus"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"}],"publication_status":"published","corr_author":"1","external_id":{"isi":["000335542300029"]},"project":[{"_id":"253FCA6A-B435-11E9-9278-68D0E5697425","grant_number":"207362","call_identifier":"FP7","name":"Hormonal cross-talk in plant organogenesis"}]},{"date_updated":"2025-09-29T12:08:54Z","day":"01","has_accepted_license":"1","publication":"Communications in Mathematical Physics","citation":{"short":"A. Giuliani, É. Lieb, R. Seiringer, Communications in Mathematical Physics 331 (2014) 333–350.","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Formation of Stripes and Slabs near the Ferromagnetic Transition.” <i>Communications in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00220-014-1923-2\">https://doi.org/10.1007/s00220-014-1923-2</a>.","ista":"Giuliani A, Lieb É, Seiringer R. 2014. Formation of stripes and slabs near the ferromagnetic transition. Communications in Mathematical Physics. 331, 333–350.","ama":"Giuliani A, Lieb É, Seiringer R. Formation of stripes and slabs near the ferromagnetic transition. <i>Communications in Mathematical Physics</i>. 2014;331:333-350. doi:<a href=\"https://doi.org/10.1007/s00220-014-1923-2\">10.1007/s00220-014-1923-2</a>","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Formation of stripes and slabs near the ferromagnetic transition,” <i>Communications in Mathematical Physics</i>, vol. 331. Springer, pp. 333–350, 2014.","mla":"Giuliani, Alessandro, et al. “Formation of Stripes and Slabs near the Ferromagnetic Transition.” <i>Communications in Mathematical Physics</i>, vol. 331, Springer, 2014, pp. 333–50, doi:<a href=\"https://doi.org/10.1007/s00220-014-1923-2\">10.1007/s00220-014-1923-2</a>.","apa":"Giuliani, A., Lieb, É., &#38; Seiringer, R. (2014). Formation of stripes and slabs near the ferromagnetic transition. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-1923-2\">https://doi.org/10.1007/s00220-014-1923-2</a>"},"file":[{"checksum":"c8423271cd1e1ba9e44c47af75efe7b6","file_id":"11409","success":1,"date_updated":"2022-05-24T08:30:40Z","file_name":"2014_CommMathPhysics_Giuliani.pdf","access_level":"open_access","date_created":"2022-05-24T08:30:40Z","relation":"main_file","file_size":334064,"content_type":"application/pdf","creator":"dernst"}],"publisher":"Springer","department":[{"_id":"RoSe"}],"_id":"1935","title":"Formation of stripes and slabs near the ferromagnetic transition","ddc":["510"],"type":"journal_article","article_processing_charge":"No","arxiv":1,"doi":"10.1007/s00220-014-1923-2","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"quality_controlled":"1","status":"public","scopus_import":"1","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"333 - 350","volume":331,"abstract":[{"text":"We consider Ising models in d = 2 and d = 3 dimensions with nearest neighbor ferromagnetic and long-range antiferromagnetic interactions, the latter decaying as (distance)-p, p &gt; 2d, at large distances. If the strength J of the ferromagnetic interaction is larger than a critical value J c, then the ground state is homogeneous. It has been conjectured that when J is smaller than but close to J c, the ground state is periodic and striped, with stripes of constant width h = h(J), and h → ∞ as J → Jc -. (In d = 3 stripes mean slabs, not columns.) Here we rigorously prove that, if we normalize the energy in such a way that the energy of the homogeneous state is zero, then the ratio e 0(J)/e S(J) tends to 1 as J → Jc -, with e S(J) being the energy per site of the optimal periodic striped/slabbed state and e 0(J) the actual ground state energy per site of the system. Our proof comes with explicit bounds on the difference e 0(J)-e S(J) at small but positive J c-J, and also shows that in this parameter range the ground state is striped/slabbed in a certain sense: namely, if one looks at a randomly chosen window, of suitable size ℓ (very large compared to the optimal stripe size h(J)), one finds a striped/slabbed state with high probability.","lang":"eng"}],"month":"10","language":[{"iso":"eng"}],"acknowledgement":"2014 by the authors. This paper may be reproduced, in its entirety, for non-commercial purposes.\r\n\r\nThe research leading to these results has received funding from the European Research\r\nCouncil under the European Union’s Seventh Framework Programme ERC Starting Grant CoMBoS (Grant Agreement No. 239694; A.G. and R.S.), the U.S. National Science Foundation (Grant PHY 0965859; E.H.L.), the Simons Foundation (Grant # 230207; E.H.L) and the NSERC (R.S.). The work is part of a project started in collaboration with Joel Lebowitz, whom we thank for many useful discussions and for his constant encouragement.","oa":1,"isi":1,"intvolume":"       331","date_published":"2014-10-01T00:00:00Z","file_date_updated":"2022-05-24T08:30:40Z","year":"2014","publist_id":"5159","article_type":"original","date_created":"2018-12-11T11:54:48Z","author":[{"full_name":"Giuliani, Alessandro","first_name":"Alessandro","last_name":"Giuliani"},{"full_name":"Lieb, Élliott","last_name":"Lieb","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer"}],"external_id":{"isi":["000339732500011"],"arxiv":["1304.6344"]},"publication_status":"published"},{"publication":"Behavioral Ecology","citation":{"ieee":"M. Arbilly, D. Weissman, M. Feldman, and U. Grodzinski, “An arms race between producers and scroungers can drive the evolution of social cognition,” <i>Behavioral Ecology</i>, vol. 25, no. 3. Oxford University Press, pp. 487–495, 2014.","mla":"Arbilly, Michal, et al. “An Arms Race between Producers and Scroungers Can Drive the Evolution of Social Cognition.” <i>Behavioral Ecology</i>, vol. 25, no. 3, Oxford University Press, 2014, pp. 487–95, doi:<a href=\"https://doi.org/10.1093/beheco/aru002\">10.1093/beheco/aru002</a>.","apa":"Arbilly, M., Weissman, D., Feldman, M., &#38; Grodzinski, U. (2014). An arms race between producers and scroungers can drive the evolution of social cognition. <i>Behavioral Ecology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/beheco/aru002\">https://doi.org/10.1093/beheco/aru002</a>","ama":"Arbilly M, Weissman D, Feldman M, Grodzinski U. An arms race between producers and scroungers can drive the evolution of social cognition. <i>Behavioral Ecology</i>. 2014;25(3):487-495. doi:<a href=\"https://doi.org/10.1093/beheco/aru002\">10.1093/beheco/aru002</a>","chicago":"Arbilly, Michal, Daniel Weissman, Marcus Feldman, and Uri Grodzinski. “An Arms Race between Producers and Scroungers Can Drive the Evolution of Social Cognition.” <i>Behavioral Ecology</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/beheco/aru002\">https://doi.org/10.1093/beheco/aru002</a>.","ista":"Arbilly M, Weissman D, Feldman M, Grodzinski U. 2014. An arms race between producers and scroungers can drive the evolution of social cognition. Behavioral Ecology. 25(3), 487–495.","short":"M. Arbilly, D. Weissman, M. Feldman, U. Grodzinski, Behavioral Ecology 25 (2014) 487–495."},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4014306/","open_access":"1"}],"department":[{"_id":"NiBa"}],"publisher":"Oxford University Press","title":"An arms race between producers and scroungers can drive the evolution of social cognition","_id":"1936","date_updated":"2025-09-29T12:07:50Z","day":"13","doi":"10.1093/beheco/aru002","quality_controlled":"1","status":"public","ec_funded":1,"oa_version":"Submitted Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"487 - 495","type":"journal_article","article_processing_charge":"No","oa":1,"language":[{"iso":"eng"}],"issue":"3","isi":1,"intvolume":"        25","date_published":"2014-02-13T00:00:00Z","publist_id":"5157","year":"2014","date_created":"2018-12-11T11:54:48Z","volume":25,"abstract":[{"text":"The social intelligence hypothesis states that the need to cope with complexities of social life has driven the evolution of advanced cognitive abilities. It is usually invoked in the context of challenges arising from complex intragroup structures, hierarchies, and alliances. However, a fundamental aspect of group living remains largely unexplored as a driving force in cognitive evolution: the competition between individuals searching for resources (producers) and conspecifics that parasitize their findings (scroungers). In populations of social foragers, abilities that enable scroungers to steal by outsmarting producers, and those allowing producers to prevent theft by outsmarting scroungers, are likely to be beneficial and may fuel a cognitive arms race. Using analytical theory and agent-based simulations, we present a general model for such a race that is driven by the producer-scrounger game and show that the race's plausibility is dramatically affected by the nature of the evolving abilities. If scrounging and scrounging avoidance rely on separate, strategy-specific cognitive abilities, arms races are short-lived and have a limited effect on cognition. However, general cognitive abilities that facilitate both scrounging and scrounging avoidance undergo stable, long-lasting arms races. Thus, ubiquitous foraging interactions may lead to the evolution of general cognitive abilities in social animals, without the requirement of complex intragroup structures.","lang":"eng"}],"month":"02","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Arbilly, Michal","last_name":"Arbilly","first_name":"Michal"},{"last_name":"Weissman","first_name":"Daniel","id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","full_name":"Weissman, Daniel"},{"full_name":"Feldman, Marcus","first_name":"Marcus","last_name":"Feldman"},{"last_name":"Grodzinski","first_name":"Uri","full_name":"Grodzinski, Uri"}],"external_id":{"isi":["000336486100012"]},"publication_status":"published"},{"day":"01","date_updated":"2025-09-29T12:08:21Z","_id":"1937","title":"Edge universality of beta ensembles","citation":{"chicago":"Bourgade, Paul, László Erdös, and Horngtzer Yau. “Edge Universality of Beta Ensembles.” <i>Communications in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00220-014-2120-z\">https://doi.org/10.1007/s00220-014-2120-z</a>.","ista":"Bourgade P, Erdös L, Yau H. 2014. Edge universality of beta ensembles. Communications in Mathematical Physics. 332(1), 261–353.","short":"P. Bourgade, L. Erdös, H. Yau, Communications in Mathematical Physics 332 (2014) 261–353.","ieee":"P. Bourgade, L. Erdös, and H. Yau, “Edge universality of beta ensembles,” <i>Communications in Mathematical Physics</i>, vol. 332, no. 1. Springer, pp. 261–353, 2014.","mla":"Bourgade, Paul, et al. “Edge Universality of Beta Ensembles.” <i>Communications in Mathematical Physics</i>, vol. 332, no. 1, Springer, 2014, pp. 261–353, doi:<a href=\"https://doi.org/10.1007/s00220-014-2120-z\">10.1007/s00220-014-2120-z</a>.","apa":"Bourgade, P., Erdös, L., &#38; Yau, H. (2014). Edge universality of beta ensembles. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-2120-z\">https://doi.org/10.1007/s00220-014-2120-z</a>","ama":"Bourgade P, Erdös L, Yau H. Edge universality of beta ensembles. <i>Communications in Mathematical Physics</i>. 2014;332(1):261-353. doi:<a href=\"https://doi.org/10.1007/s00220-014-2120-z\">10.1007/s00220-014-2120-z</a>"},"publication":"Communications in Mathematical Physics","publisher":"Springer","department":[{"_id":"LaEr"}],"main_file_link":[{"url":"http://arxiv.org/abs/1306.5728","open_access":"1"}],"type":"journal_article","article_processing_charge":"No","arxiv":1,"page":"261 - 353","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Submitted Version","quality_controlled":"1","doi":"10.1007/s00220-014-2120-z","status":"public","abstract":[{"text":"We prove the edge universality of the beta ensembles for any β ≥ 1, provided that the limiting spectrum is supported on a single interval, and the external potential is C4 and regular. We also prove that the edge universality holds for generalized Wigner matrices for all symmetry classes. Moreover, our results allow us to extend bulk universality for beta ensembles from analytic potentials to potentials in class C4.","lang":"eng"}],"month":"11","volume":332,"publist_id":"5158","year":"2014","date_published":"2014-11-01T00:00:00Z","date_created":"2018-12-11T11:54:48Z","language":[{"iso":"eng"}],"issue":"1","isi":1,"oa":1,"intvolume":"       332","external_id":{"arxiv":["1306.5728"],"isi":["000341491700007"]},"publication_status":"published","author":[{"full_name":"Bourgade, Paul","last_name":"Bourgade","first_name":"Paul"},{"last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Horngtzer","last_name":"Yau","full_name":"Yau, Horngtzer"}],"project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}]},{"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."}],"month":"09","volume":9,"date_published":"2014-09-23T00:00:00Z","file_date_updated":"2020-07-14T12:46:34Z","year":"2014","publist_id":"7352","date_created":"2018-12-11T11:46:38Z","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.","language":[{"iso":"eng"}],"isi":1,"oa":1,"issue":"9","intvolume":"         9","external_id":{"isi":["000342351800025"]},"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"0107518","pubrep_id":"954","author":[{"last_name":"Cimadom","first_name":"Arno","full_name":"Cimadom, Arno"},{"first_name":"Angel","last_name":"Ulloa","full_name":"Ulloa, Angel"},{"id":"4709BCE6-F248-11E8-B48F-1D18A9856A87","full_name":"Meidl, Patrick","last_name":"Meidl","first_name":"Patrick"},{"full_name":"Zöttl, Markus","last_name":"Zöttl","first_name":"Markus"},{"first_name":"Elisabet","last_name":"Zöttl","full_name":"Zöttl, Elisabet"},{"first_name":"Birgit","last_name":"Fessl","full_name":"Fessl, Birgit"},{"last_name":"Nemeth","first_name":"Erwin","full_name":"Nemeth, Erwin"},{"full_name":"Dvorak, Michael","first_name":"Michael","last_name":"Dvorak"},{"full_name":"Cunninghame, Francesca","first_name":"Francesca","last_name":"Cunninghame"},{"last_name":"Tebbich","first_name":"Sabine","full_name":"Tebbich, Sabine"}],"day":"23","date_updated":"2025-09-29T13:19:35Z","title":"Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin's finches","_id":"468","publication":"PLoS One","has_accepted_license":"1","citation":{"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>","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.","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>.","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>","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).","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>.","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."},"file":[{"checksum":"b24e7518ccd41effed0d7d9e2498f67f","file_id":"5103","date_updated":"2020-07-14T12:46:34Z","file_name":"IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:48Z","content_type":"application/pdf","file_size":489387,"creator":"system"}],"publisher":"Public Library of Science","department":[{"_id":"CampIT"}],"type":"journal_article","article_processing_charge":"No","ddc":["576"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","oa_version":"Published Version","doi":"10.1371/journal.pone.0107518","quality_controlled":"1","status":"public"},{"abstract":[{"lang":"eng","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. "}],"month":"04","volume":146,"date_published":"2014-04-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:35Z","publist_id":"7345","year":"2014","date_created":"2018-12-11T11:46:41Z","oa":1,"language":[{"iso":"eng"}],"intvolume":"       146","external_id":{"arxiv":["1404.0843"]},"corr_author":"1","publication_status":"published","pubrep_id":"952","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"first_name":"Benjamin","last_name":"Aminof","full_name":"Aminof, Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"day":"01","alternative_title":["EPTCS"],"date_updated":"2025-04-14T13:51:05Z","_id":"475","title":"First cycle games","has_accepted_license":"1","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","citation":{"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>","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>","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.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","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>."},"file":[{"content_type":"application/pdf","file_size":100115,"creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:17:08Z","date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","file_id":"5260","checksum":"4d7b4ab82980cca2b96ac7703992a8c8"}],"publisher":"Open Publishing Association","department":[{"_id":"KrCh"}],"type":"conference","arxiv":1,"article_processing_charge":"No","ddc":["004"],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","page":"83 - 90","conference":{"end_date":"2014-04-06","start_date":"2014-04-05","name":"SR: Strategic Reasoning","location":"Grenoble, France"},"doi":"10.4204/EPTCS.146.11","quality_controlled":"1","status":"public","ec_funded":1},{"arxiv":1,"article_processing_charge":"No","type":"journal_article","status":"public","ec_funded":1,"doi":"10.1007/s00453-013-9843-7","quality_controlled":"1","oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","id":"10905","status":"public"}]},"page":"457 - 492","date_updated":"2025-09-29T13:18:38Z","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","publication":"Algorithmica","citation":{"ieee":"K. Chatterjee, M. 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.","apa":"Chatterjee, K., Henzinger, M., 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>","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>.","ama":"Chatterjee K, Henzinger M, 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>","chicago":"Chatterjee, Krishnendu, Monika 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>.","ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492."},"_id":"535","title":"Polynomial-time algorithms for energy games with special weight structures","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"publication_status":"published","external_id":{"isi":["000340552300005"],"arxiv":["1604.08234"]},"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"volume":70,"month":"11","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."}],"intvolume":"        70","language":[{"iso":"eng"}],"oa":1,"issue":"3","isi":1,"date_created":"2018-12-11T11:47:01Z","date_published":"2014-11-01T00:00:00Z","year":"2014","article_type":"original","publist_id":"7282"},{"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pubrep_id":"934","external_id":{"isi":["000340575000015"]},"author":[{"id":"4456104E-F248-11E8-B48F-1D18A9856A87","full_name":"Prizak, Roshan","last_name":"Prizak","first_name":"Roshan"},{"first_name":"Thomas","last_name":"Ezard","full_name":"Ezard, Thomas"},{"full_name":"Hoyle, Rebecca","last_name":"Hoyle","first_name":"Rebecca"}],"month":"07","abstract":[{"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.","lang":"eng"}],"volume":4,"date_created":"2018-12-11T11:47:02Z","file_date_updated":"2020-07-14T12:46:38Z","date_published":"2014-07-19T00:00:00Z","year":"2014","publist_id":"7280","intvolume":"         4","oa":1,"isi":1,"language":[{"iso":"eng"}],"issue":"15","article_processing_charge":"No","type":"journal_article","ddc":["530","571"],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","page":"3139 - 3145","status":"public","doi":"10.1002/ece3.1150","day":"19","date_updated":"2025-09-29T13:17:53Z","_id":"537","title":"Fitness consequences of maternal and grandmaternal effects","file":[{"date_created":"2018-12-12T10:11:31Z","relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":621582,"file_id":"4886","checksum":"e32abf75a248e7a11811fd7f60858769","file_name":"IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf","date_updated":"2020-07-14T12:46:38Z"}],"department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publisher":"Wiley-Blackwell","publication":"Ecology and Evolution","has_accepted_license":"1","citation":{"short":"R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.","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.","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>","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.","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>"}},{"date_updated":"2025-09-29T11:40:47Z","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"}],"alternative_title":["IST Austria Technical Report"],"day":"28","month":"01","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>","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, <i>Compositional specifications for IOCO testing</i>. IST Austria, 2014.","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>","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>.","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>.","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p."},"language":[{"iso":"eng"}],"oa":1,"has_accepted_license":"1","publisher":"IST Austria","department":[{"_id":"ToHe"}],"file":[{"file_name":"IST-2014-148-v2+1_main_tr.pdf","date_updated":"2020-07-14T12:46:46Z","file_id":"5543","checksum":"0e03aba625cc334141a3148432aa5760","creator":"system","file_size":534732,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T11:54:21Z","access_level":"open_access"}],"year":"2014","date_published":"2014-01-28T00:00:00Z","file_date_updated":"2020-07-14T12:46:46Z","title":"Compositional specifications for IOCO testing","_id":"5411","date_created":"2018-12-12T11:39:11Z","author":[{"first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Willibald","last_name":"Krenn","full_name":"Krenn, Willibald"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"}],"ddc":["000"],"type":"technical_report","pubrep_id":"152","publication_status":"published","doi":"10.15479/AT:IST-2014-148-v2-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","related_material":{"record":[{"status":"public","id":"2167","relation":"later_version"}]},"page":"20","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"technical_report","pubrep_id":"153","publication_status":"published","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","full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"}],"ddc":["000"],"page":"31","related_material":{"record":[{"status":"public","relation":"later_version","id":"5413"},{"id":"5414","relation":"later_version","status":"public"},{"id":"2063","relation":"later_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.15479/AT:IST-2014-153-v1-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","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"}],"alternative_title":["IST Austria Technical Report"],"day":"29","month":"01","date_updated":"2025-04-15T07:56:48Z","year":"2014","file_date_updated":"2020-07-14T12:46:47Z","date_published":"2014-01-29T00:00:00Z","_id":"5412","title":"CEGAR for qualitative analysis of probabilistic systems","date_created":"2018-12-12T11:39:11Z","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-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.","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>.","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-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p."},"oa":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","publisher":"IST Austria","department":[{"_id":"KrCh"}],"file":[{"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:39Z","content_type":"application/pdf","file_size":423322,"creator":"system","file_id":"5500","checksum":"4d6cda4bebed970926403ad6ad8c745f","date_updated":"2020-07-14T12:46:47Z","file_name":"IST-2014-153-v1+1_main.pdf"}]},{"date_created":"2018-12-12T11:39:11Z","title":"CEGAR for qualitative analysis of probabilistic systems","_id":"5413","date_published":"2014-02-06T00:00:00Z","file_date_updated":"2020-07-14T12:46:47Z","year":"2014","file":[{"checksum":"ce4967a184d84863eec76c66cbac1614","file_id":"5539","date_updated":"2020-07-14T12:46:47Z","file_name":"IST-2014-153-v2+2_main.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:54:17Z","content_type":"application/pdf","file_size":606049,"creator":"system"}],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","has_accepted_license":"1","oa":1,"language":[{"iso":"eng"}],"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>","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","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>","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>.","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>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p."},"month":"02","day":"06","alternative_title":["IST Austria Technical Report"],"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. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"date_updated":"2025-04-15T07:56:48Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","page":"33","related_material":{"record":[{"relation":"earlier_version","id":"5412","status":"public"},{"status":"public","id":"5414","relation":"later_version"},{"relation":"later_version","id":"2063","status":"public"}]},"status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2014-153-v2-2","publication_status":"published","pubrep_id":"164","type":"technical_report","ddc":["000"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"}]},{"ddc":["000"],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin"}],"type":"technical_report","publication_status":"published","pubrep_id":"165","doi":"10.15479/AT:IST-2014-153-v3-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"5412","relation":"earlier_version"},{"status":"public","id":"5413","relation":"earlier_version"},{"id":"2063","relation":"later_version","status":"public"}]},"page":"33","date_updated":"2025-04-15T07:56:48Z","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. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"day":"07","month":"02","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","language":[{"iso":"eng"}],"citation":{"ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","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>","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>","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>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014."},"oa":1,"file":[{"checksum":"87b93fe9af71fc5c94b0eb6151537e11","file_id":"5464","date_updated":"2020-07-14T12:46:48Z","file_name":"IST-2014-153-v3+1_main.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:03Z","file_size":606227,"content_type":"application/pdf","creator":"system"}],"department":[{"_id":"KrCh"}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:48Z","date_published":"2014-02-07T00:00:00Z","year":"2014","date_created":"2018-12-12T11:39:12Z","_id":"5414","title":"CEGAR for qualitative analysis of probabilistic systems"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"ddc":["004"],"pubrep_id":"170","publication_status":"published","type":"technical_report","status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2014-170-v1-1","page":"27","related_material":{"record":[{"status":"public","relation":"later_version","id":"5436"},{"status":"public","relation":"later_version","id":"467"},{"relation":"later_version","id":"1656","status":"public"}]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-23T09:39:58Z","alternative_title":["IST Austria Technical Report"],"day":"19","month":"02","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.  "}],"publisher":"IST Austria","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"file_name":"IST-2014-170-v1+1_main.pdf","date_updated":"2020-07-14T12:46:48Z","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","file_id":"5497","creator":"system","content_type":"application/pdf","file_size":573457,"date_created":"2018-12-12T11:53:36Z","relation":"main_file","access_level":"open_access"}],"citation":{"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>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2014.","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>","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>"},"language":[{"iso":"eng"}],"oa":1,"has_accepted_license":"1","title":"Nested weighted automata","_id":"5415","date_created":"2018-12-12T11:39:12Z","year":"2014","date_published":"2014-02-19T00:00:00Z","file_date_updated":"2020-07-14T12:46:48Z"},{"citation":{"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>","ieee":"T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST Austria, 2014.","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>.","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>","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."},"language":[{"iso":"eng"}],"oa":1,"has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"IST Austria","file":[{"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:32Z","content_type":"application/pdf","file_size":712077,"creator":"system","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_id":"5492","date_updated":"2020-07-14T12:46:49Z","file_name":"IST-2014-171-v1+1_report.pdf"}],"year":"2014","file_date_updated":"2020-07-14T12:46:49Z","date_published":"2014-02-19T00:00:00Z","_id":"5416","title":"Model measuring for hybrid systems","date_created":"2018-12-12T11:39:12Z","date_updated":"2025-06-26T08:32:32Z","abstract":[{"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.","lang":"eng"}],"alternative_title":["IST Austria Technical Report"],"month":"02","day":"19","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2014-171-v1-1","status":"public","page":"22","related_material":{"record":[{"status":"public","relation":"later_version","id":"2217"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"ddc":["005"],"type":"technical_report","pubrep_id":"171","publication_status":"published"},{"author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"pubrep_id":"175","publication_status":"published","type":"technical_report","status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2014-172-v1-1","page":"14","related_material":{"record":[{"status":"public","relation":"later_version","id":"2327"}]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-21T06:02:58Z","alternative_title":["IST Austria Technical Report"],"month":"02","day":"19","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"}],"department":[{"_id":"ToHe"}],"publisher":"IST Austria","file":[{"file_id":"5481","checksum":"fcc3eab903cfcd3778b338d2d0d44d18","file_name":"IST-2014-172-v1+1_report.pdf","date_updated":"2020-07-14T12:46:49Z","date_created":"2018-12-12T11:53:20Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":383052,"content_type":"application/pdf"}],"citation":{"ieee":"T. A. Henzinger and J. Otop, <i>From model checking to model measuring</i>. IST Austria, 2014.","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>.","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>","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>","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>.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014."},"language":[{"iso":"eng"}],"oa":1,"has_accepted_license":"1","title":"From model checking to model measuring","_id":"5417","date_created":"2018-12-12T11:39:13Z","year":"2014","file_date_updated":"2020-07-14T12:46:49Z","date_published":"2014-02-19T00:00:00Z"},{"page":"18","related_material":{"record":[{"status":"public","relation":"later_version","id":"2163"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.15479/AT:IST-2014-176-v1-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","type":"technical_report","pubrep_id":"176","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"ddc":["000","005"],"year":"2014","file_date_updated":"2020-07-14T12:46:49Z","date_published":"2014-03-22T00:00:00Z","_id":"5418","title":"Games with a weak adversary","date_created":"2018-12-12T11:39:13Z","citation":{"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.","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","ieee":"K. Chatterjee and L. Doyen, <i>Games with a weak adversary</i>. IST Austria, 2014.","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>.","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>"},"oa":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"publisher":"IST Austria","file":[{"date_updated":"2020-07-14T12:46:49Z","file_name":"IST-2014-176-v1+1_icalp_14.pdf","file_id":"5468","checksum":"1d6958aa60050e1c3e932c6e5f34c39f","content_type":"application/pdf","file_size":328253,"creator":"system","access_level":"open_access","date_created":"2018-12-12T11:53:07Z","relation":"main_file"}],"abstract":[{"lang":"eng","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."}],"alternative_title":["IST Austria Technical Report"],"day":"22","month":"03","date_updated":"2025-04-15T07:55:59Z"},{"alternative_title":["IST Austria Technical Report"],"month":"04","day":"14","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"}],"date_updated":"2021-01-12T08:02:03Z","title":"Improved algorithms for reachability and shortest path on low tree-width graphs","_id":"5419","date_created":"2018-12-12T11:39:13Z","year":"2014","date_published":"2014-04-14T00:00:00Z","file_date_updated":"2020-07-14T12:46:50Z","publisher":"IST Austria","department":[{"_id":"KrCh"}],"file":[{"file_name":"IST-2014-187-v1+1_main_full_tech.pdf","date_updated":"2020-07-14T12:46:50Z","checksum":"c608e66030a4bf51d2d99b451f539b99","file_id":"5548","creator":"system","file_size":670031,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T11:54:25Z","access_level":"open_access"}],"oa":1,"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, 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>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.","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>","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.","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>","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>."},"language":[{"iso":"eng"}],"has_accepted_license":"1","pubrep_id":"187","publication_status":"published","type":"technical_report","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis"}],"ddc":["000"],"page":"34","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2014-187-v1-1"},{"page":"49","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.15479/AT:IST-2014-191-v1-1","publication_identifier":{"issn":["2664-1690"]},"status":"public","type":"technical_report","pubrep_id":"191","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen"}],"ddc":["000","005"],"year":"2014","date_published":"2014-04-14T00:00:00Z","file_date_updated":"2020-07-14T12:46:50Z","title":"The value 1 problem for concurrent mean-payoff games","_id":"5420","date_created":"2018-12-12T11:39:14Z","citation":{"ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>The value 1 problem for concurrent mean-payoff games</i>. IST Austria, 2014.","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>","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>","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>.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.","short":"K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014."},"oa":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"publisher":"IST Austria","file":[{"checksum":"49e0fd3e62650346daf7dc04604f7a0a","file_id":"5520","date_updated":"2020-07-14T12:46:50Z","file_name":"IST-2014-191-v1+1_main_full.pdf","access_level":"open_access","date_created":"2018-12-12T11:53:58Z","relation":"main_file","content_type":"application/pdf","file_size":584368,"creator":"system"}],"abstract":[{"lang":"eng","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)."}],"alternative_title":["IST Austria Technical Report"],"day":"14","month":"04","date_updated":"2021-01-12T08:02:05Z"},{"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"ddc":["000","005"],"pubrep_id":"190","publication_status":"published","type":"technical_report","status":"public","doi":"10.15479/AT:IST-2014-190-v2-2","publication_identifier":{"issn":["2664-1690"]},"page":"27","related_material":{"record":[{"status":"public","id":"5432","relation":"later_version"},{"relation":"later_version","id":"5440","status":"public"}]},"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:26:33Z","alternative_title":["IST Austria Technical Report"],"day":"18","month":"04","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are: (1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure). (2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.","lang":"eng"}],"publisher":"IST Austria","department":[{"_id":"KrCh"}],"file":[{"file_size":443529,"content_type":"application/pdf","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:54:16Z","date_updated":"2020-07-14T12:46:50Z","file_name":"IST-2014-190-v2+2_main_full.pdf","file_id":"5538","checksum":"42f3d8b563286eb0d903832bd9a848d3"},{"file_name":"IST-2014-190-v1+1_main_full.pdf","date_updated":"2020-07-14T12:46:50Z","file_id":"6852","checksum":"0c9a2fd822309719634495a35957e34d","creator":"kschuh","content_type":"application/pdf","file_size":440911,"date_created":"2019-09-06T07:30:20Z","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolution on Graphs</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">https://doi.org/10.15479/AT:IST-2014-190-v2-2</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolution on Graphs</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">10.15479/AT:IST-2014-190-v2-2</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolution on Graphs</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">10.15479/AT:IST-2014-190-v2-2</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2014). <i>The complexity of evolution on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">https://doi.org/10.15479/AT:IST-2014-190-v2-2</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolution on graphs</i>. IST Austria, 2014."},"oa":1,"has_accepted_license":"1","_id":"5421","title":"The complexity of evolution on graphs","date_created":"2018-12-12T11:39:14Z","year":"2014","file_date_updated":"2020-07-14T12:46:50Z","date_published":"2014-04-18T00:00:00Z"},{"type":"report","pubrep_id":"254","author":[{"full_name":"Porsche, Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","first_name":"Jana","last_name":"Porsche"}],"ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","status":"public","abstract":[{"text":"Notes from the Third Plenary for the Research Data Alliance in Dublin, Ireland on March 26 to 28, 2014 with focus on starting an institutional research data repository.","lang":"eng"}],"date_updated":"2020-07-14T23:04:56Z","year":"2014","file_date_updated":"2020-07-14T12:46:50Z","date_published":"2014-01-01T00:00:00Z","_id":"5422","title":"Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland","date_created":"2018-12-12T11:39:14Z","citation":{"ama":"Porsche J. <i>Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland</i>. none; 2014.","ieee":"J. Porsche, <i>Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland</i>. none, 2014.","mla":"Porsche, Jana. <i>Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland</i>. none, 2014.","apa":"Porsche, J. (2014). <i>Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland</i>. none.","short":"J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland, none, 2014.","chicago":"Porsche, Jana. <i>Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland</i>. none, 2014.","ista":"Porsche J. 2014. Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland, none,p."},"language":[{"iso":"eng"}],"oa":1,"has_accepted_license":"1","publisher":"none","department":[{"_id":"E-Lib"}],"file":[{"date_created":"2018-12-12T11:53:40Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":648585,"content_type":"application/pdf","file_id":"5501","checksum":"3954896648ce8afa8f7c4425e71cff08","file_name":"IST-2014-254-v1+1_Dublin_Day_3.pdf","date_updated":"2020-07-14T12:46:50Z"},{"file_id":"5502","checksum":"9a0d42b0b832dfe7e4b22fb6816bcbba","file_name":"IST-2014-254-v1+2_Dublin_Day_1.pdf","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:53:41Z","relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":221339},{"date_updated":"2020-07-14T12:46:50Z","file_name":"IST-2014-254-v1+3_Dublin_Day_2.pdf","file_id":"5503","checksum":"498b8d629fb1bd17bff1dc43700a93e6","content_type":"application/pdf","file_size":187778,"creator":"system","access_level":"open_access","date_created":"2018-12-12T11:53:42Z","relation":"main_file"}]}]