[{"month":"12","citation":{"ieee":"K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>The Complexity of Partial-Observation Parity Games</i>. Vol. 6397, Springer, 2010, pp. 1–14, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>.","ista":"Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.","ama":"Chatterjee K, Doyen L. The complexity of partial-observation parity games. In: Vol 6397. Springer; 2010:1-14. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>"},"doi":"10.1007/978-3-642-16242-8_1","type":"conference","abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have com- plete view of the game). We survey the complexity results for the problem of de- ciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete."}],"oa_version":"Submitted Version","day":"09","isi":1,"date_published":"2010-12-09T00:00:00Z","file":[{"access_level":"open_access","relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","creator":"dernst","file_name":"2010_LPAR_Chatterjee.pdf","date_updated":"2020-07-14T12:46:18Z","date_created":"2020-05-19T16:29:04Z","file_size":142836,"content_type":"application/pdf","file_id":"7872"}],"alternative_title":["LNCS"],"date_updated":"2025-09-30T09:34:35Z","ddc":["000"],"page":"1 - 14","external_id":{"isi":["000288062700001"]},"title":"The complexity of partial-observation parity games","quality_controlled":"1","status":"public","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","language":[{"iso":"eng"}],"_id":"3858","publist_id":"2323","article_processing_charge":"No","scopus_import":"1","date_created":"2018-12-11T12:05:33Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":6397,"file_date_updated":"2020-07-14T12:46:18Z","year":"2010","publication_status":"published","oa":1,"has_accepted_license":"1","conference":{"location":"Yogyakarta, Indonesia","end_date":"2010-10-15","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"corr_author":"1","intvolume":"      6397"},{"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2010-09-10","start_date":"2010-09-08","location":"Klosterneuburg, Austria"},"title":"Formal modeling and analysis of timed systems","corr_author":"1","intvolume":"      6246","quality_controlled":"1","status":"public","volume":6246,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_updated":"2024-10-09T20:54:05Z","year":"2010","publication_status":"published","abstract":[{"text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications.","lang":"eng"}],"oa_version":"None","publisher":"Springer","day":"20","_id":"3859","language":[{"iso":"eng"}],"date_published":"2010-09-20T00:00:00Z","publist_id":"2322","date_created":"2018-12-11T12:05:33Z","related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","relation":"other","description":"eBook available via IST BookList"}]},"citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>.","ieee":"K. Chatterjee and T. A. Henzinger, Eds., <i>Formal modeling and analysis of timed systems</i>, vol. 6246. Springer, 2010.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (Eds.). (2010). <i>Formal modeling and analysis of timed systems</i> (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>.","ama":"Chatterjee K, Henzinger TA, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol 6246. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010."},"month":"09","type":"conference_editor","doi":"10.1007/978-3-642-15297-9","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"editor":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}]},{"scopus_import":"1","article_processing_charge":"No","publist_id":"2321","date_created":"2018-12-11T12:05:34Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"3860","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"}],"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","end_date":"2010-12-18","start_date":"2010-12-15"},"corr_author":"1","intvolume":"         8","publication_status":"published","has_accepted_license":"1","oa":1,"volume":8,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2010","file_date_updated":"2020-07-14T12:46:18Z","date_published":"2010-12-13T00:00:00Z","isi":1,"file":[{"file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","date_updated":"2020-07-14T12:46:18Z","relation":"main_file","access_level":"open_access","creator":"system","checksum":"1caabd6319b979927208117a41192637","content_type":"application/pdf","file_id":"5147","file_size":178278,"date_created":"2018-12-12T10:15:27Z"},{"date_created":"2018-12-12T10:15:28Z","file_size":477976,"file_id":"5148","content_type":"application/pdf","checksum":"3a59759ceeacdb5b578f3803d5e6769b","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2016-59-v2+1_2_1_.pdf"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.","lang":"eng"}],"oa_version":"Submitted Version","day":"13","type":"conference","doi":"10.4230/LIPIcs.FSTTCS.2010.505","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Generalized Mean-Payoff and Energy Games</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516."},"month":"12","quality_controlled":"1","pubrep_id":"59","status":"public","external_id":{"isi":["000310361000043"]},"page":"505 - 516","title":"Generalized mean-payoff and energy games","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"ddc":["005"],"alternative_title":["LIPIcs"],"date_updated":"2025-09-30T09:33:50Z"},{"status":"public","pubrep_id":"56","quality_controlled":"1","title":"Strategy logic","page":"677 - 693","external_id":{"isi":["000278070100006"]},"ddc":["000","004"],"date_updated":"2025-09-30T09:32:18Z","file":[{"file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","relation":"main_file","checksum":"13bff93f3c2a014e2908145a4517f177","creator":"system","content_type":"application/pdf","file_id":"4911","file_size":189120,"date_created":"2018-12-12T10:11:54Z"}],"isi":1,"date_published":"2010-06-01T00:00:00Z","day":"01","oa_version":"Submitted Version","abstract":[{"text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).","lang":"eng"}],"doi":"10.1016/j.ic.2009.07.004","type":"journal_article","month":"06","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” <i>Information and Computation</i>, vol. 208, no. 6. Elsevier, pp. 677–693, 2010."},"publication":"Information and Computation","issue":"6","intvolume":"       208","corr_author":"1","oa":1,"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:46:18Z","year":"2010","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":208,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3884"}]},"date_created":"2018-12-11T12:05:34Z","publist_id":"2317","article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"_id":"3861","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"}]},{"scopus_import":"1","publist_id":"2319","article_processing_charge":"No","date_created":"2018-12-11T12:05:35Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3880"}]},"publisher":"Elsevier","language":[{"iso":"eng"}],"_id":"3863","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"full_name":"Berwanger, Dietmar","last_name":"Berwanger","first_name":"Dietmar"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin","full_name":"De Wulf, Martin","last_name":"De Wulf"},{"first_name":"Laurent","full_name":"Doyen, 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"}],"issue":"10","publication":"Information and Computation","intvolume":"       208","ec_funded":1,"publication_status":"published","has_accepted_license":"1","oa":1,"volume":208,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2010","file_date_updated":"2020-07-14T12:46:18Z","date_published":"2010-10-01T00:00:00Z","isi":1,"file":[{"checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","file_size":287496,"date_created":"2018-12-12T10:17:44Z","file_id":"5300","content_type":"application/pdf"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs."}],"day":"01","doi":"10.1016/j.ic.2009.09.006","type":"journal_article","citation":{"ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. 2010;208(10):1206-1220. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>.","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” <i>Information and Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>."},"month":"10","quality_controlled":"1","pubrep_id":"58","status":"public","external_id":{"isi":["000281830300007"]},"page":"1206 - 1220","title":"Strategy construction for parity games with imperfect information","ddc":["005"],"date_updated":"2026-05-29T09:53:31Z"},{"_id":"3864","language":[{"iso":"eng"}],"publisher":"Springer","related_material":{"record":[{"id":"1856","relation":"later_version","status":"public"}]},"date_created":"2018-12-11T12:05:35Z","article_processing_charge":"No","publist_id":"2313","scopus_import":"1","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","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"first_name":"Rohit","full_name":"Singh, Rohit","last_name":"Singh"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"intvolume":"      6174","corr_author":"1","conference":{"location":"Edinburgh, United Kingdom","start_date":"201-07-15","end_date":"2010-07-19","name":"CAV: Computer Aided Verification"},"year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":6174,"oa":1,"publication_status":"published","day":"09","abstract":[{"lang":"eng","text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way."}],"arxiv":1,"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"date_published":"2010-07-09T00:00:00Z","month":"07","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","mla":"Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395."},"type":"conference","doi":"10.1007/978-3-642-14295-6_34","title":"Measuring and synthesizing systems in probabilistic environments","page":"380 - 395","external_id":{"arxiv":["1004.0739"]},"status":"public","quality_controlled":"1","date_updated":"2025-09-23T09:33:01Z","alternative_title":["LNCS"],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign."},{"article_processing_charge":"No","publist_id":"2315","scopus_import":"1","date_created":"2018-12-11T12:05:35Z","publisher":"Springer","_id":"3865","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"first_name":"Vishwanath","full_name":"Raman, Vishwanath","last_name":"Raman"},{"last_name":"Sánchez","full_name":"Sánchez, César","first_name":"César"}],"publication":"13th International Conference on Fundamental Approaches to Software Engineering","conference":{"name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","end_date":"2010-03-28","start_date":"2010-03-20"},"intvolume":"      6013","publication_status":"published","OA_type":"closed access","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":6013,"year":"2010","date_published":"2010-04-21T00:00:00Z","abstract":[{"lang":"eng","text":"We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool DIRECT. Our approach uses a combination of source code instrumentation and runtime management. The source code along with a test harness is instrumented to monitor Operating System (OS) and user defined function calls. DIRECT tracks all concurrency control primitives and, optionally, data from the program. DIRECT maintains an abstract global state that combines information from every thread, including the sequence of function calls and concurrency primitives executed. The runtime manager can insert delays, provoking thread inter-leavings that may exhibit bugs that are difficult to reach otherwise. The runtime manager collects an approximation of the reachable state space and uses this approximation to assess the impact of change in a new version of the program."}],"oa_version":"None","day":"21","doi":"10.1007/978-3-642-12029-9_21","type":"conference","month":"04","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642120299"]},"citation":{"chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” In <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, 6013:293–307. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>.","apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In <i>13th International Conference on Fundamental Approaches to Software Engineering</i> (Vol. 6013, pp. 293–307). Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, 13th International Conference on Fundamental Approaches to Software Engineering, Springer, 2010, pp. 293–307.","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: <i>13th International Conference on Fundamental Approaches to Software Engineering</i>. Vol 6013. Springer; 2010:293-307. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>","ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. 13th International Conference on Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","mla":"Chatterjee, Krishnendu, et al. “Analyzing the Impact of Change in Multi-Threaded Programs.” <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, vol. 6013, Springer, 2010, pp. 293–307, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>.","ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” in <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307."},"quality_controlled":"1","status":"public","page":"293 - 307","title":"Analyzing the impact of change in multi-threaded programs","alternative_title":["LNCS"],"date_updated":"2025-05-20T06:36:30Z"},{"file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","creator":"system","checksum":"9d204611c8d7855bed8134f8708a0010","relation":"main_file","access_level":"open_access","file_id":"5243","content_type":"application/pdf","date_created":"2018-12-12T10:16:52Z","file_size":213083}],"date_published":"2010-07-01T00:00:00Z","day":"01","abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"oa_version":"Submitted Version","editor":[{"first_name":"Tayssir","last_name":"Touili","full_name":"Touili, Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"last_name":"Jackson","full_name":"Jackson, Paul","first_name":"Paul"}],"type":"conference","doi":"10.1007/978-3-642-14295-6_36","month":"07","citation":{"ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>"},"status":"public","pubrep_id":"54","quality_controlled":"1","title":"Robustness in the presence of liveness","page":"410 - 424","ddc":["004"],"date_updated":"2021-01-12T07:52:47Z","alternative_title":["LNCS"],"date_created":"2018-12-11T12:05:36Z","publist_id":"2310","scopus_import":1,"language":[{"iso":"eng"}],"_id":"3866","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Greimel","full_name":"Greimel, Karin","first_name":"Karin"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"intvolume":"      6174","conference":{"name":"CAV: Computer Aided Verification","start_date":"2010-07-15","end_date":"2010-07-19","location":"Edinburgh, UK"},"oa":1,"has_accepted_license":"1","publication_status":"published","ec_funded":1,"file_date_updated":"2020-07-14T12:46:19Z","year":"2010","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":6174},{"quality_controlled":"1","pubrep_id":"536","status":"public","external_id":{"isi":["000283758600045"]},"page":"1251 - 1260","title":"Computing robustness and persistence for images","ddc":["000"],"date_updated":"2025-09-30T09:30:22Z","date_published":"2010-10-28T00:00:00Z","isi":1,"file":[{"date_updated":"2020-07-14T12:46:21Z","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","creator":"system","checksum":"f6d813c04f4b46023cec6b9a17f15472","relation":"main_file","access_level":"open_access","file_id":"5262","content_type":"application/pdf","file_size":721994,"date_created":"2018-12-12T10:17:10Z"}],"oa_version":"Submitted Version","abstract":[{"text":"We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems.","lang":"eng"}],"day":"28","doi":"10.1109/TVCG.2010.139","type":"journal_article","citation":{"ieee":"P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.","mla":"Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>.","ama":"Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. 2010;16(6):1251-1260. doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>","ista":"Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.","apa":"Bendich, P., Edelsbrunner, H., &#38; Kerber, M. (2010). Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>","chicago":"Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE, 2010. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>."},"month":"10","issue":"6","publication":"IEEE Transactions of Visualization and Computer Graphics","intvolume":"        16","corr_author":"1","publication_status":"published","has_accepted_license":"1","oa":1,"volume":16,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2010","file_date_updated":"2020-07-14T12:46:21Z","scopus_import":"1","publist_id":"2253","article_processing_charge":"No","date_created":"2018-12-11T12:05:47Z","publisher":"IEEE","_id":"3901","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"author":[{"first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul","last_name":"Bendich"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","full_name":"Kerber, Michael"}]},{"month":"07","publication_identifier":{"issn":["2663-337X"]},"author":[{"full_name":"Pflicke, Holger","last_name":"Pflicke","id":"CAA57A9A-5B61-11E9-B130-E0C1E1F2C83D","first_name":"Holger"}],"citation":{"mla":"Pflicke, Holger. <i>  Dendritic Cell Migration across Basement Membranes in the Skin</i>. Institute of Science and Technology Austria, 2010.","ieee":"H. Pflicke, “  Dendritic cell migration across basement membranes in the skin,” Institute of Science and Technology Austria, 2010.","apa":"Pflicke, H. (2010). <i>  Dendritic cell migration across basement membranes in the skin</i>. Institute of Science and Technology Austria.","chicago":"Pflicke, Holger. “  Dendritic Cell Migration across Basement Membranes in the Skin.” Institute of Science and Technology Austria, 2010.","short":"H. Pflicke,   Dendritic Cell Migration across Basement Membranes in the Skin, Institute of Science and Technology Austria, 2010.","ista":"Pflicke H. 2010.   Dendritic cell migration across basement membranes in the skin. Institute of Science and Technology Austria.","ama":"Pflicke H.   Dendritic cell migration across basement membranes in the skin. 2010."},"department":[{"_id":"CaHe"},{"_id":"GradSch"}],"type":"dissertation","oa_version":"None","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"_id":"3962","day":"01","publist_id":"2165","article_processing_charge":"No","date_published":"2010-07-01T00:00:00Z","date_created":"2018-12-11T12:06:08Z","degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"date_updated":"2026-04-09T14:37:07Z","year":"2010","publication_status":"published","corr_author":"1","title":"Dendritic cell migration across basement membranes in the skin","OA_place":"publisher","supervisor":[{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"status":"public"},{"author":[{"first_name":"Jon","full_name":"Bridle, Jon","last_name":"Bridle"},{"last_name":"Polechova","full_name":"Polechova, Jitka","orcid":"0000-0003-0951-3112","first_name":"Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kawata","full_name":"Kawata, Masakado","first_name":"Masakado"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"}],"department":[{"_id":"NiBa"}],"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"_id":"4134","publisher":"Wiley-Blackwell","date_created":"2018-12-11T12:07:08Z","article_processing_charge":"No","publist_id":"1987","scopus_import":"1","year":"2010","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":13,"publication_status":"published","ec_funded":1,"intvolume":"        13","publication":"Ecology Letters","issue":"4","month":"03","citation":{"mla":"Bridle, Jon, et al. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>, vol. 13, no. 4, Wiley-Blackwell, 2010, pp. 485–94, doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>.","ieee":"J. Bridle, J. Polechova, M. Kawata, and R. Butlin, “Why is adaptation prevented at ecological margins? New insights from individual-based simulations,” <i>Ecology Letters</i>, vol. 13, no. 4. Wiley-Blackwell, pp. 485–494, 2010.","apa":"Bridle, J., Polechova, J., Kawata, M., &#38; Butlin, R. (2010). Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>","chicago":"Bridle, Jon, Jitka Polechova, Masakado Kawata, and Roger Butlin. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>.","ama":"Bridle J, Polechova J, Kawata M, Butlin R. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. 2010;13(4):485-494. doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>","ista":"Bridle J, Polechova J, Kawata M, Butlin R. 2010. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. Ecology Letters. 13(4), 485–494.","short":"J. Bridle, J. Polechova, M. Kawata, R. Butlin, Ecology Letters 13 (2010) 485–494."},"doi":"10.1111/j.1461-0248.2010.01442.x","type":"journal_article","day":"15","abstract":[{"lang":"eng","text":"All species are restricted in their distribution. Currently, ecological models can only explain such limits if patches vary in quality, leading to asymmetrical dispersal, or if genetic variation is too low at the margins for adaptation. However, population genetic models suggest that the increase in genetic variance resulting from dispersal should allow adaptation to almost any ecological gradient. Clearly therefore, these models miss something that prevents evolution in natural populations. We developed an individual-based simulation to explore stochastic effects in these models. At high carrying capacities, our simulations largely agree with deterministic predictions. However, when carrying capacity is low, the population fails to establish for a wide range of parameter values where adaptation was expected from previous models. Stochastic or transient effects appear critical around the boundaries in parameter space between simulation behaviours. Dispersal, gradient steepness, and population density emerge as key factors determining adaptation on an ecological gradient. "}],"oa_version":"None","isi":1,"date_published":"2010-03-15T00:00:00Z","date_updated":"2025-09-30T09:29:55Z","acknowledgement":"We are very grateful to Nick Barton.","title":"Why is adaptation prevented at ecological margins? New insights from individual-based simulations","page":"485 - 494","external_id":{"isi":["000275635400008"]},"status":"public","quality_controlled":"1"},{"intvolume":"        29","issue":"16","publication":"EMBO Journal","volume":29,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2010","publication_status":"published","oa":1,"publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"_id":"4157","scopus_import":"1","article_processing_charge":"No","publist_id":"1962","date_created":"2018-12-11T12:07:17Z","author":[{"id":"41DB591E-F248-11E8-B48F-1D18A9856A87","first_name":"Ekaterina","last_name":"Papusheva","full_name":"Papusheva, Ekaterina"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"}],"department":[{"_id":"Bio"},{"_id":"CaHe"}],"external_id":{"pmid":["20717145"],"isi":["000281006400009"]},"page":"2753 - 2768","title":"Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis","quality_controlled":"1","status":"public","date_updated":"2025-09-30T09:29:30Z","abstract":[{"text":"Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis, allowing cells and tissues to change shape without loosing integrity. Studies predominantly in cell culture showed that mechanosensation through adhesion structures is achieved by force-mediated modulation of their molecular composition. The specific molecular composition of adhesion sites in turn determines their signalling activity and dynamic reorganization. Here, we will review how adhesion sites respond to mecanical stimuli, and how spatially and temporally regulated signalling from different adhesion sites controls cell migration and tissue morphogenesis.","lang":"eng"}],"oa_version":"Submitted Version","acknowledged_ssus":[{"_id":"Bio"}],"day":"18","pmid":1,"date_published":"2010-08-18T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/"}],"isi":1,"citation":{"ama":"Papusheva E, Heisenberg C-PJ. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. 2010;29(16):2753-2768. doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>","short":"E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.","ista":"Papusheva E, Heisenberg C-PJ. 2010. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. EMBO Journal. 29(16), 2753–2768.","apa":"Papusheva, E., &#38; Heisenberg, C.-P. J. (2010). Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>","chicago":"Papusheva, Ekaterina, and Carl-Philipp J Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>.","ieee":"E. Papusheva and C.-P. J. Heisenberg, “Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis,” <i>EMBO Journal</i>, vol. 29, no. 16. Wiley-Blackwell, pp. 2753–2768, 2010.","mla":"Papusheva, Ekaterina, and Carl-Philipp J. Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>, vol. 29, no. 16, Wiley-Blackwell, 2010, pp. 2753–68, doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>."},"month":"08","type":"journal_article","doi":"10.1038/emboj.2010.182"},{"issue":"7","publication":"Electronic Journal of Probability","intvolume":"        15","publication_status":"published","has_accepted_license":"1","oa":1,"volume":15,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2010","file_date_updated":"2020-07-14T12:46:26Z","scopus_import":"1","publist_id":"1863","article_processing_charge":"No","date_created":"2018-12-11T12:07:48Z","publisher":"Institute of Mathematical Statistics","_id":"4243","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"author":[{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"}],"quality_controlled":"1","pubrep_id":"369","status":"public","external_id":{"isi":["000274822400001"]},"page":"162 - 216","title":"A new model for evolution in a spatial continuum","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["576"],"date_updated":"2025-09-30T09:28:54Z","date_published":"2010-02-03T00:00:00Z","isi":1,"file":[{"content_type":"application/pdf","file_id":"5140","file_size":450171,"date_created":"2018-12-12T10:15:21Z","file_name":"IST-2015-369-v1+1_741-2535-1-PB.pdf","date_updated":"2020-07-14T12:46:26Z","access_level":"open_access","relation":"main_file","checksum":"bab577546dd4e8f882e9a9dd645cd01e","creator":"system"}],"license":"https://creativecommons.org/licenses/by/4.0/","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We investigate a new model for populations evolving in a spatial continuum. This model can be thought of as a spatial version of the Lambda-Fleming-Viot process. It explicitly incorporates both small scale reproduction events and large scale extinction-recolonisation events. The lineages ancestral to a sample from a population evolving according to this model can be described in terms of a spatial version of the Lambda-coalescent. Using a technique of Evans (1997), we prove existence and uniqueness in law for the model. We then investigate the asymptotic behaviour of the genealogy of a finite number of individuals sampled uniformly at random (or more generally `far enough apart') from a two-dimensional torus of sidelength L as L tends to infinity. Under appropriate conditions (and on a suitable timescale) we can obtain as limiting genealogical processes a Kingman coalescent, a more general Lambda-coalescent or a system of coalescing Brownian motions (with a non-local coalescence mechanism)."}],"day":"03","type":"journal_article","doi":"10.1214/EJP.v15-741","citation":{"ieee":"N. H. Barton, A. Etheridge, and A. Véber, “A new model for evolution in a spatial continuum,” <i>Electronic Journal of Probability</i>, vol. 15, no. 7. Institute of Mathematical Statistics, pp. 162–216, 2010.","mla":"Barton, Nicholas H., et al. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>, vol. 15, no. 7, Institute of Mathematical Statistics, 2010, pp. 162–216, doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>.","ista":"Barton NH, Etheridge A, Véber A. 2010. A new model for evolution in a spatial continuum. Electronic Journal of Probability. 15(7), 162–216.","ama":"Barton NH, Etheridge A, Véber A. A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. 2010;15(7):162-216. doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>","short":"N.H. Barton, A. Etheridge, A. Véber, Electronic Journal of Probability 15 (2010) 162–216.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2010. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>.","apa":"Barton, N. H., Etheridge, A., &#38; Véber, A. (2010). A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>"},"month":"02"},{"date_published":"2010-08-30T00:00:00Z","isi":1,"file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","creator":"system","checksum":"0243da726476817f2ea33b48b78be696","relation":"main_file","access_level":"open_access","file_id":"5312","content_type":"application/pdf","file_size":216598,"date_created":"2018-12-12T10:17:54Z"},{"content_type":"application/pdf","file_id":"5313","date_created":"2018-12-12T10:17:55Z","file_size":302416,"file_name":"IST-2016-55-v2+1_1007.4018.pdf","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","relation":"main_file","checksum":"5e512b8503a9cb263de26331c4ee9cf2","creator":"system"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","oa_version":"Published Version","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"day":"30","doi":"10.2168/LMCS-6(3:10)2010","type":"journal_article","citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation for Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation for Computational Logic, pp. 1–23, 2010."},"month":"08","quality_controlled":"1","pubrep_id":"504","status":"public","external_id":{"isi":["000282653500010"]},"page":"1 - 23","title":"Expressiveness and closure properties for quantitative languages","tmp":{"short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"ddc":["000","004"],"date_updated":"2026-07-06T13:24:40Z","scopus_import":"1","article_processing_charge":"No","publist_id":"2311","date_created":"2018-12-11T12:05:36Z","related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"das_tickbox":"1","publisher":"International Federation for Computational Logic","_id":"3867","language":[{"iso":"eng"}],"project":[{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"issue":"3","publication":"Logical Methods in Computer Science","corr_author":"1","intvolume":"         6","ec_funded":1,"publication_status":"published","has_accepted_license":"1","oa":1,"volume":6,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2010","file_date_updated":"2020-07-14T12:46:19Z"},{"department":[{"_id":"KrCh"}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"},{"first_name":"Vishwanath","last_name":"Raman","full_name":"Raman, Vishwanath"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3504"}]},"date_created":"2018-12-11T12:05:36Z","publist_id":"2312","article_processing_charge":"No","scopus_import":"1","_id":"3868","language":[{"iso":"eng"}],"publisher":"International Federation for Computational Logic","das_tickbox":"1","oa":1,"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:46:19Z","year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":6,"publication":"Logical Methods in Computer Science","issue":"3","corr_author":"1","intvolume":"         6","type":"journal_article","doi":"10.2168/LMCS-6(3:13)2010","month":"09","citation":{"ieee":"K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation for Computational Logic, pp. 1–27, 2010.","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation for Computational Logic, 2010, pp. 1–27, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>.","ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.","ama":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-27. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>","short":"K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.","apa":"Chatterjee, K., De Alfaro, L., Majumdar, R., &#38; Raman, V. (2010). Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>."},"file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2015-370-v1+1_0809.4326.pdf","checksum":"a18988135fef3016c93808ecb15b55f5","creator":"system","access_level":"open_access","relation":"main_file","file_id":"4671","content_type":"application/pdf","date_created":"2018-12-12T10:08:11Z","file_size":346527}],"isi":1,"date_published":"2010-09-01T00:00:00Z","day":"01","abstract":[{"text":"Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative mu-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n(4)) for both turn-based games and MDPs; improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance be tween states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time complexity, improving the previously known reduction, which yielded O(vertical bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms can be iterated to approximate the metrics using binary search","lang":"eng"}],"oa_version":"Published Version","ddc":["000"],"tmp":{"short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"date_updated":"2026-07-06T13:25:11Z","status":"public","pubrep_id":"370","quality_controlled":"1","title":"Algorithms for game metrics","page":"1 - 27","external_id":{"isi":["000282653500013"]}},{"date_published":"2010-12-31T00:00:00Z","oa_version":"None","abstract":[{"lang":"eng","text":"In cortex surface segmentation, the extracted surface is required to have a particular topology, namely, a two-sphere. We present a new method for removing topology noise of a curve or surface within the level set framework, and thus produce a cortical surface with correct topology. We define a new energy term which quantifies topology noise. We then show how to minimize this term by computing its functional derivative with respect to the level set function. This method differs from existing methods in that it is inherently continuous and not digital; and in the way that our energy directly relates to the topology of the underlying curve or surface, versus existing knot-based measures which are related in a more indirect fashion. The proposed flow is validated empirically."}],"day":"31","type":"conference","doi":"10.1007/978-3-642-18421-5_4","month":"12","citation":{"apa":"Chen, C., &#38; Freedman, D. (2010). Topology noise removal for curve  and surface evolution. In <i>Conference proceedings MCV 2010</i> (Vol. 6533, pp. 31–42). Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">https://doi.org/10.1007/978-3-642-18421-5_4</a>","chicago":"Chen, Chao, and Daniel Freedman. “Topology Noise Removal for Curve  and Surface Evolution.” In <i>Conference Proceedings MCV 2010</i>, 6533:31–42. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">https://doi.org/10.1007/978-3-642-18421-5_4</a>.","ama":"Chen C, Freedman D. Topology noise removal for curve  and surface evolution. In: <i>Conference Proceedings MCV 2010</i>. Vol 6533. Springer; 2010:31-42. doi:<a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">10.1007/978-3-642-18421-5_4</a>","ista":"Chen C, Freedman D. 2010. Topology noise removal for curve  and surface evolution. Conference proceedings MCV 2010. MCV: Medical Computer Vision, LNCS, vol. 6533, 31–42.","short":"C. Chen, D. Freedman, in:, Conference Proceedings MCV 2010, Springer, 2010, pp. 31–42.","mla":"Chen, Chao, and Daniel Freedman. “Topology Noise Removal for Curve  and Surface Evolution.” <i>Conference Proceedings MCV 2010</i>, vol. 6533, Springer, 2010, pp. 31–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">10.1007/978-3-642-18421-5_4</a>.","ieee":"C. Chen and D. Freedman, “Topology noise removal for curve  and surface evolution,” in <i>Conference proceedings MCV 2010</i>, Beijing, China, 2010, vol. 6533, pp. 31–42."},"quality_controlled":"1","status":"public","page":"31 - 42","title":"Topology noise removal for curve  and surface evolution","alternative_title":["LNCS"],"acknowledgement":"Partially supported by the Austri an Science Fund unde r grant P20134-N13.\r\nWe thank Helena Molina-Abril for very helpful discussion. We thank anonymous reviewers for helpful comments.","date_updated":"2026-07-07T13:07:08Z","publist_id":"2445","article_processing_charge":"No","scopus_import":"1","date_created":"2018-12-11T12:05:08Z","publisher":"Springer","_id":"3782","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"author":[{"full_name":"Chen, Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao"},{"last_name":"Freedman","full_name":"Freedman, Daniel","first_name":"Daniel"}],"publication":"Conference proceedings MCV 2010","conference":{"location":"Beijing, China","end_date":"2010-09-20","start_date":"2010-09-20","name":"MCV: Medical Computer Vision"},"intvolume":"      6533","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":6533,"year":"2010"},{"day":"09","abstract":[{"text":"The development of multicellular organisms is dependent on the tight coordination between tissue growth and morphogenesis. The stereotypical orientation of cell divisions has been proposed to be a fundamental mechanism by which proliferating and growing tissues take shape. However, the actual contribution of stereotypical division orientation (SDO) to tissue morphogenesis is unclear. In zebrafish, cell divisions with stereotypical orientation have been implicated in both body-axis elongation and neural rod formation [1, 2], although there is little direct evidence for a critical function of SDO in either of these processes. Here we show that SDO is required for formation of the neural rod midline during neurulation but dispensable for elongation of the body axis during gastrulation. Our data indicate that SDO during both gastrulation and neurulation is dependent on the noncanonical Wnt receptor Frizzled 7 (Fz7) and that interfering with cell division orientation leads to severe defects in neural rod midline formation but not body-axis elongation. These findings suggest a novel function for Fz7-controlled cell division orientation in neural rod midline formation during neurulation. ","lang":"eng"}],"oa_version":"Published Version","date_published":"2010-11-09T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2010.10.009"}],"isi":1,"citation":{"mla":"Quesada-Hernández, Elena, et al. “Stereotypical Cell Division Orientation Controls Neural Rod Midline Formation in Zebrafish.” <i>Current Biology</i>, vol. 20, no. 21, Cell Press, 2010, pp. 1966–72, doi:<a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">10.1016/j.cub.2010.10.009</a>.","ieee":"E. Quesada-Hernández <i>et al.</i>, “Stereotypical cell division orientation controls neural rod midline formation in zebrafish,” <i>Current Biology</i>, vol. 20, no. 21. Cell Press, pp. 1966–1972, 2010.","chicago":"Quesada-Hernández, Elena, Luca Caneparo, Sylvia Schneider, Sylke Winkler, Michael Liebling, Scott Fraser, and Carl-Philipp J Heisenberg. “Stereotypical Cell Division Orientation Controls Neural Rod Midline Formation in Zebrafish.” <i>Current Biology</i>. Cell Press, 2010. <a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">https://doi.org/10.1016/j.cub.2010.10.009</a>.","apa":"Quesada-Hernández, E., Caneparo, L., Schneider, S., Winkler, S., Liebling, M., Fraser, S., &#38; Heisenberg, C.-P. J. (2010). Stereotypical cell division orientation controls neural rod midline formation in zebrafish. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">https://doi.org/10.1016/j.cub.2010.10.009</a>","short":"E. Quesada-Hernández, L. Caneparo, S. Schneider, S. Winkler, M. Liebling, S. Fraser, C.-P.J. Heisenberg, Current Biology 20 (2010) 1966–1972.","ama":"Quesada-Hernández E, Caneparo L, Schneider S, et al. Stereotypical cell division orientation controls neural rod midline formation in zebrafish. <i>Current Biology</i>. 2010;20(21):1966-1972. doi:<a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">10.1016/j.cub.2010.10.009</a>","ista":"Quesada-Hernández E, Caneparo L, Schneider S, Winkler S, Liebling M, Fraser S, Heisenberg C-PJ. 2010. Stereotypical cell division orientation controls neural rod midline formation in zebrafish. Current Biology. 20(21), 1966–1972."},"month":"11","type":"journal_article","doi":"10.1016/j.cub.2010.10.009","title":"Stereotypical cell division orientation controls neural rod midline formation in zebrafish","external_id":{"isi":["000284193900032"]},"page":"1966 - 1972","status":"public","quality_controlled":"1","OA_place":"publisher","date_updated":"2026-07-28T08:03:47Z","acknowledgement":"This work was supported by grants from the Fundacion Caja Madrid to E.Q.H. and the Institute of Science and Technology Austria, the Max-Planck-Society, and the Deutsche Forschungsgemeinschaft to C.P.H.\r\nWe are grateful to Jon Clarke, Andy Oates, and Garrett Greenan for reading earlier versions of this manuscript. We thank J. Peychl, H. Ibarra, and P. Pitrone for excellent assistance and advice in multi-photon microscopy and D. White for assistance during the image-processing steps. We also thank D. Panhans for technical assistance, the whole Heisenberg laboratory for useful comments and discussions, and E. Lehmann, J. Hückmann, and G. Junghans for excellent fish care. ","article_type":"original","_id":"3789","language":[{"iso":"eng"}],"das_tickbox":"1","publisher":"Cell Press","date_created":"2018-12-11T12:05:11Z","scopus_import":"1","article_processing_charge":"No","publist_id":"2438","author":[{"first_name":"Elena","id":"EA35229E-E909-11E9-8DF8-C90C5D5AF86E","last_name":"Quesada-Hernández","full_name":"Quesada-Hernández, Elena"},{"last_name":"Caneparo","full_name":"Caneparo, Luca","first_name":"Luca"},{"id":"1FAC36B0-E90A-11E9-9D2F-EF31CE0C9C2F","first_name":"Sylvia","last_name":"Schneider","full_name":"Schneider, Sylvia"},{"last_name":"Winkler","full_name":"Winkler, Sylke","first_name":"Sylke"},{"full_name":"Liebling, Michael","last_name":"Liebling","first_name":"Michael"},{"full_name":"Fraser, Scott","last_name":"Fraser","first_name":"Scott"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"department":[{"_id":"CaHe"}],"corr_author":"1","intvolume":"        20","publication":"Current Biology","issue":"21","year":"2010","volume":20,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"free access","oa":1,"publication_status":"published"},{"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.","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>","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>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.","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."},"month":"09","doi":"10.1007/978-3-642-03409-1_2","type":"conference","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."}],"oa_version":"Submitted Version","day":"10","date_published":"2009-09-10T00:00:00Z","file":[{"checksum":"e8f53abb63579de3f2bff58b2a1188e2","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:31Z","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf","file_size":164428,"date_created":"2018-12-12T10:15:09Z","file_id":"5126","content_type":"application/pdf"}],"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.","alternative_title":["LNCS"],"date_updated":"2024-10-09T20:53:55Z","ddc":["004"],"page":"3 - 13","title":"Alternating weighted automata","quality_controlled":"1","pubrep_id":"39","status":"public","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"project":[{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","language":[{"iso":"eng"}],"_id":"4542","scopus_import":1,"publist_id":"180","date_created":"2018-12-11T12:09:23Z","volume":5699,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","file_date_updated":"2020-07-14T12:46:31Z","ec_funded":1,"publication_status":"published","has_accepted_license":"1","oa":1,"conference":{"start_date":"2009-09-02","end_date":"2009-09-04","location":"Wroclaw, Poland","name":"FCT: Fundamentals of Computation Theory"},"intvolume":"      5699","corr_author":"1"},{"doi":"10.1007/978-3-642-03816-7_4","type":"conference","month":"08","citation":{"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>","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 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>.","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>","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.","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>."},"date_published":"2009-08-01T00:00:00Z","oa_version":"None","abstract":[{"lang":"eng","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."}],"day":"01","alternative_title":["LNCS"],"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.","date_updated":"2024-10-09T20:53:54Z","quality_controlled":"1","status":"public","page":"34 - 54","title":"Stochastic games with finitary objectives","department":[{"_id":"KrCh"}],"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Horn","full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"publist_id":"178","scopus_import":1,"date_created":"2018-12-11T12:09:24Z","publisher":"Springer","_id":"4543","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":5734,"year":"2009","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","location":"High Tatras, Slovakia","start_date":"2009-08-24","end_date":"2009-08-28"},"corr_author":"1","intvolume":"      5734"},{"intvolume":"      5556","corr_author":"1","conference":{"end_date":"2009-07-12","start_date":"2009-07-05","location":"Rhodos, Greece","name":"ICALP: Automata, Languages and Programming"},"year":"2009","file_date_updated":"2020-07-14T12:46:31Z","volume":5556,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa":1,"ec_funded":1,"publication_status":"published","_id":"4545","language":[{"iso":"eng"}],"publisher":"Springer","date_created":"2018-12-11T12:09:24Z","scopus_import":1,"publist_id":"177","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"KrCh"}],"title":"A survey of stochastic games with limsup and liminf objectives","page":"1 - 15","pubrep_id":"38","status":"public","quality_controlled":"1","date_updated":"2024-10-09T20:53:54Z","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, 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.","alternative_title":["LNCS"],"ddc":["000","005"],"day":"24","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. "}],"file":[{"date_created":"2018-12-12T10:13:11Z","file_size":187419,"content_type":"application/pdf","file_id":"4992","access_level":"open_access","relation":"main_file","checksum":"dabb6d24428a000254c95493d9c492e6","creator":"system","file_name":"IST-2012-38-v1+1_A_survey_of_stochastic_games_with_limsup_and_liminf_objectives.pdf","date_updated":"2020-07-14T12:46:31Z"}],"date_published":"2009-06-24T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>A Survey of Stochastic Games with Limsup and Liminf Objectives</i>. Vol. 5556, Springer, 2009, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.","ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives. In: Vol 5556. Springer; 2009:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15."},"month":"06","doi":"10.1007/978-3-642-02930-1_1","type":"conference"}]