[{"oa":1,"publisher":"IST Austria","publication_status":"published","status":"public","pubrep_id":"28","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:43Z","page":"17","date_published":"2009-11-02T00:00:00Z","_id":"5392","date_created":"2018-12-12T11:39:04Z","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems."}],"file":[{"date_created":"2018-12-12T11:54:08Z","file_id":"5530","relation":"main_file","content_type":"application/pdf","checksum":"fb7563150231325b00b1718d956f687b","access_level":"open_access","date_updated":"2020-07-14T12:46:43Z","file_size":311065,"creator":"system","file_name":"IST-2009-0004_IST-2009-0004.pdf"}],"month":"11","related_material":{"record":[{"status":"public","relation":"later_version","id":"3857"}]},"doi":"10.15479/AT:IST-2009-0004","ddc":["005"],"publication_identifier":{"issn":["2664-1690"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:45:44Z","title":"Probabilistic automata on infinite words: Decidability and undecidability results","citation":{"ama":"Chatterjee K. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>","apa":"Chatterjee, K. (2009). <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>","short":"K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.","mla":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>.","chicago":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>.","ista":"Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.","ieee":"K. Chatterjee, <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria, 2009."},"year":"2009","oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"type":"technical_report","day":"02"},{"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:43Z","checksum":"49551ac552915b17593a14c993845274","file_size":386866,"creator":"system","file_name":"IST-2009-0003_IST-2009-0003.pdf","date_created":"2018-12-12T11:52:58Z","relation":"main_file","file_id":"5459","content_type":"application/pdf"}],"month":"10","abstract":[{"text":"Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.","lang":"eng"}],"_id":"5393","date_created":"2018-12-12T11:39:05Z","date_published":"2009-10-09T00:00:00Z","page":"12","file_date_updated":"2020-07-14T12:46:43Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","pubrep_id":"29","publisher":"IST Austria","publication_status":"published","oa":1,"day":"09","year":"2009","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","has_accepted_license":"1","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"type":"technical_report","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, <i>Gist: A solver for probabilistic games</i>. IST Austria, 2009.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2009). <i>Gist: A solver for probabilistic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009."},"title":"Gist: A solver for probabilistic games","date_updated":"2023-02-23T12:09:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"ddc":["000","005"],"doi":"10.15479/AT:IST-2009-0003","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"status":"public","relation":"later_version","id":"4388"}]}},{"citation":{"ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>","ama":"Chatterjee K, Henzinger TA, Horn F. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>"},"title":"Improved lower bounds for request-response and finitary Streett games","day":"09","oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","year":"2009","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Horn, Florian","last_name":"Horn"}],"type":"technical_report","language":[{"iso":"eng"}],"date_updated":"2020-07-14T23:07:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"doi":"10.15479/AT:IST-2009-0002","publication_identifier":{"issn":["2664-1690"]},"page":"11","file":[{"file_name":"IST-2009-0002_IST-2009-0002.pdf","creator":"system","file_size":238091,"date_updated":"2020-07-14T12:46:43Z","access_level":"open_access","checksum":"1c50a9723fbae1b2c46d18138968efb3","content_type":"application/pdf","relation":"main_file","file_id":"5511","date_created":"2018-12-12T11:53:50Z"}],"month":"09","_id":"5394","date_published":"2009-09-09T00:00:00Z","date_created":"2018-12-12T11:39:05Z","abstract":[{"text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players.","lang":"eng"}],"publisher":"IST Austria","publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:46:43Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"30","status":"public"},{"publication_status":"published","publisher":"IST Austria","oa":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:43Z","status":"public","pubrep_id":"31","page":"20","file":[{"date_updated":"2020-07-14T12:46:43Z","access_level":"open_access","checksum":"04d9cc065cc19598a4e8631c47f1a562","file_name":"IST-2009-0001_IST-2009-0001.pdf","creator":"system","file_size":342088,"date_created":"2018-12-12T11:53:25Z","content_type":"application/pdf","file_id":"5486","relation":"main_file"}],"month":"09","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses."}],"_id":"5395","date_created":"2018-12-12T11:39:05Z","date_published":"2009-09-09T00:00:00Z","related_material":{"record":[{"status":"public","id":"3855","relation":"later_version"}]},"language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:45:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"doi":"10.15479/AT:IST-2009-0001","publication_identifier":{"issn":["2664-1690"]},"citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria, 2009.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.","ama":"Chatterjee K, Doyen L, Henzinger TA. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>"},"title":"Qualitative analysis of partially-observable Markov decision processes","day":"09","has_accepted_license":"1","year":"2009","oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"type":"technical_report","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}]},{"scopus_import":"1","external_id":{"pmid":["19520962"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-12-14T08:53:26Z","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"article_type":"original","year":"2009","oa_version":"Submitted Version","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4044190/"}],"oa":1,"volume":324,"article_processing_charge":"No","issue":"5933","date_published":"2009-06-12T00:00:00Z","_id":"9453","abstract":[{"text":"Parent-of-origin-specific (imprinted) gene expression is regulated in Arabidopsis thaliana endosperm by cytosine demethylation of the maternal genome mediated by the DNA glycosylase DEMETER, but the extent of the methylation changes is not known. Here, we show that virtually the entire endosperm genome is demethylated, coupled with extensive local non-CG hypermethylation of small interfering RNA–targeted sequences. Mutation of DEMETER partially restores endosperm CG methylation to levels found in other tissues, indicating that CG demethylation is specific to maternal sequences. Endosperm demethylation is accompanied by CHH hypermethylation of embryo transposable elements. Our findings demonstrate extensive reconfiguration of the endosperm methylation landscape that likely reinforces transposon silencing in the embryo.","lang":"eng"}],"pmid":1,"keyword":["Multidisciplinary"],"language":[{"iso":"eng"}],"doi":"10.1126/science.1172417","citation":{"apa":"Hsieh, T.-F., Ibarra, C. A., Silva, P., Zemach, A., Eshed-Williams, L., Fischer, R. L., &#38; Zilberman, D. (2009). Genome-wide demethylation of Arabidopsis endosperm. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1172417\">https://doi.org/10.1126/science.1172417</a>","ama":"Hsieh T-F, Ibarra CA, Silva P, et al. Genome-wide demethylation of Arabidopsis endosperm. <i>Science</i>. 2009;324(5933):1451-1454. doi:<a href=\"https://doi.org/10.1126/science.1172417\">10.1126/science.1172417</a>","short":"T.-F. Hsieh, C.A. Ibarra, P. Silva, A. Zemach, L. Eshed-Williams, R.L. Fischer, D. Zilberman, Science 324 (2009) 1451–1454.","mla":"Hsieh, Tzung-Fu, et al. “Genome-Wide Demethylation of Arabidopsis Endosperm.” <i>Science</i>, vol. 324, no. 5933, American Association for the Advancement of Science, 2009, pp. 1451–54, doi:<a href=\"https://doi.org/10.1126/science.1172417\">10.1126/science.1172417</a>.","ieee":"T.-F. Hsieh <i>et al.</i>, “Genome-wide demethylation of Arabidopsis endosperm,” <i>Science</i>, vol. 324, no. 5933. American Association for the Advancement of Science, pp. 1451–1454, 2009.","ista":"Hsieh T-F, Ibarra CA, Silva P, Zemach A, Eshed-Williams L, Fischer RL, Zilberman D. 2009. Genome-wide demethylation of Arabidopsis endosperm. Science. 324(5933), 1451–1454.","chicago":"Hsieh, Tzung-Fu, Christian A. Ibarra, Pedro Silva, Assaf Zemach, Leor Eshed-Williams, Robert L. Fischer, and Daniel Zilberman. “Genome-Wide Demethylation of Arabidopsis Endosperm.” <i>Science</i>. American Association for the Advancement of Science, 2009. <a href=\"https://doi.org/10.1126/science.1172417\">https://doi.org/10.1126/science.1172417</a>."},"title":"Genome-wide demethylation of Arabidopsis endosperm","day":"12","type":"journal_article","author":[{"last_name":"Hsieh","first_name":"Tzung-Fu","full_name":"Hsieh, Tzung-Fu"},{"last_name":"Ibarra","first_name":"Christian A.","full_name":"Ibarra, Christian A."},{"first_name":"Pedro","full_name":"Silva, Pedro","last_name":"Silva"},{"last_name":"Zemach","first_name":"Assaf","full_name":"Zemach, Assaf"},{"first_name":"Leor","full_name":"Eshed-Williams, Leor","last_name":"Eshed-Williams"},{"last_name":"Fischer","full_name":"Fischer, Robert L.","first_name":"Robert L."},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","first_name":"Daniel","full_name":"Zilberman, Daniel","last_name":"Zilberman"}],"publisher":"American Association for the Advancement of Science","publication":"Science","quality_controlled":"1","department":[{"_id":"DaZi"}],"status":"public","intvolume":"       324","page":"1451-1454","month":"06","extern":"1","date_created":"2021-06-04T08:55:41Z"},{"doi":"10.1101/sqb.2009.74.030","scopus_import":1,"date_updated":"2021-01-12T07:45:04Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"Royal Society and the Engineering and Physical Sciences for support (GR/ T11753/01)","author":[{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"type":"book_chapter","oa_version":"None","year":"2009","day":"10","publist_id":"2708","title":"Why sex and recombination? ","citation":{"mla":"Barton, Nicholas H. “Why Sex and Recombination? .” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 74, Cold Spring Harbor Laboratory Press, 2009, pp. 187–95, doi:<a href=\"https://doi.org/10.1101/sqb.2009.74.030\">10.1101/sqb.2009.74.030</a>.","chicago":"Barton, Nicholas H. “Why Sex and Recombination? .” In <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, 74:187–95. Cold Spring Harbor Laboratory Press, 2009. <a href=\"https://doi.org/10.1101/sqb.2009.74.030\">https://doi.org/10.1101/sqb.2009.74.030</a>.","ieee":"N. H. Barton, “Why sex and recombination? ,” in <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 74, Cold Spring Harbor Laboratory Press, 2009, pp. 187–195.","ista":"Barton NH. 2009.Why sex and recombination? . In: Cold Spring Harbor Symposia on Quantitative Biology. vol. 74, 187–195.","ama":"Barton NH. Why sex and recombination? . In: <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Vol 74. Cold Spring Harbor Laboratory Press; 2009:187-195. doi:<a href=\"https://doi.org/10.1101/sqb.2009.74.030\">10.1101/sqb.2009.74.030</a>","apa":"Barton, N. H. (2009). Why sex and recombination? . In <i>Cold Spring Harbor Symposia on Quantitative Biology</i> (Vol. 74, pp. 187–195). Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/sqb.2009.74.030\">https://doi.org/10.1101/sqb.2009.74.030</a>","short":"N.H. Barton, in:, Cold Spring Harbor Symposia on Quantitative Biology, Cold Spring Harbor Laboratory Press, 2009, pp. 187–195."},"intvolume":"        74","status":"public","volume":74,"publication":"Cold Spring Harbor Symposia on Quantitative Biology","quality_controlled":"1","department":[{"_id":"NiBa"}],"publisher":"Cold Spring Harbor Laboratory Press","publication_status":"published","_id":"3675","date_published":"2009-11-10T00:00:00Z","date_created":"2018-12-11T12:04:33Z","abstract":[{"text":"Sex and recombination have long been seen as adaptations that facilitate natural selection by generating favorable variations. If recombination is to aid selection, there must be negative linkage disequilibria—favorable alleles must be found together less often than expected by chance. These negative linkage disequilibria can be generated directly by selection, but this must involve negative epistasis of just the right strength, which is not expected, from either experiment or theory. Random drift provides a more general source of negative associations: Favorable mutations almost always arise on different genomes, and negative associations tend to persist, precisely because they shield variation from selection.\r\n\r\nWe can understand how recombination aids adaptation by determining the maximum possible rate of adaptation. With unlinked loci, this rate increases only logarithmically with the influx of favorable mutations. With a linear genome, a scaling argument shows that in a large population, the rate of adaptive substitution depends only on the expected rate in the absence of interference, divided by the total rate of recombination. A two-locus approximation predicts an upper bound on the rate of substitution, proportional to recombination rate.\r\n\r\nIf associations between linked loci do impede adaptation, there can be substantial selection for modifiers that increase recombination. Whether this can account for the maintenance of high rates of sex and recombination depends on the extent of selection. It is clear that the rate of species-wide substitutions is typically far too low to generate appreciable selection for recombination. However, local sweeps within a subdivided population may be effective.","lang":"eng"}],"month":"11","page":"187 - 195"},{"status":"public","intvolume":"       259","quality_controlled":"1","department":[{"_id":"NiBa"}],"publication":"Journal of Theoretical Biology","publisher":"Elsevier","date_created":"2018-12-11T12:05:06Z","month":"07","page":"317 - 324","doi":"10.1016/j.jtbi.2009.03.019","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by a Royal Society/Wolfson Award, and by grants EP/T11753/01, EP/C546318/01 from the EPSRC.\r\nWe are grateful to M. Cates, H.P. de Vladar and G. Sella, and to two anonymous referees, for their helpful comments.","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"},{"first_name":"Jason","full_name":"Coe, Jason","last_name":"Coe"}],"type":"journal_article","day":"21","title":"On the application of statistical physics to evolutionary biology","citation":{"chicago":"Barton, Nicholas H, and Jason Coe. “On the Application of Statistical Physics to Evolutionary Biology.” <i>Journal of Theoretical Biology</i>. Elsevier, 2009. <a href=\"https://doi.org/10.1016/j.jtbi.2009.03.019\">https://doi.org/10.1016/j.jtbi.2009.03.019</a>.","ieee":"N. H. Barton and J. Coe, “On the application of statistical physics to evolutionary biology,” <i>Journal of Theoretical Biology</i>, vol. 259, no. 2. Elsevier, pp. 317–324, 2009.","ista":"Barton NH, Coe J. 2009. On the application of statistical physics to evolutionary biology. Journal of Theoretical Biology. 259(2), 317–324.","mla":"Barton, Nicholas H., and Jason Coe. “On the Application of Statistical Physics to Evolutionary Biology.” <i>Journal of Theoretical Biology</i>, vol. 259, no. 2, Elsevier, 2009, pp. 317–24, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2009.03.019\">10.1016/j.jtbi.2009.03.019</a>.","short":"N.H. Barton, J. Coe, Journal of Theoretical Biology 259 (2009) 317–324.","ama":"Barton NH, Coe J. On the application of statistical physics to evolutionary biology. <i>Journal of Theoretical Biology</i>. 2009;259(2):317-324. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2009.03.019\">10.1016/j.jtbi.2009.03.019</a>","apa":"Barton, N. H., &#38; Coe, J. (2009). On the application of statistical physics to evolutionary biology. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2009.03.019\">https://doi.org/10.1016/j.jtbi.2009.03.019</a>"},"volume":259,"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-00554594/document"}],"oa":1,"publication_status":"published","_id":"3775","date_published":"2009-07-21T00:00:00Z","abstract":[{"lang":"eng","text":"There is a close analogy between statistical thermodynamics and the evolution of allele frequencies under mutation, selection and random drift. Wright's formula for the stationary distribution of allele frequencies is analogous to the Boltzmann distribution in statistical physics. Population size, 2N, plays the role of the inverse temperature, 1/kT, and determines the magnitude of random fluctuations. Log mean fitness, View the MathML source, tends to increase under selection, and is analogous to a (negative) energy; a potential function, U, increases under mutation in a similar way. An entropy, SH, can be defined which measures the deviation from the distribution of allele frequencies expected under random drift alone; the sum View the MathML source gives a free fitness that increases as the population evolves towards its stationary distribution. Usually, we observe the distribution of a few quantitative traits that depend on the frequencies of very many alleles. The mean and variance of such traits are analogous to observable quantities in statistical thermodynamics. Thus, we can define an entropy, SΩ, which measures the volume of allele frequency space that is consistent with the observed trait distribution. The stationary distribution of the traits is View the MathML source; this applies with arbitrary epistasis and dominance. The entropies SΩ, SH are distinct, but converge when there are so many alleles that traits fluctuate close to their expectations. Populations tend to evolve towards states that can be realised in many ways (i.e., large SΩ), which may lead to a substantial drop below the adaptive peak; we illustrate this point with a simple model of genetic redundancy. This analogy with statistical thermodynamics brings together previous ideas in a general framework, and justifies a maximum entropy approximation to the dynamics of quantitative traits."}],"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:06Z","scopus_import":1,"year":"2009","oa_version":"Submitted Version","publist_id":"2452"},{"acknowledgement":"We owe a great debt to Jim Murray for his many contributions to the study of Partula, in the field, in the laboratory, in the interpretation of data, and in generating new ideas about evolution. With pleasure and respect we dedicate this paper to him. Jim Murray played a leading role in making the collections used here. We are very grateful also to Ann Clarke and Elizabeth Murray for help with collecting, to Lorna Stewart for snail dissections, to Joris Koene for the gift of snails, to Natasha Constant for entering the data, and Takahiro Asami, Edmund Gittenberger and Gerhard Falkner for establishing the sinistral stock of L. stagnalis. Comments from an anonymous referee, A. Richard Palmer and the editorial board improved the manuscript. Work in the field was supported by the Royal Society, The Carnegie Trust, the Percy Sladen Trust and the National Science Foundation. The Science Research Council (B/SR/4144), the National Science Foundation (GB-4188), the Royal Society and the University of Nottingham supported work in the laboratory.","language":[{"iso":"eng"}],"doi":"10.1111/j.1420-9101.2009.01770.x","ddc":["570"],"citation":{"ista":"Davison A, Barton NH, Clarke B. 2009. The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails. Journal of Evolutionary Biology. 22(8), 1624–1635.","ieee":"A. Davison, N. H. Barton, and B. Clarke, “The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails,” <i>Journal of Evolutionary Biology</i>, vol. 22, no. 8. Wiley, pp. 1624–1635, 2009.","chicago":"Davison, Angus, Nicholas H Barton, and Bryan Clarke. “The Effect of Chirality Phenotype and Genotype on the Fecundity and Viability of Partula Suturalis and Lymnaea Stagnalis: Implications for the Evolution of Sinistral Snails.” <i>Journal of Evolutionary Biology</i>. Wiley, 2009. <a href=\"https://doi.org/10.1111/j.1420-9101.2009.01770.x\">https://doi.org/10.1111/j.1420-9101.2009.01770.x</a>.","mla":"Davison, Angus, et al. “The Effect of Chirality Phenotype and Genotype on the Fecundity and Viability of Partula Suturalis and Lymnaea Stagnalis: Implications for the Evolution of Sinistral Snails.” <i>Journal of Evolutionary Biology</i>, vol. 22, no. 8, Wiley, 2009, pp. 1624–35, doi:<a href=\"https://doi.org/10.1111/j.1420-9101.2009.01770.x\">10.1111/j.1420-9101.2009.01770.x</a>.","short":"A. Davison, N.H. Barton, B. Clarke, Journal of Evolutionary Biology 22 (2009) 1624–1635.","apa":"Davison, A., Barton, N. H., &#38; Clarke, B. (2009). The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails. <i>Journal of Evolutionary Biology</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1420-9101.2009.01770.x\">https://doi.org/10.1111/j.1420-9101.2009.01770.x</a>","ama":"Davison A, Barton NH, Clarke B. The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails. <i>Journal of Evolutionary Biology</i>. 2009;22(8):1624-1635. doi:<a href=\"https://doi.org/10.1111/j.1420-9101.2009.01770.x\">10.1111/j.1420-9101.2009.01770.x</a>"},"title":"The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails","day":"01","author":[{"last_name":"Davison","first_name":"Angus","full_name":"Davison, Angus"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bryan","full_name":"Clarke, Bryan","last_name":"Clarke"}],"type":"journal_article","publisher":"Wiley","quality_controlled":"1","department":[{"_id":"NiBa"}],"publication":"Journal of Evolutionary Biology","intvolume":"        22","status":"public","page":"1624 - 1635","month":"08","date_created":"2018-12-11T12:05:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:09Z","scopus_import":1,"publist_id":"2447","oa_version":"Submitted Version","year":"2009","has_accepted_license":"1","publication_status":"published","oa":1,"file_date_updated":"2020-07-14T12:46:15Z","volume":22,"pubrep_id":"553","issue":"8","file":[{"file_name":"Davison_JEB_v31_2009.pdf","creator":"dernst","file_size":2583812,"date_updated":"2020-07-14T12:46:15Z","access_level":"open_access","checksum":"f70c15c6ab9306121d4153a3be0d2346","content_type":"application/pdf","relation":"main_file","file_id":"6044","date_created":"2019-02-22T09:21:44Z"}],"date_published":"2009-08-01T00:00:00Z","_id":"3780","abstract":[{"text":"Why are sinistral snails so rare? Two main hypotheses are that selection acts against the establishment of new coiling morphs, because dextral and sinistral snails have trouble mating, or else a developmental constraint prevents the establishment of sinistrals. We therefore used an isolate of the snail Lymnaea stagnalis, in which sinistrals are rare, and populations of Partula suturalis, in which sinistrals are common, as well as a mathematical model, to understand the circumstances by which new morphs evolve. The main finding is that the sinistral genotype is associated with reduced egg viability in L. stagnalis, but in P. suturalis individuals of sinistral and dextral genotype appear equally fecund, implying a lack of a constraint. As positive frequency-dependent selection against the rare chiral morph in P. suturalis also operates over a narrow range (&lt; 3%), the results suggest a model for chiral evolution in snails in which weak positive frequency-dependent selection may be overcome by a negative frequency-dependent selection, such as reproductive character displacement. In snails, there is not always a developmental constraint. As the direction of cleavage, and thus the directional asymmetry of the entire body, does not generally vary in other Spiralia (annelids, echiurans, vestimentiferans, sipunculids and nemerteans), it remains an open question as to whether this is because of a constraint and/or because most taxa do not have a conspicuous external asymmetry (like a shell) upon which selection can act.","lang":"eng"}]},{"year":"2009","has_accepted_license":"1","oa_version":"Submitted Version","publist_id":"2360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:33Z","_id":"3837","date_published":"2009-01-01T00:00:00Z","abstract":[{"text":"In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions.","lang":"eng"}],"file":[{"checksum":"3a70e21527dfaad2f198549ae5710786","access_level":"open_access","date_updated":"2020-07-14T12:46:16Z","file_size":310902,"creator":"system","file_name":"IST-2012-70-v1+1_On_Relational_Interfaces.pdf","date_created":"2018-12-12T10:13:57Z","relation":"main_file","file_id":"5045","content_type":"application/pdf"}],"pubrep_id":"70","file_date_updated":"2020-07-14T12:46:16Z","oa":1,"publication_status":"published","type":"conference","author":[{"last_name":"Tripakis","first_name":"Stavros","full_name":"Tripakis, Stavros"},{"last_name":"Lickly","first_name":"Ben","full_name":"Lickly, Ben"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Lee","first_name":"Edward","full_name":"Lee, Edward"}],"day":"01","conference":{"start_date":"2009-10-12","end_date":"2009-10-16","name":"EMSOFT: Embedded Software ","location":"Grenoble, France"},"title":"On relational interfaces","ec_funded":1,"citation":{"ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2009. On relational interfaces. EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software. EMSOFT: Embedded Software , 67–76.","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in <i>EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software</i>, Grenoble, France, 2009, pp. 67–76.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.” In <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>, 67–76. ACM, 2009. <a href=\"https://doi.org/10.1145/1629335.1629346\">https://doi.org/10.1145/1629335.1629346</a>.","mla":"Tripakis, Stavros, et al. “On Relational Interfaces.” <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>, ACM, 2009, pp. 67–76, doi:<a href=\"https://doi.org/10.1145/1629335.1629346\">10.1145/1629335.1629346</a>.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2009). On relational interfaces. In <i>EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software</i> (pp. 67–76). Grenoble, France: ACM. <a href=\"https://doi.org/10.1145/1629335.1629346\">https://doi.org/10.1145/1629335.1629346</a>","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. On relational interfaces. In: <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>. ACM; 2009:67-76. doi:<a href=\"https://doi.org/10.1145/1629335.1629346\">10.1145/1629335.1629346</a>"},"doi":"10.1145/1629335.1629346","ddc":["004"],"language":[{"iso":"eng"}],"acknowledgement":"This work is supported by the Center for Hybrid and Embedded Software Systems (CHESS) at UC Berkeley, which receives support from the National Science Foundation (NSF awards #0720882 (CSR-EHS: PRET) and #0720841 (CSR-CPS)), the U.S. Army Research Office (ARO #W911NF-07-2-0019), the U.S. Air Force Office of Scientific Research (MURI #FA9550-06-0312), the Air Force Research Lab (AFRL), the State of California Micro Program, and the following companies: Agilent, Bosch, Lockheed-Martin, National Instruments, Thales and Toyota. This work is also supported by the COMBEST and ArtistDesign projects of the European Union, and the Swiss National Science Foundation. ","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:05:26Z","month":"01","page":"67 - 76","status":"public","department":[{"_id":"ToHe"}],"quality_controlled":"1","publication":"EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software","publisher":"ACM"},{"has_accepted_license":"1","year":"2009","oa_version":"Submitted Version","publist_id":"2352","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T11:24:49Z","_id":"3841","abstract":[{"text":"We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model. ","lang":"eng"}],"date_published":"2009-09-07T00:00:00Z","file":[{"file_size":222840,"creator":"system","file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","checksum":"df88431872586c773fbcfea37d7b36a2","access_level":"open_access","date_updated":"2020-07-14T12:46:16Z","relation":"main_file","file_id":"4702","content_type":"application/pdf","date_created":"2018-12-12T10:08:41Z"}],"oa":1,"publication_status":"published","pubrep_id":"67","volume":5797,"file_date_updated":"2020-07-14T12:46:16Z","title":"Formalisms for specifying Markovian population models","conference":{"location":"Palaiseau, France","end_date":"2009-09-25","start_date":"2009-09-23","name":"RP: Reachability Problems"},"citation":{"ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>.","mla":"Henzinger, Thomas A., et al. <i>Formalisms for Specifying Markovian Population Models</i>. Vol. 5797, Springer, 2009, pp. 3–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>.","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. In: Vol 5797. Springer; 2009:3-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>"},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"type":"conference","alternative_title":["LNCS"],"day":"07","related_material":{"record":[{"status":"public","id":"3381","relation":"later_version"}]},"acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","ddc":["005"],"doi":"10.1007/978-3-642-04420-5_2","language":[{"iso":"eng"}],"page":"3 - 23","date_created":"2018-12-11T12:05:28Z","month":"09","publisher":"Springer","status":"public","intvolume":"      5797","quality_controlled":"1","department":[{"_id":"ToHe"}]},{"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T11:45:05Z","has_accepted_license":"1","year":"2009","oa_version":"Submitted Version","publist_id":"2348","oa":1,"publication_status":"published","volume":4,"file_date_updated":"2020-07-14T12:46:17Z","article_processing_charge":"No","issue":"6","_id":"3843","abstract":[{"text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous- time Markov chain (CTMC).\r\nStandard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.\r\nIn this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.","lang":"eng"}],"date_published":"2009-10-30T00:00:00Z","file":[{"checksum":"9a3bde48f43203991a0b3c6a277c2f5b","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","file_size":222890,"creator":"dernst","file_name":"2009_HIBI_Didier.pdf","date_created":"2020-05-19T16:33:55Z","relation":"main_file","file_id":"7874","content_type":"application/pdf"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"3842"}]},"acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","doi":"10.1109/HiBi.2009.23","ddc":["000"],"language":[{"iso":"eng"}],"title":"Fast adaptive uniformization of the chemical master equation","conference":{"start_date":"2009-10-14","end_date":"2009-10-16","name":"HIBI: High-Performance Computational Systems Biology","location":"Trento, Italy"},"citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Fast adaptive uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE. <a href=\"https://doi.org/10.1109/HiBi.2009.23\">https://doi.org/10.1109/HiBi.2009.23</a>","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. In: Vol 4. IEEE; 2009:118-127. doi:<a href=\"https://doi.org/10.1109/HiBi.2009.23\">10.1109/HiBi.2009.23</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Fast adaptive uniformization of the chemical master equation. HIBI: High-Performance Computational Systems Biology vol. 4, 118–127.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,” 4:118–27. IEEE, 2009. <a href=\"https://doi.org/10.1109/HiBi.2009.23\">https://doi.org/10.1109/HiBi.2009.23</a>.","mla":"Didier, Frédéric, et al. <i>Fast Adaptive Uniformization of the Chemical Master Equation</i>. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:<a href=\"https://doi.org/10.1109/HiBi.2009.23\">10.1109/HiBi.2009.23</a>."},"author":[{"first_name":"Frédéric","full_name":"Didier, Frédéric","last_name":"Didier"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3B43276C-F248-11E8-B48F-1D18A9856A87","last_name":"Mateescu","full_name":"Mateescu, Maria","first_name":"Maria"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"type":"conference","day":"30","publisher":"IEEE","status":"public","intvolume":"         4","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"quality_controlled":"1","page":"118 - 127","date_created":"2018-12-11T12:05:28Z","month":"10"},{"year":"2009","has_accepted_license":"1","oa_version":"Submitted Version","publist_id":"2346","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:36Z","abstract":[{"text":"The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime.","lang":"eng"}],"_id":"3844","date_published":"2009-01-01T00:00:00Z","file":[{"checksum":"b2b15a5ef71eb50d62eaa5aea7efd8c4","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","file_name":"IST-2012-65-v1+1_Distributed_modular_Htl.pdf","file_size":526458,"creator":"system","date_created":"2018-12-12T10:07:56Z","content_type":"application/pdf","file_id":"4655","relation":"main_file"}],"oa":1,"publication_status":"published","pubrep_id":"65","file_date_updated":"2020-07-14T12:46:17Z","conference":{"location":"Washington, DC, United States","end_date":"2009-12-04","start_date":"2009-12-01","name":"RTSS: Real-Time Systems Symposium"},"title":"Distributed, modular HTL","ec_funded":1,"citation":{"mla":"Henzinger, Thomas A., et al. <i>Distributed, Modular HTL</i>. IEEE, 2009, pp. 171–80, doi:<a href=\"https://doi.org/10.1109/RTSS.2009.9\">10.1109/RTSS.2009.9</a>.","ista":"Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular HTL. RTSS: Real-Time Systems Symposium, 171–180.","ieee":"T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,” 171–80. IEEE, 2009. <a href=\"https://doi.org/10.1109/RTSS.2009.9\">https://doi.org/10.1109/RTSS.2009.9</a>.","apa":"Henzinger, T. A., Kirsch, C., Marques, E., &#38; Sokolova, A. (2009). Distributed, modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States: IEEE. <a href=\"https://doi.org/10.1109/RTSS.2009.9\">https://doi.org/10.1109/RTSS.2009.9</a>","ama":"Henzinger TA, Kirsch C, Marques E, Sokolova A. Distributed, modular HTL. In: IEEE; 2009:171-180. doi:<a href=\"https://doi.org/10.1109/RTSS.2009.9\">10.1109/RTSS.2009.9</a>","short":"T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180."},"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"first_name":"Eduardo","full_name":"Marques, Eduardo","last_name":"Marques"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"}],"type":"conference","day":"01","acknowledgement":"Supported by the EU ArtistDesign Network of Excellence on Embedded Systems Design, the EU project COMBEST, the Austrian Science Funds P18913-N15 and V00125, and Fundacao para a Ciencia e Tecnologia funds SFRH/BD/29461/2006 and PTDC/EIA/71462/2006","project":[{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"doi":"10.1109/RTSS.2009.9","ddc":["000"],"language":[{"iso":"eng"}],"page":"171 - 180","date_created":"2018-12-11T12:05:28Z","month":"01","publisher":"IEEE","status":"public","department":[{"_id":"ToHe"}],"quality_controlled":"1"},{"file_date_updated":"2020-07-14T12:46:20Z","pubrep_id":"53","volume":11,"publication_status":"published","oa":1,"article_number":"1","file":[{"checksum":"139c4586d24f11e5da31fb3a0cf96ef4","access_level":"open_access","date_updated":"2020-07-14T12:46:20Z","file_size":180082,"creator":"system","file_name":"IST-2012-53-v1+1_Finitary_winning_in_omega-regular_games.pdf","date_created":"2018-12-12T10:15:08Z","file_id":"5125","relation":"main_file","content_type":"application/pdf"}],"date_published":"2009-10-01T00:00:00Z","_id":"3870","abstract":[{"lang":"eng","text":"Games on graphs with omega-regular objectives provide a model for the control and synthesis of reactive systems. Every omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Buchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound."}],"issue":"1","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:50Z","publist_id":"2309","year":"2009","oa_version":"Submitted Version","has_accepted_license":"1","publication":"ACM Transactions on Computational Logic (TOCL)","department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"        11","status":"public","publisher":"ACM","month":"10","date_created":"2018-12-11T12:05:37Z","language":[{"iso":"eng"}],"ddc":["004"],"doi":"10.1145/1614431.1614432","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"}],"acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, the NSF grants CCR-0132780, CNS-0720884, and CCR- 225610, by the Swiss National Science Foundation, by the COMBEST project of the European Union, and EU-TMR network Games.\r\nWe thank anonymous reviewers for useful comments.","day":"01","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Florian","full_name":"Horn, Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","citation":{"ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 1. ACM, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2009. <a href=\"https://doi.org/10.1145/1614431.1614432\">https://doi.org/10.1145/1614431.1614432</a>.","mla":"Chatterjee, Krishnendu, et al. “Finitary Winning in Omega-Regular Games.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 1, 1, ACM, 2009, doi:<a href=\"https://doi.org/10.1145/1614431.1614432\">10.1145/1614431.1614432</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). Finitary winning in omega-regular games. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1614431.1614432\">https://doi.org/10.1145/1614431.1614432</a>","ama":"Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2009;11(1). doi:<a href=\"https://doi.org/10.1145/1614431.1614432\">10.1145/1614431.1614432</a>"},"ec_funded":1,"title":"Finitary winning in omega-regular games"},{"date_created":"2018-12-11T12:05:37Z","month":"09","page":"244 - 258","intvolume":"      5710","status":"public","department":[{"_id":"KrCh"}],"quality_controlled":"1","publisher":"Springer","type":"conference","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"day":"01","title":"Probabilistic weighted automata","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2009-09-01","end_date":"2009-09-04","location":"Bologna, Italy"},"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Probabilistic Weighted Automata</i>. Vol. 5710, Springer, 2009, pp. 244–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-04081-8_17\">10.1007/978-3-642-04081-8_17</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic Weighted Automata,” 5710:244–58. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04081-8_17\">https://doi.org/10.1007/978-3-642-04081-8_17</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,” presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710, pp. 244–258.","ama":"Chatterjee K, Doyen L, Henzinger TA. Probabilistic weighted automata. In: Vol 5710. Springer; 2009:244-258. doi:<a href=\"https://doi.org/10.1007/978-3-642-04081-8_17\">10.1007/978-3-642-04081-8_17</a>","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04081-8_17\">https://doi.org/10.1007/978-3-642-04081-8_17</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258."},"ec_funded":1,"doi":"10.1007/978-3-642-04081-8_17","ddc":["000","005"],"language":[{"iso":"eng"}],"project":[{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European projects Combest, Quasimodo, and Gasics, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification ) funded by the F.R.S.-FNRS.","date_published":"2009-09-01T00:00:00Z","_id":"3871","abstract":[{"text":"Nondeterministic weighted automata are finite automata with numerical weights oil transitions. They define quantitative languages 1, that assign to each word v; a real number L(w). The value of ail infinite word w is computed as the maximal value of all runs over w, and the value of a run as the supremum, limsup liminf, limit average, or discounted sum of the transition weights. We introduce probabilistic weighted antomata, in which the transitions are chosen in a randomized (rather than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics), the value of a word v) is the largest real v such that the runs over w have value at least v with probability I (resp. positive probability). We study the classical questions of automata theory for probabilistic weighted automata: emptiness and universality, expressiveness, and closure under various operations oil languages. For quantitative languages, emptiness university axe defined as whether the value of some (resp. every) word exceeds a given threshold. We prove some, of these questions to he decidable, and others undecidable. Regarding expressive power, we show that probabilities allow its to define a wide variety of new classes of quantitative languages except for discounted-sum automata, where probabilistic choice is no more expressive than nondeterminism. Finally we live ail almost complete picture of the closure of various classes of probabilistic weighted automata for the following, provide, is operations oil quantitative languages: maximum, sum. and numerical complement.","lang":"eng"}],"file":[{"creator":"system","file_size":200161,"file_name":"IST-2012-52-v1+1_Probabilistic_Weighted_Automata.pdf","checksum":"af973ddbcf131b8810c6bff2c055ff56","access_level":"open_access","date_updated":"2020-07-14T12:46:20Z","file_id":"4771","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:09:46Z"}],"pubrep_id":"52","volume":5710,"file_date_updated":"2020-07-14T12:46:20Z","oa":1,"publication_status":"published","oa_version":"Submitted Version","has_accepted_license":"1","year":"2009","publist_id":"2304","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:50Z"},{"doi":"10.1007/978-3-642-10470-1_4","ddc":["000"],"language":[{"iso":"eng"}],"acknowledgement":"This research was partially supported by Geomagic, Inc., and by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0007 and HR0011-05-1-0057.","alternative_title":["LNCS"],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"John","full_name":"Harer, John","last_name":"Harer"}],"type":"conference","day":"17","conference":{"name":"3DPH: Modelling the Physiological Human","start_date":"2009-11-29","end_date":"2009-12-02","location":"Zermatt, Switzerland"},"title":"The persistent Morse complex segmentation of a 3-manifold","citation":{"mla":"Edelsbrunner, Herbert, and John Harer. <i>The Persistent Morse Complex Segmentation of a 3-Manifold</i>. Vol. 5903, Springer, 2009, pp. 36–50, doi:<a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">10.1007/978-3-642-10470-1_4</a>.","chicago":"Edelsbrunner, Herbert, and John Harer. “The Persistent Morse Complex Segmentation of a 3-Manifold,” 5903:36–50. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">https://doi.org/10.1007/978-3-642-10470-1_4</a>.","ieee":"H. Edelsbrunner and J. Harer, “The persistent Morse complex segmentation of a 3-manifold,” presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland, 2009, vol. 5903, pp. 36–50.","ista":"Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.","ama":"Edelsbrunner H, Harer J. The persistent Morse complex segmentation of a 3-manifold. In: Vol 5903. Springer; 2009:36-50. doi:<a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">10.1007/978-3-642-10470-1_4</a>","apa":"Edelsbrunner, H., &#38; Harer, J. (2009). The persistent Morse complex segmentation of a 3-manifold (Vol. 5903, pp. 36–50). Presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">https://doi.org/10.1007/978-3-642-10470-1_4</a>","short":"H. Edelsbrunner, J. Harer, in:, Springer, 2009, pp. 36–50."},"intvolume":"      5903","status":"public","quality_controlled":"1","department":[{"_id":"HeEd"}],"publisher":"Springer","date_created":"2018-12-11T12:06:10Z","month":"11","page":"36 - 50","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:53:32Z","scopus_import":1,"year":"2009","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"2160","volume":5903,"pubrep_id":"535","file_date_updated":"2020-07-14T12:46:21Z","oa":1,"publication_status":"published","_id":"3968","date_published":"2009-11-17T00:00:00Z","abstract":[{"text":"We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its mathematical roots, which are Morse theory and homological algebra. It allows for the implicit treatment of an underlying mesh, thus combining the structural integrity of its mathematical foundations with the computational efficiency of image processing.","lang":"eng"}],"file":[{"file_size":165090,"creator":"system","file_name":"IST-2016-535-v1+1_2009-P-04-3ManifoldSegmentation.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:21Z","checksum":"11fc85bcc19bab1f020e706a4b8a4660","file_id":"4694","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:08:33Z"}]},{"month":"11","date_created":"2018-12-11T12:07:09Z","page":"E186 - E204","department":[{"_id":"NiBa"}],"quality_controlled":"1","publication":"American Naturalist","status":"public","intvolume":"       174","publisher":"University of Chicago Press","day":"05","type":"journal_article","author":[{"id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0951-3112","full_name":"Polechova, Jitka","first_name":"Jitka","last_name":"Polechova"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Marion, Glenn","first_name":"Glenn","last_name":"Marion"}],"citation":{"mla":"Polechova, Jitka, et al. “Species’ Range: Adaptation in Space and Time.” <i>American Naturalist</i>, vol. 174, no. 5, University of Chicago Press, 2009, pp. E186–204, doi:<a href=\"https://doi.org/10.1086/605958\">10.1086/605958</a>.","ieee":"J. Polechova, N. H. Barton, and G. Marion, “Species’ range: Adaptation in space and time,” <i>American Naturalist</i>, vol. 174, no. 5. University of Chicago Press, pp. E186–E204, 2009.","ista":"Polechova J, Barton NH, Marion G. 2009. Species’ range: Adaptation in space and time. American Naturalist. 174(5), E186–E204.","chicago":"Polechova, Jitka, Nicholas H Barton, and Glenn Marion. “Species’ Range: Adaptation in Space and Time.” <i>American Naturalist</i>. University of Chicago Press, 2009. <a href=\"https://doi.org/10.1086/605958\">https://doi.org/10.1086/605958</a>.","apa":"Polechova, J., Barton, N. H., &#38; Marion, G. (2009). Species’ range: Adaptation in space and time. <i>American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/605958\">https://doi.org/10.1086/605958</a>","ama":"Polechova J, Barton NH, Marion G. Species’ range: Adaptation in space and time. <i>American Naturalist</i>. 2009;174(5):E186-E204. doi:<a href=\"https://doi.org/10.1086/605958\">10.1086/605958</a>","short":"J. Polechova, N.H. Barton, G. Marion, American Naturalist 174 (2009) E186–E204."},"title":"Species' range: Adaptation in space and time","language":[{"iso":"eng"}],"ddc":["570"],"doi":"10.1086/605958","pmid":1,"related_material":{"link":[{"url":"https://doi.org/10.1086/659642","relation":"erratum"}]},"date_published":"2009-11-05T00:00:00Z","_id":"4136","abstract":[{"lang":"eng","text":"Populations living in a spatially and temporally changing environment can adapt to the changing optimum and/or migrate toward favorable habitats. Here we extend previous analyses with a static optimum to allow the environment to vary in time as well as in space. The model follows both population dynamics and the trait mean under stabilizing selection, and the outcomes can be understood by comparing the loads due to genetic variance, dispersal, and temporal change. With fixed genetic variance, we obtain two regimes: (1) adaptation that is uniform along the environmental gradient and that responds to the moving optimum as expected for panmictic populations and when the spatial gradient is sufficiently steep, and (2) a population with limited range that adapts more slowly than the environmental optimum changes in both time and space; the population therefore becomes locally extinct and migrates toward suitable habitat. We also use a population‐genetic model with many loci to allow genetic variance to evolve, and we show that the only solution now has uniform adaptation."}],"issue":"5","article_processing_charge":"No","volume":174,"pubrep_id":"552","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.1086/605958"}],"oa":1,"publist_id":"1986","article_type":"original","year":"2009","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:54:46Z","scopus_import":1,"external_id":{"pmid":[" 19788353"]}},{"doi":"10.1534/genetics.108.099309","scopus_import":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:55:29Z","acknowledgement":"N.B. was supported by the Engineering and Physical Sciences Research Council (GR/T11753 and GR/T19537) and by the Royal Society.\r\nWe are grateful to Ellen Baake for helping to initiate this project and for her comments on this manuscript. We also thank Michael Turelli for his comments on the manuscript and I. Pen for discussions and support in this project. This project was a result of a collaboration supported by the European Science Foundation grant “Integrating population genetics and conservation biology.” ","type":"journal_article","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"first_name":"Harold","full_name":"De Vladar, Harold","last_name":"De Vladar"}],"year":"2009","oa_version":"None","day":"01","publist_id":"1882","title":"Statistical mechanics and the evolution of polygenic quantitative traits","citation":{"apa":"Barton, N. H., &#38; De Vladar, H. (2009). Statistical mechanics and the evolution of polygenic quantitative traits. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.108.099309\">https://doi.org/10.1534/genetics.108.099309</a>","ama":"Barton NH, De Vladar H. Statistical mechanics and the evolution of polygenic quantitative traits. <i>Genetics</i>. 2009;181(3):997-1011. doi:<a href=\"https://doi.org/10.1534/genetics.108.099309\">10.1534/genetics.108.099309</a>","short":"N.H. Barton, H. De Vladar, Genetics 181 (2009) 997–1011.","mla":"Barton, Nicholas H., and Harold De Vladar. “Statistical Mechanics and the Evolution of Polygenic Quantitative Traits.” <i>Genetics</i>, vol. 181, no. 3, Genetics Society of America, 2009, pp. 997–1011, doi:<a href=\"https://doi.org/10.1534/genetics.108.099309\">10.1534/genetics.108.099309</a>.","ista":"Barton NH, De Vladar H. 2009. Statistical mechanics and the evolution of polygenic quantitative traits. Genetics. 181(3), 997–1011.","ieee":"N. H. Barton and H. De Vladar, “Statistical mechanics and the evolution of polygenic quantitative traits,” <i>Genetics</i>, vol. 181, no. 3. Genetics Society of America, pp. 997–1011, 2009.","chicago":"Barton, Nicholas H, and Harold De Vladar. “Statistical Mechanics and the Evolution of Polygenic Quantitative Traits.” <i>Genetics</i>. Genetics Society of America, 2009. <a href=\"https://doi.org/10.1534/genetics.108.099309\">https://doi.org/10.1534/genetics.108.099309</a>."},"status":"public","intvolume":"       181","volume":181,"publication":"Genetics","quality_controlled":"1","department":[{"_id":"NiBa"}],"publisher":"Genetics Society of America","publication_status":"published","_id":"4231","abstract":[{"text":"The evolution of quantitative characters depends on the frequencies of the alleles involved, yet these frequencies cannot usually be measured. Previous groups have proposed an approximation to the dynamics of quantitative traits, based on an analogy with statistical mechanics. We present a modified version of that approach, which makes the analogy more precise and applies quite generally to describe the evolution of allele frequencies. We calculate explicitly how the macroscopic quantities (i.e., quantities that depend on the quantitative trait) depend on evolutionary forces, in a way that is independent of the microscopic details. We first show that the stationary distribution of allele frequencies under drift, selection, and mutation maximizes a certain measure of entropy, subject to constraints on the expectation of observable quantities. We then approximate the dynamical changes in these expectations, assuming that the distribution of allele frequencies always maximizes entropy, conditional on the expected values. When applied to directional selection on an additive trait, this gives a very good approximation to the evolution of the trait mean and the genetic variance, when the number of mutations per generation is sufficiently high (4Nμ &gt; 1). We show how the method can be modified for small mutation rates (4Nμ → 0). We outline how this method describes epistatic interactions as, for example, with stabilizing selection.","lang":"eng"}],"date_published":"2009-03-01T00:00:00Z","date_created":"2018-12-11T12:07:44Z","month":"03","issue":"3","page":"997 - 1011"},{"ddc":["570"],"doi":"10.1111/j.1558-5646.2009.00622.x","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by a Royal Society/Wolfson Research Merit award, and by a grant from the Natural Environment Research Council.\r\nWe are very grateful for insightful comments from S. P. Otto, and for helpful suggestions from the referees and the Associate Editor, Maria Servedio.","type":"journal_article","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"full_name":"De Cara, Maria","first_name":"Maria","last_name":"De Cara"}],"day":"01","title":"The evolution of strong reproductive isolation","citation":{"short":"N.H. Barton, M. De Cara, Evolution; International Journal of Organic Evolution 63 (2009) 1171–1190.","apa":"Barton, N. H., &#38; De Cara, M. (2009). The evolution of strong reproductive isolation. <i>Evolution; International Journal of Organic Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">https://doi.org/10.1111/j.1558-5646.2009.00622.x</a>","ama":"Barton NH, De Cara M. The evolution of strong reproductive isolation. <i>Evolution; International Journal of Organic Evolution</i>. 2009;63(5):1171-1190. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">10.1111/j.1558-5646.2009.00622.x</a>","ieee":"N. H. Barton and M. De Cara, “The evolution of strong reproductive isolation,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 63, no. 5. Wiley, pp. 1171–1190, 2009.","ista":"Barton NH, De Cara M. 2009. The evolution of strong reproductive isolation. Evolution; International Journal of Organic Evolution. 63(5), 1171–1190.","chicago":"Barton, Nicholas H, and Maria De Cara. “The Evolution of Strong Reproductive Isolation.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley, 2009. <a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">https://doi.org/10.1111/j.1558-5646.2009.00622.x</a>.","mla":"Barton, Nicholas H., and Maria De Cara. “The Evolution of Strong Reproductive Isolation.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 63, no. 5, Wiley, 2009, pp. 1171–90, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2009.00622.x\">10.1111/j.1558-5646.2009.00622.x</a>."},"intvolume":"        63","status":"public","publication":"Evolution; International Journal of Organic Evolution","department":[{"_id":"NiBa"}],"quality_controlled":"1","publisher":"Wiley","date_created":"2018-12-11T12:07:48Z","month":"05","page":"1171 - 1190","scopus_import":1,"date_updated":"2021-01-12T07:55:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","oa_version":"Submitted Version","has_accepted_license":"1","publist_id":"1866","pubrep_id":"551","volume":63,"file_date_updated":"2020-07-14T12:46:25Z","oa":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Felsenstein distinguished two ways by which selection can directly strengthen isolation. First, a modifier that strengthens prezygotic isolation can be favored everywhere. This fits with the traditional view of reinforcement as an adaptation to reduce deleterious hybridization by strengthening assortative mating. Second, selection can favor association between different incompatibilities, despite recombination. We generalize this “two allele” model to follow associations among any number of incompatibilities, which may include both assortment and hybrid inviability. Our key argument is that this process, of coupling between incompatibilities, may be quite different from the usual view of reinforcement: strong isolation can evolve through the coupling of any kind of incompatibility, whether prezygotic or postzygotic. Single locus incompatibilities become coupled because associations between them increase the variance in compatibility, which in turn increases mean fitness if there is positive epistasis. Multiple incompatibilities, each maintained by epistasis, can become coupled in the same way. In contrast, a single-locus incompatibility can become coupled with loci that reduce the viability of haploid hybrids because this reduces harmful recombination. We obtain simple approximations for the limits of tight linkage, and strong assortment, and show how assortment alleles can invade through associations with other components of reproductive isolation."}],"_id":"4242","date_published":"2009-05-01T00:00:00Z","file":[{"creator":"system","file_size":720913,"file_name":"IST-2016-551-v1+1_BartonDeCaraRevNew.pdf","checksum":"1920d2e25ef335833764256c1a47bbfb","access_level":"open_access","date_updated":"2020-07-14T12:46:25Z","file_id":"4903","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:11:46Z"},{"creator":"system","file_size":290160,"file_name":"IST-2016-551-v1+2_BartonDeCaraRevNewSI.pdf","checksum":"c1c51bbc10d4f328fc96fc5b0e5dc25d","access_level":"open_access","date_updated":"2020-07-14T12:46:25Z","file_id":"4904","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:11:47Z"}],"issue":"5"},{"has_accepted_license":"1","year":"2009","oa_version":"Submitted Version","publist_id":"180","date_updated":"2021-01-12T07:59:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"abstract":[{"lang":"eng","text":"Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata.\r\nFor quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations.\r\nWe next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence."}],"_id":"4542","date_published":"2009-09-10T00:00:00Z","file":[{"checksum":"e8f53abb63579de3f2bff58b2a1188e2","date_updated":"2020-07-14T12:46:31Z","access_level":"open_access","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf","file_size":164428,"creator":"system","date_created":"2018-12-12T10:15:09Z","content_type":"application/pdf","file_id":"5126","relation":"main_file"}],"oa":1,"publication_status":"published","volume":5699,"pubrep_id":"39","file_date_updated":"2020-07-14T12:46:31Z","conference":{"start_date":"2009-09-02","end_date":"2009-09-04","name":"FCT: Fundamentals of Computation Theory","location":"Wroclaw, Poland"},"title":"Alternating weighted automata","ec_funded":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Alternating Weighted Automata</i>. Vol. 5699, Springer, 2009, pp. 3–13, doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol 5699. Springer; 2009:3-13. doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13."},"alternative_title":["LNCS"],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"type":"conference","day":"10","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest, Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","project":[{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"doi":"10.1007/978-3-642-03409-1_2","ddc":["004"],"language":[{"iso":"eng"}],"page":"3 - 13","date_created":"2018-12-11T12:09:23Z","month":"09","publisher":"Springer","status":"public","intvolume":"      5699","department":[{"_id":"KrCh"}],"quality_controlled":"1"},{"quality_controlled":"1","department":[{"_id":"KrCh"}],"status":"public","intvolume":"      5734","publisher":"Springer","month":"08","date_created":"2018-12-11T12:09:24Z","page":"34 - 54","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-03816-7_4","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), and by the European project Combest.","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"day":"01","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian","full_name":"Horn, Florian"}],"type":"conference","ec_funded":1,"citation":{"short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>","ama":"Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives. In: Vol 5734. Springer; 2009:34-54. doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Games with Finitary Objectives</i>. Vol. 5734, Springer, 2009, pp. 34–54, doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>."},"conference":{"end_date":"2009-08-28","start_date":"2009-08-24","name":"MFCS: Mathematical Foundations of Computer Science","location":"High Tatras, Slovakia"},"title":"Stochastic games with finitary objectives","volume":5734,"publication_status":"published","_id":"4543","abstract":[{"text":"The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case.","lang":"eng"}],"date_published":"2009-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:59:35Z","scopus_import":1,"publist_id":"178","oa_version":"None","year":"2009"}]