[{"author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"full_name":"Lickly, Ben","first_name":"Ben","last_name":"Lickly"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"}],"date_created":"2018-12-11T12:05:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"3a70e21527dfaad2f198549ae5710786","creator":"system","content_type":"application/pdf","file_size":310902,"file_name":"IST-2012-70-v1+1_On_Relational_Interfaces.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:13:57Z","relation":"main_file","file_id":"5045"}],"title":"On relational interfaces","ddc":["004"],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","type":"conference","publication_status":"published","quality_controlled":"1","publisher":"ACM","oa":1,"doi":"10.1145/1629335.1629346","ec_funded":1,"date_published":"2009-01-01T00:00:00Z","citation":{"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>.","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>","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>.","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>","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.","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."},"file_date_updated":"2020-07-14T12:46:16Z","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"}],"_id":"3837","date_updated":"2024-10-21T06:03:06Z","page":"67 - 76","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. ","status":"public","pubrep_id":"70","month":"01","publication":"EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software","oa_version":"Submitted Version","scopus_import":"1","publist_id":"2360","language":[{"iso":"eng"}],"day":"01","conference":{"start_date":"2009-10-12","name":"EMSOFT: Embedded Software ","end_date":"2009-10-16","location":"Grenoble, France"},"year":"2009"},{"author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T12:05:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"3381","status":"public","relation":"later_version"}]},"file":[{"file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","checksum":"df88431872586c773fbcfea37d7b36a2","content_type":"application/pdf","file_size":222840,"creator":"system","date_created":"2018-12-12T10:08:41Z","relation":"main_file","file_id":"4702","access_level":"open_access","date_updated":"2020-07-14T12:46:16Z"}],"title":"Formalisms for specifying Markovian population models","ddc":["005"],"intvolume":"      5797","department":[{"_id":"ToHe"}],"has_accepted_license":"1","publication_status":"published","type":"conference","quality_controlled":"1","oa":1,"publisher":"Springer","doi":"10.1007/978-3-642-04420-5_2","date_published":"2009-09-07T00:00:00Z","citation":{"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>.","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>","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","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>","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>.","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."},"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"}],"file_date_updated":"2020-07-14T12:46:16Z","_id":"3841","date_updated":"2025-09-30T08:49:00Z","volume":5797,"page":"3 - 23","acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","status":"public","pubrep_id":"67","month":"09","oa_version":"Submitted Version","scopus_import":1,"publist_id":"2352","language":[{"iso":"eng"}],"day":"07","conference":{"end_date":"2009-09-25","name":"RP: Reachability Problems","start_date":"2009-09-23","location":"Palaiseau, France"},"year":"2009"},{"type":"conference","publication_status":"published","oa":1,"publisher":"IEEE","doi":"10.1109/HiBi.2009.23","quality_controlled":"1","citation":{"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.","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>.","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.","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>","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>."},"date_published":"2009-10-30T00:00:00Z","article_processing_charge":"No","_id":"3843","abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:17Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:05:28Z","author":[{"full_name":"Didier, Frédéric","first_name":"Frédéric","last_name":"Didier"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Maria","last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","full_name":"Mateescu, Maria"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"issue":"6","title":"Fast adaptive uniformization of the chemical master equation","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","date_created":"2020-05-19T16:33:55Z","relation":"main_file","file_id":"7874","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","file_size":222890,"content_type":"application/pdf","creator":"dernst","file_name":"2009_HIBI_Didier.pdf"}],"related_material":{"record":[{"relation":"later_version","id":"3842","status":"public"}]},"isi":1,"intvolume":"         4","external_id":{"isi":["000275038300017"]},"ddc":["000"],"has_accepted_license":"1","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"scopus_import":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"publist_id":"2348","day":"30","year":"2009","conference":{"name":"HIBI: High-Performance Computational Systems Biology","start_date":"2009-10-14","end_date":"2009-10-16","location":"Trento, Italy"},"date_updated":"2025-09-30T09:54:51Z","volume":4,"page":"118 - 127","month":"10","status":"public","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."},{"conference":{"location":"Washington, DC, United States","end_date":"2009-12-04","start_date":"2009-12-01","name":"RTSS: Real-Time Systems Symposium"},"year":"2009","day":"01","publist_id":"2346","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","status":"public","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","month":"01","pubrep_id":"65","page":"171 - 180","date_updated":"2025-09-30T09:54:22Z","_id":"3844","abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:17Z","ec_funded":1,"citation":{"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>","short":"T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.","ista":"Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular HTL. RTSS: Real-Time Systems Symposium, 171–180.","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>","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>.","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."},"article_processing_charge":"No","date_published":"2009-01-01T00:00:00Z","quality_controlled":"1","publisher":"IEEE","doi":"10.1109/RTSS.2009.9","oa":1,"type":"conference","publication_status":"published","department":[{"_id":"ToHe"}],"has_accepted_license":"1","ddc":["000"],"external_id":{"isi":["000277465500016"]},"file":[{"relation":"main_file","date_created":"2018-12-12T10:07:56Z","file_id":"4655","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","file_name":"IST-2012-65-v1+1_Distributed_modular_Htl.pdf","creator":"system","content_type":"application/pdf","file_size":526458,"checksum":"b2b15a5ef71eb50d62eaa5aea7efd8c4"}],"isi":1,"title":"Distributed, modular HTL","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"full_name":"Marques, Eduardo","first_name":"Eduardo","last_name":"Marques"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:05:28Z","project":[{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}]},{"page":"244 - 258","pubrep_id":"52","month":"09","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.","status":"public","date_updated":"2024-10-09T20:53:56Z","volume":5710,"day":"01","conference":{"location":"Bologna, Italy","start_date":"2009-09-01","name":"CONCUR: Concurrency Theory","end_date":"2009-09-04"},"year":"2009","scopus_import":1,"oa_version":"Submitted Version","corr_author":"1","language":[{"iso":"eng"}],"publist_id":"2304","intvolume":"      5710","ddc":["000","005"],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T12:05:37Z","project":[{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"title":"Probabilistic weighted automata","file":[{"date_updated":"2020-07-14T12:46:20Z","access_level":"open_access","date_created":"2018-12-12T10:09:46Z","file_id":"4771","relation":"main_file","file_size":200161,"creator":"system","content_type":"application/pdf","checksum":"af973ddbcf131b8810c6bff2c055ff56","file_name":"IST-2012-52-v1+1_Probabilistic_Weighted_Automata.pdf"}],"date_published":"2009-09-01T00:00:00Z","citation":{"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>","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>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.","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>.","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>"},"ec_funded":1,"file_date_updated":"2020-07-14T12:46:20Z","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"}],"_id":"3871","publication_status":"published","type":"conference","doi":"10.1007/978-3-642-04081-8_17","oa":1,"publisher":"Springer","quality_controlled":"1"},{"has_accepted_license":"1","department":[{"_id":"HeEd"}],"intvolume":"      5903","ddc":["000"],"title":"The persistent Morse complex segmentation of a 3-manifold","file":[{"date_created":"2018-12-12T10:08:33Z","file_id":"4694","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:21Z","file_name":"IST-2016-535-v1+1_2009-P-04-3ManifoldSegmentation.pdf","checksum":"11fc85bcc19bab1f020e706a4b8a4660","file_size":165090,"creator":"system","content_type":"application/pdf"}],"date_created":"2018-12-11T12:06:10Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Harer, John","first_name":"John","last_name":"Harer"}],"abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:21Z","_id":"3968","date_published":"2009-11-17T00:00:00Z","citation":{"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.","short":"H. Edelsbrunner, J. Harer, in:, Springer, 2009, pp. 36–50.","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>","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.","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>.","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>"},"oa":1,"publisher":"Springer","doi":"10.1007/978-3-642-10470-1_4","quality_controlled":"1","type":"conference","publication_status":"published","pubrep_id":"535","month":"11","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.","status":"public","page":"36 - 50","volume":5903,"date_updated":"2024-10-09T20:53:56Z","year":"2009","conference":{"location":"Zermatt, Switzerland","end_date":"2009-12-02","name":"3DPH: Modelling the Physiological Human","start_date":"2009-11-29"},"day":"17","corr_author":"1","language":[{"iso":"eng"}],"publist_id":"2160","scopus_import":1,"oa_version":"Submitted Version"},{"ddc":["570"],"external_id":{"pmid":[" 19788353"],"isi":["000271021900002"]},"intvolume":"       174","department":[{"_id":"NiBa"}],"author":[{"id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","full_name":"Polechova, Jitka","last_name":"Polechova","first_name":"Jitka","orcid":"0000-0003-0951-3112"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"last_name":"Marion","first_name":"Glenn","full_name":"Marion, Glenn"}],"issue":"5","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:07:09Z","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1086/659642"}]},"isi":1,"title":"Species' range: Adaptation in space and time","pmid":1,"citation":{"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.","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>","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>.","short":"J. Polechova, N.H. Barton, G. Marion, American Naturalist 174 (2009) E186–E204.","ista":"Polechova J, Barton NH, Marion G. 2009. Species’ range: Adaptation in space and time. American Naturalist. 174(5), E186–E204.","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>","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>."},"article_type":"original","article_processing_charge":"No","date_published":"2009-11-05T00:00:00Z","_id":"4136","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.1086/605958"}],"type":"journal_article","publication_status":"published","quality_controlled":"1","doi":"10.1086/605958","oa":1,"publisher":"University of Chicago Press","page":"E186 - E204","status":"public","month":"11","pubrep_id":"552","date_updated":"2025-09-30T09:53:09Z","volume":174,"day":"05","year":"2009","oa_version":"Published Version","publication":"American Naturalist","scopus_import":"1","publist_id":"1986","language":[{"iso":"eng"}],"corr_author":"1"},{"article_processing_charge":"No","date_published":"2009-03-01T00:00:00Z","citation":{"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.","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>","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>.","short":"N.H. Barton, H. De Vladar, Genetics 181 (2009) 997–1011.","ista":"Barton NH, De Vladar H. 2009. Statistical mechanics and the evolution of polygenic quantitative traits. Genetics. 181(3), 997–1011.","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>.","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>"},"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"}],"_id":"4231","publication_status":"published","type":"journal_article","quality_controlled":"1","publisher":"Genetics Society of America","doi":"10.1534/genetics.108.099309","external_id":{"isi":["000270213500018"]},"intvolume":"       181","department":[{"_id":"NiBa"}],"issue":"3","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"first_name":"Harold","last_name":"De Vladar","full_name":"De Vladar, Harold"}],"date_created":"2018-12-11T12:07:44Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"title":"Statistical mechanics and the evolution of polygenic quantitative traits","day":"01","year":"2009","oa_version":"None","publication":"Genetics","scopus_import":"1","publist_id":"1882","corr_author":"1","language":[{"iso":"eng"}],"page":"997 - 1011","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.” ","status":"public","month":"03","date_updated":"2025-09-30T09:52:35Z","volume":181},{"month":"05","pubrep_id":"551","status":"public","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.","page":"1171 - 1190","date_updated":"2025-09-30T09:52:11Z","volume":63,"year":"2009","day":"01","language":[{"iso":"eng"}],"corr_author":"1","publist_id":"1866","scopus_import":"1","oa_version":"Submitted Version","publication":"Evolution; International Journal of Organic Evolution","has_accepted_license":"1","department":[{"_id":"NiBa"}],"intvolume":"        63","external_id":{"isi":["000265145800006"]},"ddc":["570"],"title":"The evolution of strong reproductive isolation","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:25Z","file_id":"4903","date_created":"2018-12-12T10:11:46Z","relation":"main_file","checksum":"1920d2e25ef335833764256c1a47bbfb","file_size":720913,"content_type":"application/pdf","creator":"system","file_name":"IST-2016-551-v1+1_BartonDeCaraRevNew.pdf"},{"file_name":"IST-2016-551-v1+2_BartonDeCaraRevNewSI.pdf","content_type":"application/pdf","creator":"system","file_size":290160,"checksum":"c1c51bbc10d4f328fc96fc5b0e5dc25d","date_created":"2018-12-12T10:11:47Z","relation":"main_file","file_id":"4904","date_updated":"2020-07-14T12:46:25Z","access_level":"open_access"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:07:48Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"De Cara","first_name":"Maria","full_name":"De Cara, Maria"}],"issue":"5","_id":"4242","file_date_updated":"2020-07-14T12:46:25Z","abstract":[{"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.","lang":"eng"}],"citation":{"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>.","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.","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>","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>.","ista":"Barton NH, De Cara M. 2009. The evolution of strong reproductive isolation. Evolution; International Journal of Organic Evolution. 63(5), 1171–1190.","short":"N.H. Barton, M. De Cara, Evolution; International Journal of Organic Evolution 63 (2009) 1171–1190."},"date_published":"2009-05-01T00:00:00Z","article_processing_charge":"No","publisher":"Wiley","doi":"10.1111/j.1558-5646.2009.00622.x","oa":1,"quality_controlled":"1","publication_status":"published","type":"journal_article"},{"volume":11,"date_updated":"2026-07-07T14:02:53Z","das_tickbox":"1","pubrep_id":"53","month":"10","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.","status":"public","language":[{"iso":"eng"}],"corr_author":"1","publist_id":"2309","scopus_import":"1","publication":"ACM Transactions on Computational Logic","oa_version":"Submitted Version","year":"2009","day":"01","title":"Finitary winning in omega-regular games","isi":1,"file":[{"file_name":"IST-2012-53-v1+1_Finitary_winning_in_omega-regular_games.pdf","file_size":180082,"content_type":"application/pdf","creator":"system","checksum":"139c4586d24f11e5da31fb3a0cf96ef4","relation":"main_file","date_created":"2018-12-12T10:15:08Z","file_id":"5125","date_updated":"2020-07-14T12:46:20Z","access_level":"open_access"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:05:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Horn"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"external_id":{"isi":["000272039900001"]},"intvolume":"        11","ddc":["004"],"article_number":"1","oa":1,"doi":"10.1145/1614431.1614432","publisher":"ACM","quality_controlled":"1","type":"journal_article","publication_status":"published","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:20Z","_id":"3870","article_processing_charge":"No","date_published":"2009-10-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” <i>ACM Transactions on Computational Logic</i>. ACM, 2009. <a href=\"https://doi.org/10.1145/1614431.1614432\">https://doi.org/10.1145/1614431.1614432</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). Finitary winning in omega-regular games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/1614431.1614432\">https://doi.org/10.1145/1614431.1614432</a>","short":"K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic 11 (2009).","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic. 11(1), 1.","ama":"Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games. <i>ACM Transactions on Computational Logic</i>. 2009;11(1). doi:<a href=\"https://doi.org/10.1145/1614431.1614432\">10.1145/1614431.1614432</a>","mla":"Chatterjee, Krishnendu, et al. “Finitary Winning in Omega-Regular Games.” <i>ACM Transactions on Computational Logic</i>, vol. 11, no. 1, 1, ACM, 2009, doi:<a href=\"https://doi.org/10.1145/1614431.1614432\">10.1145/1614431.1614432</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” <i>ACM Transactions on Computational Logic</i>, vol. 11, no. 1. ACM, 2009."},"ec_funded":1},{"date_updated":"2026-04-29T07:15:43Z","volume":89,"month":"10","status":"public","page":"475 - 477","language":[{"iso":"eng"}],"publist_id":"7302","scopus_import":"1","oa_version":"None","publication":"Genetics Research","year":"2008","day":"29","title":"Identity and coalescence in structured populations: A commentary on 'Inbreeding coefficients and coalescence times' by Montgomery Slatkin","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:55Z","author":[{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"issue":"5-6","department":[{"_id":"NiBa"}],"external_id":{"isi":["000207048900023"]},"intvolume":"        89","publisher":"Cambridge University Press","doi":"10.1017/S0016672308009683","quality_controlled":"1","publication_status":"published","type":"journal_article","_id":"517","citation":{"chicago":"Barton, Nicholas H. “Identity and Coalescence in Structured Populations: A Commentary on ‘Inbreeding Coefficients and Coalescence Times’ by Montgomery Slatkin.” <i>Genetics Research</i>. Cambridge University Press, 2008. <a href=\"https://doi.org/10.1017/S0016672308009683\">https://doi.org/10.1017/S0016672308009683</a>.","apa":"Barton, N. H. (2008). Identity and coalescence in structured populations: A commentary on “Inbreeding coefficients and coalescence times” by Montgomery Slatkin. <i>Genetics Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672308009683\">https://doi.org/10.1017/S0016672308009683</a>","ista":"Barton NH. 2008. Identity and coalescence in structured populations: A commentary on ‘Inbreeding coefficients and coalescence times’ by Montgomery Slatkin. Genetics Research. 89(5–6), 475–477.","short":"N.H. Barton, Genetics Research 89 (2008) 475–477.","mla":"Barton, Nicholas H. “Identity and Coalescence in Structured Populations: A Commentary on ‘Inbreeding Coefficients and Coalescence Times’ by Montgomery Slatkin.” <i>Genetics Research</i>, vol. 89, no. 5–6, Cambridge University Press, 2008, pp. 475–77, doi:<a href=\"https://doi.org/10.1017/S0016672308009683\">10.1017/S0016672308009683</a>.","ama":"Barton NH. Identity and coalescence in structured populations: A commentary on “Inbreeding coefficients and coalescence times” by Montgomery Slatkin. <i>Genetics Research</i>. 2008;89(5-6):475-477. doi:<a href=\"https://doi.org/10.1017/S0016672308009683\">10.1017/S0016672308009683</a>","ieee":"N. H. Barton, “Identity and coalescence in structured populations: A commentary on ‘Inbreeding coefficients and coalescence times’ by Montgomery Slatkin,” <i>Genetics Research</i>, vol. 89, no. 5–6. Cambridge University Press, pp. 475–477, 2008."},"article_type":"comment","article_processing_charge":"No","date_published":"2008-10-29T00:00:00Z"}]