[{"abstract":[{"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.","lang":"eng"}],"oa_version":"None","type":"conference","status":"public","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"full_name":"Raman, Vishwanath","first_name":"Vishwanath","last_name":"Raman"},{"full_name":"Sánchez, César","first_name":"César","last_name":"Sánchez"}],"date_created":"2018-12-11T12:05:35Z","title":"Analyzing the impact of change in multi-threaded programs","_id":"3865","date_updated":"2025-05-20T06:36:30Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"293 - 307","citation":{"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>","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>.","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.","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.","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.","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>","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>."},"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642120299"]},"scopus_import":"1","publication":"13th International Conference on Fundamental Approaches to Software Engineering","publist_id":"2315","language":[{"iso":"eng"}],"OA_type":"closed access","intvolume":"      6013","publication_status":"published","quality_controlled":"1","year":"2010","fulldoi":"https://doi.org/10.1007/978-3-642-12029-9_21","article_processing_charge":"No","conference":{"name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","end_date":"2010-03-28","location":"Paphos, Cyprus"},"date_published":"2010-04-21T00:00:00Z","alternative_title":["LNCS"],"publisher":"Springer","month":"04","department":[{"_id":"KrCh"}],"day":"21","doi":"10.1007/978-3-642-12029-9_21","volume":6013},{"doi":"10.1007/978-3-642-14295-6_36","file":[{"file_id":"5243","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_size":213083,"date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","access_level":"open_access","creator":"system","relation":"main_file"}],"volume":6174,"oa":1,"pubrep_id":"54","day":"01","publisher":"Springer","month":"07","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"conference":{"start_date":"2010-07-15","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","location":"Edinburgh, UK"},"has_accepted_license":"1","date_published":"2010-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:19Z","alternative_title":["LNCS"],"fulldoi":"https://doi.org/10.1007/978-3-642-14295-6_36","ddc":["004"],"editor":[{"full_name":"Touili, Tayssir","first_name":"Tayssir","last_name":"Touili"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","last_name":"Jackson","first_name":"Paul"}],"intvolume":"      6174","publication_status":"published","year":"2010","quality_controlled":"1","publist_id":"2310","language":[{"iso":"eng"}],"scopus_import":1,"ec_funded":1,"citation":{"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>","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>","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>.","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.","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.","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."},"page":"410 - 424","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2021-01-12T07:52:47Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","date_created":"2018-12-11T12:05:36Z","author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Karin","last_name":"Greimel","full_name":"Greimel, Karin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"}],"title":"Robustness in the presence of liveness","_id":"3866","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","type":"conference"},{"fulldoi":"https://doi.org/10.1109/TVCG.2010.139","date_published":"2010-10-28T00:00:00Z","file_date_updated":"2020-07-14T12:46:21Z","has_accepted_license":"1","article_processing_charge":"No","year":"2010","quality_controlled":"1","publication_status":"published","intvolume":"        16","ddc":["000"],"volume":16,"file":[{"checksum":"f6d813c04f4b46023cec6b9a17f15472","date_created":"2018-12-12T10:17:10Z","creator":"system","relation":"main_file","access_level":"open_access","file_id":"5262","file_size":721994,"file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","date_updated":"2020-07-14T12:46:21Z","content_type":"application/pdf"}],"doi":"10.1109/TVCG.2010.139","isi":1,"external_id":{"isi":["000283758600045"]},"month":"10","department":[{"_id":"HeEd"}],"publisher":"IEEE","day":"28","pubrep_id":"536","oa":1,"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T09:30:22Z","page":"1251 - 1260","citation":{"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>","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>.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.","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.","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.","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>.","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>"},"type":"journal_article","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"}],"_id":"3901","title":"Computing robustness and persistence for images","date_created":"2018-12-11T12:05:47Z","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Bendich","full_name":"Bendich, Paul"},{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publist_id":"2253","language":[{"iso":"eng"}],"publication":"IEEE Transactions of Visualization and Computer Graphics","issue":"6","scopus_import":"1"},{"language":[{"iso":"eng"}],"publist_id":"2165","OA_place":"publisher","month":"07","department":[{"_id":"CaHe"},{"_id":"GradSch"}],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","corr_author":"1","day":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-09T14:37:07Z","degree_awarded":"PhD","article_processing_charge":"No","citation":{"chicago":"Pflicke, Holger. “  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.","ama":"Pflicke H.   Dendritic cell migration across basement membranes in the skin. 2010.","mla":"Pflicke, Holger. <i>  Dendritic Cell Migration across Basement Membranes in the Skin</i>. 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.","ieee":"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."},"alternative_title":["ISTA Thesis"],"date_published":"2010-07-01T00:00:00Z","year":"2010","type":"dissertation","supervisor":[{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","publication_status":"published","status":"public","date_created":"2018-12-11T12:06:08Z","author":[{"full_name":"Pflicke, Holger","id":"CAA57A9A-5B61-11E9-B130-E0C1E1F2C83D","last_name":"Pflicke","first_name":"Holger"}],"_id":"3962","title":"Dendritic cell migration across basement membranes in the skin"},{"publication_status":"published","quality_controlled":"1","year":"2010","intvolume":"        13","fulldoi":"https://doi.org/10.1111/j.1461-0248.2010.01442.x","date_published":"2010-03-15T00:00:00Z","article_processing_charge":"No","external_id":{"isi":["000275635400008"]},"publisher":"Wiley-Blackwell","month":"03","department":[{"_id":"NiBa"}],"day":"15","volume":13,"doi":"10.1111/j.1461-0248.2010.01442.x","isi":1,"oa_version":"None","type":"journal_article","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. "}],"title":"Why is adaptation prevented at ecological margins? New insights from individual-based simulations","_id":"4134","status":"public","date_created":"2018-12-11T12:07:08Z","author":[{"full_name":"Bridle, Jon","first_name":"Jon","last_name":"Bridle"},{"full_name":"Polechova, Jitka","orcid":"0000-0003-0951-3112","last_name":"Polechova","first_name":"Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kawata, Masakado","last_name":"Kawata","first_name":"Masakado"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"}],"date_updated":"2025-09-30T09:29:55Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"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>.","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.","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.","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>.","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>"},"page":"485 - 494","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"ec_funded":1,"acknowledgement":"We are very grateful to Nick Barton.","publication":"Ecology Letters","scopus_import":"1","issue":"4","language":[{"iso":"eng"}],"publist_id":"1987"},{"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>","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>.","short":"E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.","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.","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.","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>.","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>"},"page":"2753 - 2768","date_updated":"2025-09-30T09:29:30Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis","_id":"4157","author":[{"full_name":"Papusheva, Ekaterina","last_name":"Papusheva","first_name":"Ekaterina","id":"41DB591E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"status":"public","date_created":"2018-12-11T12:07:17Z","type":"journal_article","oa_version":"Submitted Version","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"}],"publist_id":"1962","language":[{"iso":"eng"}],"publication":"EMBO Journal","scopus_import":"1","issue":"16","date_published":"2010-08-18T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1038/emboj.2010.182","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/","open_access":"1"}],"acknowledged_ssus":[{"_id":"Bio"}],"publication_status":"published","pmid":1,"year":"2010","quality_controlled":"1","intvolume":"        29","isi":1,"volume":29,"doi":"10.1038/emboj.2010.182","day":"18","oa":1,"external_id":{"isi":["000281006400009"],"pmid":["20717145"]},"publisher":"Wiley-Blackwell","month":"08","department":[{"_id":"Bio"},{"_id":"CaHe"}]},{"license":"https://creativecommons.org/licenses/by/4.0/","page":"162 - 216","citation":{"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>","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>.","short":"N.H. Barton, A. Etheridge, A. Véber, Electronic Journal of Probability 15 (2010) 162–216.","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.","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.","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>","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>."},"date_updated":"2025-09-30T09:28:54Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"A new model for evolution in a spatial continuum","_id":"4243","date_created":"2018-12-11T12:07:48Z","status":"public","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"}],"type":"journal_article","oa_version":"Published Version","abstract":[{"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).","lang":"eng"}],"publist_id":"1863","language":[{"iso":"eng"}],"publication":"Electronic Journal of Probability","scopus_import":"1","issue":"7","has_accepted_license":"1","date_published":"2010-02-03T00:00:00Z","file_date_updated":"2020-07-14T12:46:26Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1214/EJP.v15-741","ddc":["576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","year":"2010","quality_controlled":"1","intvolume":"        15","isi":1,"volume":15,"doi":"10.1214/EJP.v15-741","file":[{"checksum":"bab577546dd4e8f882e9a9dd645cd01e","date_created":"2018-12-12T10:15:21Z","access_level":"open_access","creator":"system","relation":"main_file","file_id":"5140","date_updated":"2020-07-14T12:46:26Z","content_type":"application/pdf","file_name":"IST-2015-369-v1+1_741-2535-1-PB.pdf","file_size":450171}],"day":"03","oa":1,"pubrep_id":"369","external_id":{"isi":["000274822400001"]},"publisher":"Institute of Mathematical Statistics","department":[{"_id":"NiBa"}],"month":"02"},{"license":"https://creativecommons.org/licenses/by-nd/4.0/","related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"page":"1 - 23","citation":{"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>.","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>","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>","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.","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."},"project":[{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"},{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"date_updated":"2026-07-06T13:24:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Expressiveness and closure properties for quantitative languages","_id":"3867","date_created":"2018-12-11T12:05:36Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","oa_version":"Published Version","type":"journal_article","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"}],"publist_id":"2311","language":[{"iso":"eng"}],"publication":"Logical Methods in Computer Science","scopus_import":"1","issue":"3","ec_funded":1,"has_accepted_license":"1","date_published":"2010-08-30T00:00:00Z","file_date_updated":"2020-07-14T12:46:19Z","article_processing_charge":"No","das_tickbox":"1","fulldoi":"https://doi.org/10.2168/LMCS-6(3:10)2010","ddc":["000","004"],"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"publication_status":"published","quality_controlled":"1","year":"2010","intvolume":"         6","isi":1,"volume":6,"doi":"10.2168/LMCS-6(3:10)2010","file":[{"access_level":"open_access","relation":"main_file","creator":"system","checksum":"0243da726476817f2ea33b48b78be696","date_created":"2018-12-12T10:17:54Z","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","file_size":216598,"file_id":"5312"},{"relation":"main_file","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:17:55Z","checksum":"5e512b8503a9cb263de26331c4ee9cf2","file_size":302416,"date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2016-55-v2+1_1007.4018.pdf","file_id":"5313"}],"day":"30","corr_author":"1","oa":1,"pubrep_id":"504","external_id":{"isi":["000282653500010"]},"publisher":"International Federation for Computational Logic","month":"08","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"issue":"3","scopus_import":"1","publication":"Logical Methods in Computer Science","publist_id":"2312","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:05:36Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"full_name":"Raman, Vishwanath","first_name":"Vishwanath","last_name":"Raman"}],"status":"public","_id":"3868","title":"Algorithms for game metrics","abstract":[{"lang":"eng","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"}],"type":"journal_article","oa_version":"Published Version","page":"1 - 27","citation":{"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>","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>.","short":"K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.","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.","ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.","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>.","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>"},"related_material":{"record":[{"status":"public","id":"3504","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-06T13:25:11Z","pubrep_id":"370","oa":1,"corr_author":"1","day":"01","department":[{"_id":"KrCh"}],"month":"09","publisher":"International Federation for Computational Logic","external_id":{"isi":["000282653500013"]},"isi":1,"file":[{"file_id":"4671","file_size":346527,"file_name":"IST-2015-370-v1+1_0809.4326.pdf","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","date_created":"2018-12-12T10:08:11Z","checksum":"a18988135fef3016c93808ecb15b55f5","relation":"main_file","creator":"system","access_level":"open_access"}],"doi":"10.2168/LMCS-6(3:13)2010","volume":6,"ddc":["000"],"tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"intvolume":"         6","year":"2010","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:19Z","date_published":"2010-09-01T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.2168/LMCS-6(3:13)2010","das_tickbox":"1"},{"type":"conference","oa_version":"None","abstract":[{"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.","lang":"eng"}],"_id":"3782","title":"Topology noise removal for curve  and surface evolution","status":"public","author":[{"first_name":"Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"full_name":"Freedman, Daniel","last_name":"Freedman","first_name":"Daniel"}],"date_created":"2018-12-11T12:05:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-07T13:07:08Z","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>.","short":"C. Chen, D. Freedman, in:, Conference Proceedings MCV 2010, Springer, 2010, pp. 31–42.","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.","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.","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>.","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>"},"page":"31 - 42","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.","publication":"Conference proceedings MCV 2010","scopus_import":"1","publist_id":"2445","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2010","publication_status":"published","intvolume":"      6533","fulldoi":"https://doi.org/10.1007/978-3-642-18421-5_4","alternative_title":["LNCS"],"date_published":"2010-12-31T00:00:00Z","conference":{"start_date":"2010-09-20","end_date":"2010-09-20","name":"MCV: Medical Computer Vision","location":"Beijing, China"},"article_processing_charge":"No","month":"12","department":[{"_id":"HeEd"}],"publisher":"Springer","day":"31","volume":6533,"doi":"10.1007/978-3-642-18421-5_4"},{"article_type":"original","type":"journal_article","oa_version":"Published Version","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"}],"_id":"3789","title":"Stereotypical cell division orientation controls neural rod midline formation in zebrafish","status":"public","date_created":"2018-12-11T12:05:11Z","author":[{"id":"EA35229E-E909-11E9-8DF8-C90C5D5AF86E","first_name":"Elena","last_name":"Quesada-Hernández","full_name":"Quesada-Hernández, Elena"},{"full_name":"Caneparo, Luca","first_name":"Luca","last_name":"Caneparo"},{"full_name":"Schneider, Sylvia","id":"1FAC36B0-E90A-11E9-9D2F-EF31CE0C9C2F","first_name":"Sylvia","last_name":"Schneider"},{"last_name":"Winkler","first_name":"Sylke","full_name":"Winkler, Sylke"},{"first_name":"Michael","last_name":"Liebling","full_name":"Liebling, Michael"},{"full_name":"Fraser, Scott","last_name":"Fraser","first_name":"Scott"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-28T08:03:47Z","page":"1966 - 1972","citation":{"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>","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>","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>.","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.","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.","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."},"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. ","publication":"Current Biology","issue":"21","scopus_import":"1","publist_id":"2438","language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"free access","year":"2010","quality_controlled":"1","publication_status":"published","intvolume":"        20","fulldoi":"https://doi.org/10.1016/j.cub.2010.10.009","das_tickbox":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2010.10.009","open_access":"1"}],"date_published":"2010-11-09T00:00:00Z","article_processing_charge":"No","external_id":{"isi":["000284193900032"]},"month":"11","department":[{"_id":"CaHe"}],"publisher":"Cell Press","day":"09","oa":1,"corr_author":"1","volume":20,"doi":"10.1016/j.cub.2010.10.009","isi":1},{"fulldoi":"https://doi.org/10.1007/978-3-642-03409-1_2","date_published":"2009-09-10T00:00:00Z","alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:46:31Z","has_accepted_license":"1","conference":{"location":"Wroclaw, Poland","end_date":"2009-09-04","start_date":"2009-09-02","name":"FCT: Fundamentals of Computation Theory"},"year":"2009","quality_controlled":"1","publication_status":"published","intvolume":"      5699","ddc":["004"],"volume":5699,"file":[{"date_created":"2018-12-12T10:15:09Z","checksum":"e8f53abb63579de3f2bff58b2a1188e2","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5126","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf","date_updated":"2020-07-14T12:46:31Z","content_type":"application/pdf","file_size":164428}],"doi":"10.1007/978-3-642-03409-1_2","month":"09","department":[{"_id":"KrCh"}],"publisher":"Springer","day":"10","pubrep_id":"39","corr_author":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:53:55Z","project":[{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"citation":{"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>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.","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>.","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>"},"page":"3 - 13","type":"conference","oa_version":"Submitted Version","abstract":[{"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.","lang":"eng"}],"_id":"4542","title":"Alternating weighted automata","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"status":"public","date_created":"2018-12-11T12:09:23Z","publist_id":"180","language":[{"iso":"eng"}],"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.","ec_funded":1,"scopus_import":1},{"fulldoi":"https://doi.org/10.1007/978-3-642-03816-7_4","date_published":"2009-08-01T00:00:00Z","alternative_title":["LNCS"],"conference":{"end_date":"2009-08-28","start_date":"2009-08-24","name":"MFCS: Mathematical Foundations of Computer Science","location":"High Tatras, Slovakia"},"intvolume":"      5734","year":"2009","quality_controlled":"1","publication_status":"published","doi":"10.1007/978-3-642-03816-7_4","volume":5734,"department":[{"_id":"KrCh"}],"month":"08","publisher":"Springer","corr_author":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:53:54Z","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"page":"34 - 54","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>","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>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.","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>"},"abstract":[{"text":"The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case.","lang":"eng"}],"type":"conference","oa_version":"None","status":"public","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Horn, Florian","first_name":"Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:09:24Z","_id":"4543","title":"Stochastic games with finitary objectives","publist_id":"178","language":[{"iso":"eng"}],"ec_funded":1,"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.","scopus_import":1},{"corr_author":"1","oa":1,"pubrep_id":"38","day":"24","publisher":"Springer","department":[{"_id":"KrCh"}],"month":"06","doi":"10.1007/978-3-642-02930-1_1","file":[{"access_level":"open_access","creator":"system","relation":"main_file","date_created":"2018-12-12T10:13:11Z","checksum":"dabb6d24428a000254c95493d9c492e6","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","content_type":"application/pdf","file_size":187419,"file_id":"4992"}],"volume":5556,"ddc":["000","005"],"intvolume":"      5556","publication_status":"published","year":"2009","quality_controlled":"1","has_accepted_license":"1","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2009-07-05","end_date":"2009-07-12","location":"Rhodos, Greece"},"alternative_title":["LNCS"],"date_published":"2009-06-24T00:00:00Z","file_date_updated":"2020-07-14T12:46:31Z","fulldoi":"https://doi.org/10.1007/978-3-642-02930-1_1","scopus_import":1,"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.","ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"177","status":"public","date_created":"2018-12-11T12:09:24Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"title":"A survey of stochastic games with limsup and liminf objectives","_id":"4545","abstract":[{"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. ","lang":"eng"}],"type":"conference","oa_version":"Submitted Version","page":"1 - 15","citation":{"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.","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.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.","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>.","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>","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>."},"project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2024-10-09T20:53:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Springer","month":"06","department":[{"_id":"KrCh"}],"external_id":{"arxiv":["0904.2638"]},"oa":1,"day":"19","doi":"10.1007/978-3-642-02658-4_14","volume":5643,"intvolume":"      5643","publication_status":"published","quality_controlled":"1","year":"2009","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0904.2638"}],"arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-642-02658-4_14","conference":{"location":"Grenoble, France","name":"CAV: Computer Aided Verification","start_date":"2009-06-26","end_date":"2009-07-02"},"alternative_title":["LNCS"],"date_published":"2009-06-19T00:00:00Z","ec_funded":1,"acknowledgement":"This research was supported by the Swiss National Science Foundation (Indo-Swiss Research Program and NCCR MICS) and the European Union projects COMBEST and COCONUT.","scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"141","abstract":[{"lang":"eng","text":"Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the “goodness” of an implementation. Using games with corresponding quantitative objectives, we can synthesize “optimal” implementations, which are preferred among the set of possible implementations that satisfy a given specification.\r\nIn particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games."}],"type":"conference","oa_version":"Preprint","status":"public","date_created":"2018-12-11T12:09:31Z","author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"title":"Better quality in synthesis through quantitative objectives","_id":"4569","date_updated":"2024-10-21T06:03:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>.","apa":"Bloem, R., Chatterjee, K., Henzinger, T. A., &#38; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>","mla":"Bloem, Roderick, et al. <i>Better Quality in Synthesis through Quantitative Objectives</i>. Vol. 5643, Springer, 2009, pp. 140–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>.","ama":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. Better quality in synthesis through quantitative objectives. In: Vol 5643. Springer; 2009:140-156. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>","ista":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.","short":"R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.","ieee":"R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156."},"page":"140 - 156","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}]},{"day":"02","oa":1,"corr_author":"1","pubrep_id":"28","publisher":"IST Austria","department":[{"_id":"KrCh"}],"month":"11","doi":"10.15479/AT:IST-2009-0004","file":[{"date_created":"2018-12-12T11:54:08Z","checksum":"fb7563150231325b00b1718d956f687b","creator":"system","relation":"main_file","access_level":"open_access","file_id":"5530","file_size":311065,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z","file_name":"IST-2009-0004_IST-2009-0004.pdf"}],"ddc":["005"],"publication_status":"published","year":"2009","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"date_published":"2009-11-02T00:00:00Z","file_date_updated":"2020-07-14T12:46:43Z","fulldoi":"https://doi.org/10.15479/AT:IST-2009-0004","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"title":"Probabilistic automata on infinite words: Decidability and undecidability results","_id":"5392","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"}],"date_created":"2018-12-12T11:39:04Z","status":"public","type":"technical_report","oa_version":"Published Version","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"3857","relation":"later_version"}]},"page":"17","citation":{"ama":"Chatterjee K. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>","mla":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>.","ieee":"K. Chatterjee, <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria, 2009.","ista":"Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.","short":"K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.","chicago":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>.","apa":"Chatterjee, K. (2009). <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>"},"date_updated":"2025-04-14T13:37:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"oa_version":"Published Version","type":"technical_report","status":"public","date_created":"2018-12-12T11:39:05Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"title":"Gist: A solver for probabilistic games","_id":"5393","date_updated":"2025-04-14T13:37:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"12","citation":{"ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>","mla":"Chatterjee, Krishnendu, et al. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, <i>Gist: A solver for probabilistic games</i>. IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2009). <i>Gist: A solver for probabilistic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>"},"related_material":{"record":[{"status":"public","relation":"later_version","id":"4388"}]},"publisher":"IST Austria","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"10","oa":1,"corr_author":"1","pubrep_id":"29","day":"09","doi":"10.15479/AT:IST-2009-0003","file":[{"access_level":"open_access","relation":"main_file","creator":"system","date_created":"2018-12-12T11:52:58Z","checksum":"49551ac552915b17593a14c993845274","file_name":"IST-2009-0003_IST-2009-0003.pdf","date_updated":"2020-07-14T12:46:43Z","content_type":"application/pdf","file_size":386866,"file_id":"5459"}],"publication_status":"published","year":"2009","ddc":["000","005"],"fulldoi":"https://doi.org/10.15479/AT:IST-2009-0003","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"date_published":"2009-10-09T00:00:00Z","file_date_updated":"2020-07-14T12:46:43Z"},{"fulldoi":"https://doi.org/10.15479/AT:IST-2009-0002","alternative_title":["IST Austria Technical Report"],"date_published":"2009-09-09T00:00:00Z","file_date_updated":"2020-07-14T12:46:43Z","has_accepted_license":"1","year":"2009","publication_status":"published","ddc":["004"],"file":[{"access_level":"open_access","relation":"main_file","creator":"system","checksum":"1c50a9723fbae1b2c46d18138968efb3","date_created":"2018-12-12T11:53:50Z","file_name":"IST-2009-0002_IST-2009-0002.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z","file_size":238091,"file_id":"5511"}],"doi":"10.15479/AT:IST-2009-0002","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"09","publisher":"IST Austria","day":"09","pubrep_id":"30","corr_author":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T21:08:23Z","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria, 2009.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","ama":"Chatterjee K, Henzinger TA, Horn F. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>","mla":"Chatterjee, Krishnendu, et al. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>."},"page":"11","type":"technical_report","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players."}],"_id":"5394","title":"Improved lower bounds for request-response and finitary Streett games","status":"public","date_created":"2018-12-12T11:39:05Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian","full_name":"Horn, Florian"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]}},{"publisher":"IST Austria","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"09","corr_author":"1","oa":1,"pubrep_id":"31","day":"09","doi":"10.15479/AT:IST-2009-0001","file":[{"checksum":"04d9cc065cc19598a4e8631c47f1a562","date_created":"2018-12-12T11:53:25Z","access_level":"open_access","creator":"system","relation":"main_file","file_id":"5486","date_updated":"2020-07-14T12:46:43Z","content_type":"application/pdf","file_name":"IST-2009-0001_IST-2009-0001.pdf","file_size":342088}],"publication_status":"published","year":"2009","ddc":["005"],"fulldoi":"https://doi.org/10.15479/AT:IST-2009-0001","has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:43Z","date_published":"2009-09-09T00:00:00Z","alternative_title":["IST Austria Technical Report"],"publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses."}],"oa_version":"Published Version","type":"technical_report","date_created":"2018-12-12T11:39:05Z","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"title":"Qualitative analysis of partially-observable Markov decision processes","_id":"5395","date_updated":"2025-04-14T13:37:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria, 2009.","ama":"Chatterjee K, Doyen L, Henzinger TA. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>."},"page":"20","related_material":{"record":[{"id":"3855","relation":"later_version","status":"public"}]}},{"type":"journal_article","oa_version":"Submitted Version","article_type":"original","abstract":[{"text":"Parent-of-origin-specific (imprinted) gene expression is regulated in Arabidopsis thaliana endosperm by cytosine demethylation of the maternal genome mediated by the DNA glycosylase DEMETER, but the extent of the methylation changes is not known. Here, we show that virtually the entire endosperm genome is demethylated, coupled with extensive local non-CG hypermethylation of small interfering RNA–targeted sequences. Mutation of DEMETER partially restores endosperm CG methylation to levels found in other tissues, indicating that CG demethylation is specific to maternal sequences. Endosperm demethylation is accompanied by CHH hypermethylation of embryo transposable elements. Our findings demonstrate extensive reconfiguration of the endosperm methylation landscape that likely reinforces transposon silencing in the embryo.","lang":"eng"}],"extern":"1","title":"Genome-wide demethylation of Arabidopsis endosperm","_id":"9453","date_created":"2021-06-04T08:55:41Z","status":"public","author":[{"full_name":"Hsieh, Tzung-Fu","last_name":"Hsieh","first_name":"Tzung-Fu"},{"first_name":"Christian A.","last_name":"Ibarra","full_name":"Ibarra, Christian A."},{"first_name":"Pedro","last_name":"Silva","full_name":"Silva, Pedro"},{"full_name":"Zemach, Assaf","first_name":"Assaf","last_name":"Zemach"},{"first_name":"Leor","last_name":"Eshed-Williams","full_name":"Eshed-Williams, Leor"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"},{"orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","last_name":"Zilberman"}],"date_updated":"2021-12-14T08:53:26Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"1451-1454","citation":{"chicago":"Hsieh, Tzung-Fu, Christian A. Ibarra, Pedro Silva, Assaf Zemach, Leor Eshed-Williams, Robert L. Fischer, and Daniel Zilberman. “Genome-Wide Demethylation of Arabidopsis Endosperm.” <i>Science</i>. American Association for the Advancement of Science, 2009. <a href=\"https://doi.org/10.1126/science.1172417\">https://doi.org/10.1126/science.1172417</a>.","apa":"Hsieh, T.-F., Ibarra, C. A., Silva, P., Zemach, A., Eshed-Williams, L., Fischer, R. L., &#38; Zilberman, D. (2009). Genome-wide demethylation of Arabidopsis endosperm. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1172417\">https://doi.org/10.1126/science.1172417</a>","ama":"Hsieh T-F, Ibarra CA, Silva P, et al. Genome-wide demethylation of Arabidopsis endosperm. <i>Science</i>. 2009;324(5933):1451-1454. doi:<a href=\"https://doi.org/10.1126/science.1172417\">10.1126/science.1172417</a>","mla":"Hsieh, Tzung-Fu, et al. “Genome-Wide Demethylation of Arabidopsis Endosperm.” <i>Science</i>, vol. 324, no. 5933, American Association for the Advancement of Science, 2009, pp. 1451–54, doi:<a href=\"https://doi.org/10.1126/science.1172417\">10.1126/science.1172417</a>.","short":"T.-F. Hsieh, C.A. Ibarra, P. Silva, A. Zemach, L. Eshed-Williams, R.L. Fischer, D. Zilberman, Science 324 (2009) 1451–1454.","ista":"Hsieh T-F, Ibarra CA, Silva P, Zemach A, Eshed-Williams L, Fischer RL, Zilberman D. 2009. Genome-wide demethylation of Arabidopsis endosperm. Science. 324(5933), 1451–1454.","ieee":"T.-F. Hsieh <i>et al.</i>, “Genome-wide demethylation of Arabidopsis endosperm,” <i>Science</i>, vol. 324, no. 5933. American Association for the Advancement of Science, pp. 1451–1454, 2009."},"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"publication":"Science","scopus_import":"1","issue":"5933","language":[{"iso":"eng"}],"publication_status":"published","year":"2009","pmid":1,"quality_controlled":"1","intvolume":"       324","fulldoi":"https://doi.org/10.1126/science.1172417","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4044190/"}],"date_published":"2009-06-12T00:00:00Z","article_processing_charge":"No","keyword":["Multidisciplinary"],"external_id":{"pmid":["19520962"]},"publisher":"American Association for the Advancement of Science","department":[{"_id":"DaZi"}],"month":"06","day":"12","oa":1,"volume":324,"doi":"10.1126/science.1172417"}]