[{"date_published":"2010-03-19T00:00:00Z","type":"journal_article","date_updated":"2021-01-12T07:52:31Z","year":"2010","citation":{"apa":"Jonas, P. M., &#38; Hefft, S. (2010). GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). <i>The European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">https://doi.org/10.1111/j.1460-9568.2010.07189.x</a>","ama":"Jonas PM, Hefft S. GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). <i>The European Journal of Neuroscience</i>. 2010;31(7):1194-1195. doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">10.1111/j.1460-9568.2010.07189.x</a>","ieee":"P. M. Jonas and S. Hefft, “GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova),” <i>The European Journal of Neuroscience</i>, vol. 31, no. 7. Wiley-Blackwell, pp. 1194–1195, 2010.","chicago":"Jonas, Peter M, and Stefan Hefft. “GABA Release at Terminals of CCK-Interneurons: Synchrony, Asynchrony and Modulation by Cannabinoid Receptors (Commentary on Ali &#38;amp; Todorova).” <i>The European Journal of Neuroscience</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">https://doi.org/10.1111/j.1460-9568.2010.07189.x</a>.","short":"P.M. Jonas, S. Hefft, The European Journal of Neuroscience 31 (2010) 1194–1195.","mla":"Jonas, Peter M., and Stefan Hefft. “GABA Release at Terminals of CCK-Interneurons: Synchrony, Asynchrony and Modulation by Cannabinoid Receptors (Commentary on Ali &#38;amp; Todorova).” <i>The European Journal of Neuroscience</i>, vol. 31, no. 7, Wiley-Blackwell, 2010, pp. 1194–95, doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">10.1111/j.1460-9568.2010.07189.x</a>.","ista":"Jonas PM, Hefft S. 2010. GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). The European Journal of Neuroscience. 31(7), 1194–1195."},"publist_id":"2378","doi":"10.1111/j.1460-9568.2010.07189.x","day":"19","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":31,"author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"},{"full_name":"Hefft, Stefan","last_name":"Hefft","first_name":"Stefan"}],"issue":"7","publication":"The European Journal of Neuroscience","_id":"3833","scopus_import":1,"title":"GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &amp; Todorova)","month":"03","intvolume":"        31","publication_status":"published","oa_version":"None","article_processing_charge":"No","date_created":"2018-12-11T12:05:25Z","department":[{"_id":"PeJo"}],"language":[{"iso":"eng"}],"page":"1194 - 1195","quality_controlled":"1","publisher":"Wiley-Blackwell"},{"oa":1,"publist_id":"2374","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2010-04-08T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","date_created":"2018-12-12T10:16:29Z","checksum":"220239fae76f7b03c4d7f05d74ef426f","file_size":1919130,"file_id":"5217","creator":"system","access_level":"open_access","relation":"main_file"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"Published Version","month":"04","has_accepted_license":"1","publication":"BMC Systems Biology","language":[{"iso":"eng"}],"day":"08","doi":"10.1186/1752-0509-4-42","abstract":[{"text":"Background\r\n\r\nThe chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a &quot;window&quot; into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.\r\nResults\r\n\r\nIn order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.\r\n\r\n\r\nConclusions\r\n\r\nThe sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori.","lang":"eng"}],"year":"2010","citation":{"ista":"Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.","short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>.","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” <i>BMC Systems Biology</i>, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>.","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. 2010;4(42):1-19. doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>","apa":"Wolf, V., Goel, R., Mateescu, M., &#38; Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>"},"date_updated":"2021-01-12T07:52:32Z","acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","volume":4,"ddc":["005"],"date_created":"2018-12-11T12:05:25Z","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"         4","title":"Solving the chemical master equation using sliding windows","pubrep_id":"72","scopus_import":1,"_id":"3834","issue":"42","author":[{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"},{"full_name":"Goel, Rushil","first_name":"Rushil","last_name":"Goel"},{"last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"publisher":"BioMed Central","quality_controlled":"1","page":"1 - 19","file_date_updated":"2020-07-14T12:46:16Z"},{"date_updated":"2021-01-12T07:52:33Z","year":"2010","citation":{"apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., &#38; Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>","chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>.","ieee":"T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.","mla":"Henzinger, Thomas A., et al. <i>Hybrid Numerical Solution of the Chemical Master Equation</i>. Springer, 2010, pp. 55–65, doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>.","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.","ista":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65."},"doi":"10.1145/1839764.1839772","day":"29","abstract":[{"text":"We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe net- works of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the construction of a stochastic hybrid model in which certain discrete random variables of the original Markov chain are approximated by continuous deterministic variables. We compute the solution of the stochastic hybrid model using a numerical algorithm that discretizes time and in each step performs a mutual update of the transient prob- ability distribution of the discrete stochastic variables and the values of the continuous deterministic variables. We im- plemented the algorithm and we demonstrate its usefulness and efficiency on several case studies from systems biology.","lang":"eng"}],"ddc":["004"],"_id":"3838","scopus_import":1,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","first_name":"Maria"},{"last_name":"Mikeev","first_name":"Linar","full_name":"Mikeev, Linar"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"publication_status":"published","date_created":"2018-12-11T12:05:27Z","department":[{"_id":"ToHe"}],"title":"Hybrid numerical solution of the chemical master equation","pubrep_id":"68","page":"55 - 65","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:16Z","publisher":"Springer","date_published":"2010-09-29T00:00:00Z","type":"conference","publist_id":"2356","oa":1,"file":[{"creator":"system","file_id":"5179","relation":"main_file","access_level":"open_access","file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:16Z","checksum":"81cb6f0babd97151b171d1ce86582831","file_size":671790,"date_created":"2018-12-12T10:15:55Z"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","has_accepted_license":"1","oa_version":"Submitted Version","month":"09","language":[{"iso":"eng"}],"conference":{"location":"Trento, Italy","end_date":"2010-10-01","start_date":"2010-09-29","name":"CMSB: Computational Methods in Systems Biology"}},{"file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","page":"163 - 179","publisher":"Springer","author":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","first_name":"Thibaud","last_name":"Hottelier"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"scopus_import":1,"_id":"3839","intvolume":"      5944","title":"Invariant and type inference for matrices","pubrep_id":"69","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:27Z","publication_status":"published","ddc":["005"],"acknowledgement":"The research was supported by the Swiss NSF.","volume":5944,"citation":{"ista":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.","mla":"Henzinger, Thomas A., et al. <i>Invariant and Type Inference for Matrices</i>. Vol. 5944, Springer, 2010, pp. 163–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.","ama":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>"},"year":"2010","date_updated":"2021-01-12T07:52:33Z","abstract":[{"text":"We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To gen- erate loop properties, we first transform a nested loop iterating over a multi- dimensional array into an equivalent collection of unnested loops. Then, we in- fer quantified loop invariants for each unnested loop using a generalization of a recurrence-based invariant generation technique. These loop invariants give us conditions on matrices from which we can derive matrix types automatically us- ing theorem provers. Invariant generation is implemented in the software package Aligator and types are derived by theorem provers and SMT solvers, including Vampire and Z3. When run on the Java matrix package JAMA, our tool was able to infer automatically all matrix types describing the matrix shapes guaranteed by JAMA’s API.","lang":"eng"}],"day":"01","doi":"10.1007/978-3-642-11319-2_14","language":[{"iso":"eng"}],"conference":{"location":"Madrid, Spain","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2010-01-17"},"has_accepted_license":"1","month":"01","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"4989","checksum":"da69b13a2d9a7a316c909e09c1090cef","file_size":251265,"date_created":"2018-12-12T10:13:09Z","content_type":"application/pdf","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","date_updated":"2020-07-14T12:46:16Z"}],"type":"conference","date_published":"2010-01-01T00:00:00Z","publist_id":"2357","oa":1},{"title":"From boolean to quantitative notions of correctness","month":"01","intvolume":"        45","oa_version":"None","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:27Z","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"issue":"1","_id":"3840","scopus_import":1,"conference":{"name":"POPL: Principles of Programming Languages","start_date":"2010-01-17","end_date":"2010-01-23","location":"Madrid, Spain"},"publisher":"ACM","language":[{"iso":"eng"}],"page":"157 - 158","quality_controlled":"1","abstract":[{"text":"Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. Correspondingly, classical methods for system analysis determine the truth value of a property, preferably giving a proof if the property is true, and a counterexample if the property is false; classical methods for system synthesis construct a system for which a property is true; classical methods for system transformation, composition, and abstraction aim to preserve the truth of properties. The boolean view is prevalent even if the system, the property, or both refer to numerical quantities, such as the times or probabilities of events. For example, a timed automaton either satisfies or violates a formula of a real-time logic; a stochastic process either satisfies or violates a formula of a probabilistic logic. The classical black-and-white view partitions the world into \"correct\" and \"incorrect\" systems, offering few nuances. In reality, of several systems that satisfy a property in the boolean sense, often some are more desirable than others, and of the many systems that violate a property, usually some are less objectionable than others. For instance, among the systems that satisfy the response property that every request be granted, we may prefer systems that grant requests quickly (the quicker, the better), or we may prefer systems that issue few unnecessary grants (the fewer, the better); and among the systems that violate the response property, we may prefer systems that serve many initial requests (the more, the better), or we may prefer systems that serve many requests in the long run (the greater the fraction of served to unserved requests, the better). Formally, while a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a directed metric on systems and properties, where the distance between a system and a property provides a measure of \"fit\" or \"desirability.\" There are many ways how such distances can be defined. In a linear-time framework, one assigns numerical values to individual behaviors before assigning values to systems and properties, which are sets of behaviors. For example, the value of a single behavior may be a discounted value, which is largely determined by a prefix of the behavior, e.g., by the number of requests that are granted before the first request that is not granted; or a limit value, which is independent of any finite prefix. A limit value may be an average, such as the average response time over an infinite sequence of requests and grants, or a supremum, such as the worst-case response time. Similarly, the value of a set of behaviors may be an extremum or an average across the values of all behaviors in the set: in this way one can measure the worst of all possible average-case response times, or the average of all possible worst-case response times, etc. Accordingly, the distance between two sets of behaviors may be defined as the worst or average difference between the values of corresponding behaviors. In summary, we propagate replacing boolean specifications for the correctness of systems with quantitative measures for the desirability of systems. In quantitative analysis, the aim is to compute the distance between a system and a property (or between two systems, or two properties); in quantitative synthesis, the objective is to construct a system that has minimal distance from a given property. Multiple quantitative measures can be prioritized (e.g., combined lexicographically into a single measure) or studied along the Pareto curve. Quantitative transformations, compositions, and abstractions of systems are useful if they allow us to bound the induced change in distance from a property. We present some initial results in some of these directions. We also give some potential applications, which not only generalize tradiditional correctness concerns in the functional, timed, and probabilistic domains, but also capture such system measures as resource use, performance, cost, reliability, and robustness.","lang":"eng"}],"publist_id":"2354","doi":"10.1145/1706299.1706319","day":"17","date_published":"2010-01-17T00:00:00Z","type":"conference","date_updated":"2021-01-12T07:52:34Z","year":"2010","citation":{"ieee":"T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>.","ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>","apa":"Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>","ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","mla":"Henzinger, Thomas A. <i>From Boolean to Quantitative Notions of Correctness</i>. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>.","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158."},"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":45,"acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann."},{"volume":4,"ddc":["570"],"date_updated":"2023-02-23T11:45:08Z","citation":{"chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>. Institution of Engineering and Technology, 2010. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” <i>IET Systems Biology</i>, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. 2010;4(6):441-452. doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. Institution of Engineering and Technology. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.","mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452."},"year":"2010","doi":"10.1049/iet-syb.2010.0005","day":"15","abstract":[{"text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.","lang":"eng"}],"page":"441 - 452","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:16Z","publisher":"Institution of Engineering and Technology","_id":"3842","scopus_import":1,"author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","first_name":"Maria"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"issue":"6","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:28Z","pubrep_id":"66","title":"Fast adaptive uniformization of the chemical master equation","intvolume":"         4","file":[{"file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:16Z","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","file_size":222890,"date_created":"2018-12-12T10:17:02Z","creator":"system","file_id":"5254","relation":"main_file","access_level":"open_access"}],"status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3843"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2010-11-15T00:00:00Z","type":"journal_article","publist_id":"2349","oa":1,"language":[{"iso":"eng"}],"publication":"IET Systems Biology","has_accepted_license":"1","oa_version":"Submitted Version","month":"11"},{"month":"10","oa_version":"Submitted Version","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"},"language":[{"iso":"eng"}],"oa":1,"publist_id":"2342","date_published":"2010-10-01T00:00:00Z","type":"conference","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4790","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","date_created":"2018-12-12T10:10:05Z","checksum":"913af269da6710f2174f470b48ab7a82","file_size":186143}],"alternative_title":["LNCS"],"pubrep_id":"64","title":"Aligators for arrays","intvolume":"      6397","publication_status":"published","date_created":"2018-12-11T12:05:29Z","department":[{"_id":"ToHe"}],"author":[{"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":"Hottelier, Thibaud","first_name":"Thibaud","last_name":"Hottelier"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"_id":"3845","scopus_import":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:46:17Z","page":"348 - 356","quality_controlled":"1","abstract":[{"text":"This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out inductive reasoning over array content. The Aligators’ loop extraction module allows treatment of multi-path loops by exploiting their commutativity and serializability properties. Our experience in applying Aligators on a collection of loops from open source software projects indicates the applicability of recurrence and algebraic solving techniques for reasoning about arrays.","lang":"eng"}],"doi":"10.1007/978-3-642-16242-8_25","day":"01","date_updated":"2021-01-12T07:52:37Z","year":"2010","citation":{"ista":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","mla":"Henzinger, Thomas A., et al. <i>Aligators for Arrays</i>. Vol. 6397, Springer, 2010, pp. 348–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). 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_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>"},"ddc":["005"],"volume":6397},{"publist_id":"2339","oa":1,"type":"conference","date_published":"2010-10-14T00:00:00Z","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4726","creator":"system","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:09:03Z","checksum":"38707b149d2174f01be406e794ffa849","file_size":433824}],"month":"10","oa_version":"Submitted Version","has_accepted_license":"1","conference":{"start_date":"2010-09-15","name":"QEST: Quantitative Evaluation of Systems","end_date":"2010-09-18","location":"Williamsburg, USA"},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies."}],"day":"14","doi":"10.1109/QEST.2010.33","year":"2010","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.","mla":"Didier, Frédéric, et al. <i>SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks</i>. IEEE, 2010, pp. 193–94, doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,” 193–94. IEEE, 2010. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>."},"date_updated":"2021-01-12T07:52:37Z","ddc":["004"],"title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks","pubrep_id":"63","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_created":"2018-12-11T12:05:29Z","publication_status":"published","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"scopus_import":1,"_id":"3847","publisher":"IEEE","file_date_updated":"2020-07-14T12:46:17Z","quality_controlled":"1","page":"193 - 194"},{"day":"01","doi":"10.1007/978-3-642-15775-2_1","publist_id":"2336","abstract":[{"text":"We define the robustness of a level set homology class of a function f:XR as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology. The special case X=R3 has ramifications in medical imaging and scientific visualization.","lang":"eng"}],"citation":{"chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>.","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>","ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.","mla":"Bendich, Paul, et al. <i>The Robustness of Level Sets</i>. Vol. 6346, Springer, 2010, pp. 1–10, doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>."},"year":"2010","date_updated":"2021-01-12T07:52:38Z","type":"conference","date_published":"2010-09-01T00:00:00Z","volume":6346,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:05:30Z","oa_version":"None","publication_status":"published","intvolume":"      6346","month":"09","title":"The robustness of level sets","alternative_title":["LNCS"],"scopus_import":1,"_id":"3848","author":[{"last_name":"Bendich","first_name":"Paul","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"},{"id":"34A254A0-F248-11E8-B48F-1D18A9856A87","last_name":"Patel","first_name":"Amit","full_name":"Patel, Amit"}],"publisher":"Springer","conference":{"location":"Liverpool, UK","end_date":"2010-09-08","name":"ESA: European Symposium on Algorithms","start_date":"2010-09-06"},"quality_controlled":"1","page":"1 - 10","language":[{"iso":"eng"}]},{"scopus_import":1,"_id":"3849","author":[{"full_name":"Bendich, Paul","last_name":"Bendich","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael"},{"first_name":"Amit","last_name":"Patel","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:05:30Z","department":[{"_id":"HeEd"}],"publication_status":"published","intvolume":"      6281","alternative_title":["LNCS"],"pubrep_id":"537","title":"Persistent homology under non-uniform error","quality_controlled":"1","page":"12 - 23","file_date_updated":"2020-07-14T12:46:17Z","publisher":"Springer","citation":{"ieee":"P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>.","ama":"Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Vol 6281. Springer; 2010:12-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>","apa":"Bendich, P., Edelsbrunner, H., Kerber, M., &#38; Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>","ista":"Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.","mla":"Bendich, Paul, et al. <i>Persistent Homology under Non-Uniform Error</i>. Vol. 6281, Springer, 2010, pp. 12–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>."},"year":"2010","date_updated":"2021-01-12T07:52:38Z","day":"10","doi":"10.1007/978-3-642-15155-2_2","abstract":[{"lang":"eng","text":"Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classes. Prior work has shown that the homology and robustness information can be read off the extended persistence diagram of the function. This paper extends these results to a non-uniform error model in which perturbations vary in their magnitude across the domain."}],"volume":6281,"ddc":["000"],"has_accepted_license":"1","oa_version":"Submitted Version","month":"08","language":[{"iso":"eng"}],"conference":{"end_date":"2010-08-27","location":"Brno, Czech Republic","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"type":"conference","date_published":"2010-08-10T00:00:00Z","oa":1,"publist_id":"2333","file":[{"relation":"main_file","access_level":"open_access","file_id":"4994","creator":"system","date_created":"2018-12-12T10:13:13Z","file_size":142357,"checksum":"af61e1c2bb42f3d556179d4692caeb1b","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public"},{"_id":"385","publication":"Physical Review Letters","issue":"1","author":[{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203"},{"full_name":"Analytis, James","last_name":"Analytis","first_name":"James"},{"last_name":"Chu","first_name":"Jiunhaw","full_name":"Chu, Jiunhaw"},{"last_name":"Fisher","first_name":"Ian","full_name":"Fisher, Ian"},{"last_name":"Chen","first_name":"Yulin","full_name":"Chen, Yulin"},{"first_name":"Zhixun","last_name":"Shen","full_name":"Shen, Zhixun"},{"first_name":"Aiping","last_name":"Fang","full_name":"Fang, Aiping"},{"full_name":"Kapitulnik, Aharon","last_name":"Kapitulnik","first_name":"Aharon"}],"date_created":"2018-12-11T11:46:10Z","oa_version":"None","publication_status":"published","intvolume":"       104","title":"STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects","month":"01","language":[{"iso":"eng"}],"publisher":"American Physical Society","year":"2010","citation":{"ista":"Alpichshev Z, Analytis J, Chu J, Fisher I, Chen Y, Shen Z, Fang A, Kapitulnik A. 2010. STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects. Physical Review Letters. 104(1).","short":"Z. Alpichshev, J. Analytis, J. Chu, I. Fisher, Y. Chen, Z. Shen, A. Fang, A. Kapitulnik, Physical Review Letters 104 (2010).","mla":"Alpichshev, Zhanybek, et al. “STM Imaging of Electronic Waves on the Surface of Bi2Te3 Topologically Protected Surface States and Hexagonal Warping Effects.” <i>Physical Review Letters</i>, vol. 104, no. 1, American Physical Society, 2010, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.104.016401\">10.1103/PhysRevLett.104.016401</a>.","chicago":"Alpichshev, Zhanybek, James Analytis, Jiunhaw Chu, Ian Fisher, Yulin Chen, Zhixun Shen, Aiping Fang, and Aharon Kapitulnik. “STM Imaging of Electronic Waves on the Surface of Bi2Te3 Topologically Protected Surface States and Hexagonal Warping Effects.” <i>Physical Review Letters</i>. American Physical Society, 2010. <a href=\"https://doi.org/10.1103/PhysRevLett.104.016401\">https://doi.org/10.1103/PhysRevLett.104.016401</a>.","ieee":"Z. Alpichshev <i>et al.</i>, “STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects,” <i>Physical Review Letters</i>, vol. 104, no. 1. American Physical Society, 2010.","ama":"Alpichshev Z, Analytis J, Chu J, et al. STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects. <i>Physical Review Letters</i>. 2010;104(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.104.016401\">10.1103/PhysRevLett.104.016401</a>","apa":"Alpichshev, Z., Analytis, J., Chu, J., Fisher, I., Chen, Y., Shen, Z., … Kapitulnik, A. (2010). STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.104.016401\">https://doi.org/10.1103/PhysRevLett.104.016401</a>"},"date_updated":"2021-01-12T07:52:39Z","type":"journal_article","date_published":"2010-01-04T00:00:00Z","day":"04","doi":"10.1103/PhysRevLett.104.016401","publist_id":"7444","oa":1,"abstract":[{"text":"Scanning tunneling spectroscopy studies on high-quality Bi2Te3 crystals exhibit perfect correspondence to angle-resolved photoemission spectroscopy data, hence enabling identification of different regimes measured in the local density of states (LDOS). Oscillations of LDOS near a step are analyzed. Within the main part of the surface band oscillations are strongly damped, supporting the hypothesis of topological protection. At higher energies, as the surface band becomes concave, oscillations appear, dispersing with a wave vector that may result from a hexagonal warping term. ","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/0908.0371.pdf","open_access":"1"}],"volume":104,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"language":[{"iso":"eng"}],"quality_controlled":"1","page":"12 - 23","conference":{"start_date":"2010-03-22","name":"EuroCG: European Workshop on Computational Geometry","location":"Dortmund, Germany","end_date":"2010-03-24"},"publisher":"TU Dortmund","author":[{"full_name":"Berberich, Eric","first_name":"Eric","last_name":"Berberich"},{"full_name":"Halperin, Dan","first_name":"Dan","last_name":"Halperin"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","first_name":"Michael","last_name":"Kerber"},{"last_name":"Pogalnikova","first_name":"Roza","full_name":"Pogalnikova, Roza"}],"_id":"3850","title":"Polygonal reconstruction from approximate offsets","month":"01","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T12:05:30Z","oa_version":"None","publication_status":"published","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","date_published":"2010-01-01T00:00:00Z","citation":{"mla":"Berberich, Eric, et al. <i>Polygonal Reconstruction from Approximate Offsets</i>. TU Dortmund, 2010, pp. 12–23.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Polygonal Reconstruction from Approximate Offsets,” 12–23. TU Dortmund, 2010."},"year":"2010","date_updated":"2021-01-12T07:52:39Z","publist_id":"2334","abstract":[{"lang":"eng","text":"Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape with a disk of fixed radius? If it does, we also seek a preferably simple solution shape P;P’s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give a decision algorithm for fixed radius in O(nlogn) time that handles any polygonal shape. For convex shapes, the complexity drops to O(n), which is also the time required to compute a solution shape P with at most one more vertex than a vertex-minimal one."}],"day":"01"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"_id":"3851","scopus_import":1,"title":"Energy parity games","alternative_title":["LNCS"],"intvolume":"      6199","publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:05:31Z","page":"599 - 610","quality_controlled":"1","publisher":"Springer","external_id":{"arxiv":["1001.5183"]},"date_updated":"2023-02-23T11:06:35Z","year":"2010","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,” 6199:599–610. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France, 2010, vol. 6199, pp. 599–610.","apa":"Chatterjee, K., &#38; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>","ama":"Chatterjee K, Doyen L. Energy parity games. In: Vol 6199. Springer; 2010:599-610. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>","ista":"Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy Parity Games</i>. Vol. 6199, Springer, 2010, pp. 599–610, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610."},"abstract":[{"lang":"eng","text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objective. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is polynomially equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games."}],"doi":"10.1007/978-3-642-14162-1_50","arxiv":1,"day":"10","volume":6199,"month":"09","oa_version":"Preprint","language":[{"iso":"eng"}],"conference":{"name":" ICALP: Automata, Languages and Programming, 37th International Colloquium","start_date":"2010-07-06","end_date":"2010-07-10","location":"Bordeaux, France"},"date_published":"2010-09-10T00:00:00Z","type":"conference","oa":1,"publist_id":"2330","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"2972"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://arxiv.org/abs/1001.5183","open_access":"1"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:12:19Z","file_size":74598,"checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_id":"4937","creator":"system","access_level":"open_access","relation":"main_file"}],"type":"conference","date_published":"2010-06-08T00:00:00Z","publist_id":"2329","oa":1,"language":[{"iso":"eng"}],"conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2010-06-17","location":"Minori, Italy","end_date":"2010-06-18"},"has_accepted_license":"1","month":"06","oa_version":"Published Version","ddc":["000"],"volume":25,"external_id":{"arxiv":["1006.1403"]},"year":"2010","citation":{"ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Discounting in Games across Time Scales</i>. Vol. 25, EPTCS, 2010, pp. 22–29, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>.","short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>.","ieee":"K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.","apa":"Chatterjee, K., &#38; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>","ama":"Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol 25. EPTCS; 2010:22-29. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>"},"date_updated":"2023-09-04T11:47:04Z","abstract":[{"text":"We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value. ","lang":"eng"}],"day":"08","doi":"10.4204/EPTCS.25.6","arxiv":1,"file_date_updated":"2020-07-14T12:46:17Z","quality_controlled":"1","page":"22 - 29","publisher":"EPTCS","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"scopus_import":"1","_id":"3852","intvolume":"        25","alternative_title":["EPTCS"],"title":"Discounting in games across time scales","pubrep_id":"491","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:05:31Z","article_processing_charge":"No","publication_status":"published"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:46:17Z","quality_controlled":"1","ec_funded":1,"page":"269 - 283","intvolume":"      6269","title":"Mean-payoff automaton expressions","pubrep_id":"62","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:31Z","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Rannou, Philippe","first_name":"Philippe","last_name":"Rannou"}],"scopus_import":1,"_id":"3853","ddc":["000","005"],"volume":6269,"abstract":[{"lang":"eng","text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions."}],"day":"18","doi":"10.1007/978-3-642-15375-4_19","year":"2010","citation":{"ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>.","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>"},"date_updated":"2021-01-12T07:52:40Z","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","location":"Paris, France","end_date":"2010-09-03"},"language":[{"iso":"eng"}],"month":"11","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"}],"oa_version":"Submitted Version","has_accepted_license":"1","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":233260,"checksum":"4f753ae99d076553fb8733e2c8b390e2","date_created":"2018-12-12T10:15:41Z","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5163"}],"oa":1,"publist_id":"2328","type":"conference","date_published":"2010-11-18T00:00:00Z"},{"day":"08","doi":"10.1007/978-3-642-15375-4_20","publist_id":"2327","abstract":[{"lang":"eng","text":"Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the environment. The evolution of the system depends on the decisions of both players. The specification for the system is usually given as an ω-regular language L over paths and Eve’s goal is to ensure that the play belongs to L irrespective of Adam’s behaviour. The classical notion of winning strategies fails to capture several interesting scenarios. For example, strong fairness (Streett) conditions are specified by a number of request-grant pairs and require every pair that is requested infinitely often to be granted infinitely often: Eve might win just by preventing Adam from making any new request, but a “better” strategy would allow Adam to make as many requests as possible and still ensure fairness. To address such questions, we introduce the notion of obliging games, where Eve has to ensure a strong condition Φ, while always allowing Adam to satisfy a weak condition Ψ. We present a linear time reduction of obliging games with two Muller conditions Φ and Ψ to classical Muller games. We consider obliging Streett games and show they are co-NP complete, and show a natural quantitative optimisation problem for obliging Streett games is in FNP. We also show how obliging games can provide new and interesting semantics for multi-player games."}],"year":"2010","citation":{"apa":"Chatterjee, K., Horn, F., &#38; Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>","ama":"Chatterjee K, Horn F, Löding C. Obliging games. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:284-296. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>","chicago":"Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>.","ieee":"K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.","short":"K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.","mla":"Chatterjee, Krishnendu, et al. <i>Obliging Games</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–96, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>.","ista":"Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296."},"date_updated":"2021-01-12T07:52:41Z","type":"conference","date_published":"2010-09-08T00:00:00Z","volume":6269,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:05:32Z","oa_version":"None","publication_status":"published","intvolume":"      6269","alternative_title":["LNCS"],"month":"09","title":"Obliging games","scopus_import":1,"_id":"3854","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian"},{"first_name":"Christof","last_name":"Löding","full_name":"Löding, Christof"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","location":"Paris, France","end_date":"2010-09-03"},"quality_controlled":"1","page":"284 - 296","language":[{"iso":"eng"}]},{"has_accepted_license":"1","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","month":"08","language":[{"iso":"eng"}],"conference":{"location":"Brno, Czech Republic","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"type":"conference","date_published":"2010-08-01T00:00:00Z","oa":1,"publist_id":"2326","file":[{"date_created":"2018-12-12T10:13:51Z","file_size":173948,"checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5038","creator":"system"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5395"}]},"scopus_import":1,"_id":"3855","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:32Z","publication_status":"published","intvolume":"      6281","alternative_title":["LNCS"],"title":"Qualitative analysis of partially-observable Markov Decision Processes","pubrep_id":"61","quality_controlled":"1","ec_funded":1,"page":"258 - 269","file_date_updated":"2020-07-14T12:46:17Z","publisher":"Springer","year":"2010","citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. Vol. 6281, Springer, 2010, pp. 258–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>"},"date_updated":"2023-02-23T12:24:22Z","day":"01","doi":"10.1007/978-3-642-15155-2_24","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists 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 problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives."}],"volume":6281,"ddc":["004"]},{"month":"09","oa_version":"Preprint","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"conference":{"start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","location":"Brno, Czech Republic"},"language":[{"iso":"eng"}],"oa":1,"publist_id":"2325","date_published":"2010-09-06T00:00:00Z","type":"conference","related_material":{"record":[{"status":"public","id":"1731","relation":"later_version"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1006.0673v1","open_access":"1"}],"pubrep_id":"60","title":"Randomness for free","alternative_title":["LNCS"],"intvolume":"      6281","publication_status":"published","date_created":"2018-12-11T12:05:32Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"_id":"3856","scopus_import":1,"publisher":"Springer","page":"246 - 257","quality_controlled":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"doi":"10.1007/978-3-642-15155-2_23","day":"06","date_updated":"2023-02-23T10:12:00Z","year":"2010","citation":{"ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","mla":"Chatterjee, Krishnendu, et al. <i>Randomness for Free</i>. Vol. 6281, Springer, 2010, pp. 246–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>"},"volume":6281,"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign."},{"conference":{"start_date":"2010-09-21","name":"ATVA: Automated Technology for Verification and Analysis","location":"Singapore, Singapore","end_date":"2010-09-24"},"language":[{"iso":"eng"}],"month":"10","oa_version":"None","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","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","id":"5392","relation":"earlier_version"}]},"publist_id":"2324","date_published":"2010-10-12T00:00:00Z","type":"conference","publisher":"Springer","page":"1 - 16","ec_funded":1,"quality_controlled":"1","title":"Probabilistic Automata on infinite words: decidability and undecidability results","pubrep_id":"28","alternative_title":["LNCS"],"intvolume":"      6252","publication_status":"published","date_created":"2018-12-11T12:05:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"_id":"3857","scopus_import":1,"volume":6252,"abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"doi":"10.1007/978-3-642-15643-4_1","day":"12","date_updated":"2023-02-23T12:24:14Z","citation":{"apa":"Chatterjee, K., &#38; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>","ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. Vol. 6252, Springer, 2010, pp. 1–16, doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>.","ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16."},"year":"2010"},{"file_date_updated":"2020-07-14T12:46:18Z","page":"1 - 14","quality_controlled":"1","publisher":"Springer","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"_id":"3858","scopus_import":1,"title":"The complexity of partial-observation parity games","alternative_title":["LNCS"],"intvolume":"      6397","publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:05:33Z","article_processing_charge":"No","ddc":["000"],"volume":6397,"date_updated":"2021-01-12T07:52:43Z","year":"2010","citation":{"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>","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>","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>.","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.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, 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."},"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."}],"doi":"10.1007/978-3-642-16242-8_1","day":"09","language":[{"iso":"eng"}],"conference":{"end_date":"2010-10-15","location":"Yogyakarta, Indonesia","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2010-10-10"},"has_accepted_license":"1","month":"12","oa_version":"Submitted Version","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","file_id":"7872","creator":"dernst","date_created":"2020-05-19T16:29:04Z","file_size":142836,"checksum":"770e86e5d78c56fddb4786a8da7ef126","date_updated":"2020-07-14T12:46:18Z","file_name":"2010_LPAR_Chatterjee.pdf","content_type":"application/pdf"}],"date_published":"2010-12-09T00:00:00Z","type":"conference","oa":1,"publist_id":"2323"}]