[{"month":"04","citation":{"ista":"Guzmán J, Jonas PM. 2010. Beyond TARPs: The growing list of auxiliary AMPAR subunits. Neuron. 66(1), 8–10.","apa":"Guzmán, J., &#38; Jonas, P. M. (2010). Beyond TARPs: The growing list of auxiliary AMPAR subunits. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">https://doi.org/10.1016/j.neuron.2010.04.003</a>","ama":"Guzmán J, Jonas PM. Beyond TARPs: The growing list of auxiliary AMPAR subunits. <i>Neuron</i>. 2010;66(1):8-10. doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">10.1016/j.neuron.2010.04.003</a>","ieee":"J. Guzmán and P. M. Jonas, “Beyond TARPs: The growing list of auxiliary AMPAR subunits,” <i>Neuron</i>, vol. 66, no. 1. Elsevier, pp. 8–10, 2010.","mla":"Guzmán, José, and Peter M. Jonas. “Beyond TARPs: The Growing List of Auxiliary AMPAR Subunits.” <i>Neuron</i>, vol. 66, no. 1, Elsevier, 2010, pp. 8–10, doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">10.1016/j.neuron.2010.04.003</a>.","short":"J. Guzmán, P.M. Jonas, Neuron 66 (2010) 8–10.","chicago":"Guzmán, José, and Peter M Jonas. “Beyond TARPs: The Growing List of Auxiliary AMPAR Subunits.” <i>Neuron</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">https://doi.org/10.1016/j.neuron.2010.04.003</a>."},"department":[{"_id":"PeJo"}],"publist_id":"2377","date_created":"2018-12-11T12:05:25Z","date_updated":"2021-01-12T07:52:31Z","intvolume":"        66","volume":66,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/20399724"}],"doi":"10.1016/j.neuron.2010.04.003","issue":"1","_id":"3832","day":"15","date_published":"2010-04-15T00:00:00Z","title":"Beyond TARPs: The growing list of auxiliary AMPAR subunits","publication":"Neuron","quality_controlled":"1","publication_status":"published","scopus_import":1,"type":"journal_article","publisher":"Elsevier","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","first_name":"José","full_name":"Guzmán, José","last_name":"Guzmán"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"page":"8 - 10","oa_version":"Published Version","status":"public","year":"2010","oa":1,"pmid":1,"language":[{"iso":"eng"}],"external_id":{"pmid":["20399724"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"A recent paper by von Engelhardt et al. identifies a novel auxiliary subunit of native AMPARs, termedCKAMP44. Unlike other auxiliary subunits, CKAMP44 accelerates desensitization and prolongs recovery from desensitization. CKAMP44 is highly expressed in hippocampal dentate gyrus granule cells and decreases the paired-pulse ratio at perforant path input synapses. Thus, both principal and auxiliary AMPAR subunits control the time course of signaling at glutamatergic synapses."}],"article_processing_charge":"No"},{"file":[{"file_size":1919130,"file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","creator":"system","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:16:29Z","file_id":"5217","checksum":"220239fae76f7b03c4d7f05d74ef426f"}],"volume":4,"doi":"10.1186/1752-0509-4-42","issue":"42","_id":"3834","month":"04","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.","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>","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>."},"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.","department":[{"_id":"ToHe"}],"publist_id":"2374","date_created":"2018-12-11T12:05:25Z","date_updated":"2021-01-12T07:52:32Z","intvolume":"         4","has_accepted_license":"1","publication_status":"published","type":"journal_article","scopus_import":1,"quality_controlled":"1","publisher":"BioMed Central","day":"08","date_published":"2010-04-08T00:00:00Z","title":"Solving the chemical master equation using sliding windows","publication":"BMC Systems Biology","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pubrep_id":"72","year":"2010","author":[{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"},{"full_name":"Goel, Rushil","last_name":"Goel","first_name":"Rushil"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"page":"1 - 19","oa_version":"Published Version","status":"public","file_date_updated":"2020-07-14T12:46:16Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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"}],"ddc":["005"],"oa":1,"language":[{"iso":"eng"}]},{"pubrep_id":"68","year":"2010","oa_version":"Submitted Version","status":"public","page":"55 - 65","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"full_name":"Mikeev, Linar","last_name":"Mikeev","first_name":"Linar"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"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"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:16Z","language":[{"iso":"eng"}],"ddc":["004"],"oa":1,"_id":"3838","conference":{"location":"Trento, Italy","start_date":"2010-09-29","name":"CMSB: Computational Methods in Systems Biology","end_date":"2010-10-01"},"file":[{"date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:15:55Z","access_level":"open_access","relation":"main_file","file_id":"5179","checksum":"81cb6f0babd97151b171d1ce86582831","content_type":"application/pdf","creator":"system","file_size":671790,"file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf"}],"doi":"10.1145/1839764.1839772","date_updated":"2021-01-12T07:52:33Z","date_created":"2018-12-11T12:05:27Z","publist_id":"2356","department":[{"_id":"ToHe"}],"month":"09","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>","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.","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.","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 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>."},"scopus_import":1,"publication_status":"published","type":"conference","quality_controlled":"1","publisher":"Springer","has_accepted_license":"1","date_published":"2010-09-29T00:00:00Z","title":"Hybrid numerical solution of the chemical master equation","day":"29"},{"author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"last_name":"Kovács","full_name":"Kovács, Laura","first_name":"Laura"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"page":"163 - 179","oa_version":"Submitted Version","status":"public","pubrep_id":"69","year":"2010","ddc":["005"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:16Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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"}],"month":"01","citation":{"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.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 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>.","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>","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>","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."},"acknowledgement":"The research was supported by the Swiss NSF.","publist_id":"2357","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:52:33Z","date_created":"2018-12-11T12:05:27Z","intvolume":"      5944","file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:13:09Z","relation":"main_file","date_updated":"2020-07-14T12:46:16Z","file_id":"4989","checksum":"da69b13a2d9a7a316c909e09c1090cef","file_size":251265,"file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","creator":"system"}],"volume":5944,"doi":"10.1007/978-3-642-11319-2_14","conference":{"start_date":"2010-01-17","location":"Madrid, Spain","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2010-01-19"},"_id":"3839","day":"01","title":"Invariant and type inference for matrices","date_published":"2010-01-01T00:00:00Z","alternative_title":["LNCS"],"has_accepted_license":"1","type":"conference","publication_status":"published","scopus_import":1,"quality_controlled":"1","publisher":"Springer"},{"ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:16Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). 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."}],"author":[{"first_name":"Frédéric","full_name":"Didier, Frédéric","last_name":"Didier"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"last_name":"Wolf","full_name":"Wolf, Verena","first_name":"Verena"}],"page":"441 - 452","related_material":{"record":[{"id":"3843","status":"public","relation":"earlier_version"}]},"oa_version":"Submitted Version","status":"public","pubrep_id":"66","year":"2010","day":"15","title":"Fast adaptive uniformization of the chemical master equation","date_published":"2010-11-15T00:00:00Z","publication":"IET Systems Biology","has_accepted_license":"1","quality_controlled":"1","publication_status":"published","scopus_import":1,"type":"journal_article","publisher":"Institution of Engineering and Technology","month":"11","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>.","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.","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."},"publist_id":"2349","department":[{"_id":"ToHe"}],"date_updated":"2023-02-23T11:45:08Z","date_created":"2018-12-11T12:05:28Z","intvolume":"         4","file":[{"creator":"system","file_size":222890,"file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","date_created":"2018-12-12T10:17:02Z","date_updated":"2020-07-14T12:46:16Z","access_level":"open_access","relation":"main_file","file_id":"5254","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","content_type":"application/pdf"}],"volume":4,"doi":"10.1049/iet-syb.2010.0005","issue":"6","_id":"3842"},{"department":[{"_id":"ToHe"}],"publist_id":"2342","date_created":"2018-12-11T12:05:29Z","date_updated":"2021-01-12T07:52:37Z","intvolume":"      6397","month":"10","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.","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>","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>."},"conference":{"start_date":"2010-10-10","location":"Yogyakarta, Indonesia","end_date":"2010-10-15","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"_id":"3845","file":[{"file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","file_size":186143,"creator":"system","content_type":"application/pdf","file_id":"4790","checksum":"913af269da6710f2174f470b48ab7a82","date_created":"2018-12-12T10:10:05Z","date_updated":"2020-07-14T12:46:17Z","relation":"main_file","access_level":"open_access"}],"volume":6397,"doi":"10.1007/978-3-642-16242-8_25","day":"01","title":"Aligators for arrays","date_published":"2010-10-01T00:00:00Z","type":"conference","scopus_import":1,"publication_status":"published","quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"has_accepted_license":"1","oa_version":"Submitted Version","status":"public","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"page":"348 - 356","pubrep_id":"64","year":"2010","language":[{"iso":"eng"}],"ddc":["005"],"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:17Z"},{"year":"2010","pubrep_id":"63","author":[{"last_name":"Didier","full_name":"Didier, Frédéric","first_name":"Frédéric"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maria","full_name":"Mateescu, Maria","last_name":"Mateescu"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"page":"193 - 194","status":"public","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:17Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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."}],"oa":1,"ddc":["004"],"language":[{"iso":"eng"}],"doi":"10.1109/QEST.2010.33","file":[{"file_size":433824,"file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:09:03Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","checksum":"38707b149d2174f01be406e794ffa849","file_id":"4726"}],"conference":{"end_date":"2010-09-18","name":"QEST: Quantitative Evaluation of Systems","location":"Williamsburg, USA","start_date":"2010-09-15"},"_id":"3847","citation":{"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>.","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>.","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.","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>","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."},"month":"10","publist_id":"2339","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_updated":"2021-01-12T07:52:37Z","date_created":"2018-12-11T12:05:29Z","has_accepted_license":"1","publisher":"IEEE","quality_controlled":"1","type":"conference","scopus_import":1,"publication_status":"published","day":"14","date_published":"2010-10-14T00:00:00Z","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks"},{"quality_controlled":"1","scopus_import":1,"publication_status":"published","type":"conference","publisher":"Springer","alternative_title":["LNCS"],"has_accepted_license":"1","day":"10","title":"Persistent homology under non-uniform error","date_published":"2010-08-10T00:00:00Z","conference":{"start_date":"2010-08-23","location":"Brno, Czech Republic","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27"},"_id":"3849","file":[{"relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:13:13Z","date_updated":"2020-07-14T12:46:17Z","file_id":"4994","checksum":"af61e1c2bb42f3d556179d4692caeb1b","content_type":"application/pdf","creator":"system","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf","file_size":142357}],"volume":6281,"doi":"10.1007/978-3-642-15155-2_2","publist_id":"2333","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:52:38Z","date_created":"2018-12-11T12:05:30Z","intvolume":"      6281","month":"08","citation":{"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.","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>","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>.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.","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>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:17Z","language":[{"iso":"eng"}],"ddc":["000"],"oa":1,"pubrep_id":"537","year":"2010","oa_version":"Submitted Version","status":"public","author":[{"last_name":"Bendich","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Kerber, Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"first_name":"Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","full_name":"Patel, Amit","last_name":"Patel"}],"page":"12 - 23"},{"type":"journal_article","publication_status":"published","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Physical Society","oa":1,"date_published":"2010-01-04T00:00:00Z","title":"STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects","day":"04","language":[{"iso":"eng"}],"publication":"Physical Review Letters","volume":104,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/0908.0371.pdf"}],"doi":"10.1103/PhysRevLett.104.016401","issue":"1","_id":"385","year":"2010","extern":"1","month":"01","author":[{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"},{"first_name":"James","full_name":"Analytis, James","last_name":"Analytis"},{"full_name":"Chu, Jiunhaw","last_name":"Chu","first_name":"Jiunhaw"},{"first_name":"Ian","full_name":"Fisher, Ian","last_name":"Fisher"},{"first_name":"Yulin","last_name":"Chen","full_name":"Chen, Yulin"},{"last_name":"Shen","full_name":"Shen, Zhixun","first_name":"Zhixun"},{"first_name":"Aiping","last_name":"Fang","full_name":"Fang, Aiping"},{"last_name":"Kapitulnik","full_name":"Kapitulnik, Aharon","first_name":"Aharon"}],"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).","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>","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>","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.","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>.","short":"Z. Alpichshev, J. Analytis, J. Chu, I. Fisher, Y. Chen, Z. Shen, A. Fang, A. Kapitulnik, Physical Review Letters 104 (2010).","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>."},"date_created":"2018-12-11T11:46:10Z","date_updated":"2021-01-12T07:52:39Z","oa_version":"None","publist_id":"7444","status":"public","intvolume":"       104"},{"alternative_title":["LNCS"],"arxiv":1,"quality_controlled":"1","type":"conference","publication_status":"published","scopus_import":1,"publisher":"Springer","title":"Energy parity games","date_published":"2010-09-10T00:00:00Z","day":"10","volume":6199,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1001.5183"}],"doi":"10.1007/978-3-642-14162-1_50","_id":"3851","conference":{"name":" ICALP: Automata, Languages and Programming, 37th International Colloquium","end_date":"2010-07-10","start_date":"2010-07-06","location":"Bordeaux, France"},"month":"09","citation":{"ista":"Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 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>","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.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 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>.","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>."},"date_created":"2018-12-11T12:05:31Z","date_updated":"2023-02-23T11:06:35Z","publist_id":"2330","department":[{"_id":"KrCh"}],"intvolume":"      6199","external_id":{"arxiv":["1001.5183"]},"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."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"year":"2010","page":"599 - 610","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"related_material":{"record":[{"id":"2972","status":"public","relation":"later_version"}]},"oa_version":"Preprint","status":"public"},{"file_date_updated":"2020-07-14T12:46:17Z","external_id":{"arxiv":["1006.1403"]},"article_processing_charge":"No","abstract":[{"lang":"eng","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. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"oa":1,"language":[{"iso":"eng"}],"pubrep_id":"491","year":"2010","page":"22 - 29","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"oa_version":"Published Version","status":"public","alternative_title":["EPTCS"],"has_accepted_license":"1","arxiv":1,"quality_controlled":"1","type":"conference","scopus_import":"1","publication_status":"published","publisher":"EPTCS","title":"Discounting in games across time scales","date_published":"2010-06-08T00:00:00Z","day":"08","volume":25,"file":[{"creator":"system","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","file_size":74598,"checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_id":"4937","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:12:19Z","relation":"main_file","content_type":"application/pdf"}],"doi":"10.4204/EPTCS.25.6","_id":"3852","conference":{"start_date":"2010-06-17","location":"Minori, Italy","end_date":"2010-06-18","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"month":"06","citation":{"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>","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>","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 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>.","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.","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."},"date_updated":"2023-09-04T11:47:04Z","date_created":"2018-12-11T12:05:31Z","publist_id":"2329","department":[{"_id":"KrCh"}],"intvolume":"        25"},{"year":"2010","pubrep_id":"62","ec_funded":1,"status":"public","oa_version":"Submitted Version","page":"269 - 283","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Philippe","last_name":"Rannou","full_name":"Rannou, Philippe"}],"abstract":[{"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.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:17Z","language":[{"iso":"eng"}],"oa":1,"ddc":["000","005"],"_id":"3853","conference":{"end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France"},"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-642-15375-4_19","volume":6269,"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:15:41Z","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","relation":"main_file","checksum":"4f753ae99d076553fb8733e2c8b390e2","file_id":"5163","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","file_size":233260,"creator":"system"}],"intvolume":"      6269","date_created":"2018-12-11T12:05:31Z","date_updated":"2021-01-12T07:52:40Z","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"publist_id":"2328","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.","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>","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 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>.","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.","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>."},"month":"11","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":1,"quality_controlled":"1","type":"conference","publication_status":"published","alternative_title":["LNCS"],"has_accepted_license":"1","title":"Mean-payoff automaton expressions","date_published":"2010-11-18T00:00:00Z","day":"18"},{"related_material":{"record":[{"id":"5395","status":"public","relation":"earlier_version"}]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"page":"258 - 269","status":"public","oa_version":"Submitted Version","ec_funded":1,"year":"2010","pubrep_id":"61","oa":1,"ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:17Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"citation":{"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>","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>","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.","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>.","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>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","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."},"month":"08","intvolume":"      6281","publist_id":"2326","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:32Z","date_updated":"2023-02-23T12:24:22Z","doi":"10.1007/978-3-642-15155-2_24","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","file_id":"5038","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:13:51Z","relation":"main_file","file_size":173948,"file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","creator":"system"}],"volume":6281,"conference":{"end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","location":"Brno, Czech Republic","start_date":"2010-08-23"},"_id":"3855","day":"01","date_published":"2010-08-01T00:00:00Z","title":"Qualitative analysis of partially-observable Markov Decision Processes","alternative_title":["LNCS"],"has_accepted_license":"1","publisher":"Springer","quality_controlled":"1","publication_status":"published","scopus_import":1,"type":"conference"},{"_id":"3856","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","start_date":"2010-08-23","location":"Brno, Czech Republic"},"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-642-15155-2_23","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"volume":6281,"intvolume":"      6281","date_updated":"2023-02-23T10:12:00Z","date_created":"2018-12-11T12:05:32Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2325","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","citation":{"short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 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>.","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.","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>.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","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>","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>"},"month":"09","publisher":"Springer","publication_status":"published","type":"conference","quality_controlled":"1","scopus_import":1,"alternative_title":["LNCS"],"title":"Randomness for free","date_published":"2010-09-06T00:00:00Z","day":"06","year":"2010","pubrep_id":"60","ec_funded":1,"status":"public","oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"later_version","id":"1731"}]},"page":"246 - 257","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Hugo","full_name":"Gimbert, Hugo","last_name":"Gimbert"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"abstract":[{"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. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa":1},{"year":"2010","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"page":"1 - 14","oa_version":"Submitted Version","status":"public","file_date_updated":"2020-07-14T12:46:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","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."}],"ddc":["000"],"oa":1,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","date_created":"2020-05-19T16:29:04Z","access_level":"open_access","relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","file_id":"7872","file_name":"2010_LPAR_Chatterjee.pdf","file_size":142836,"creator":"dernst"}],"volume":6397,"doi":"10.1007/978-3-642-16242-8_1","conference":{"start_date":"2010-10-10","location":"Yogyakarta, Indonesia","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2010-10-15"},"_id":"3858","month":"12","citation":{"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>","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>","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.","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>.","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>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.","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."},"department":[{"_id":"KrCh"}],"publist_id":"2323","date_updated":"2021-01-12T07:52:43Z","date_created":"2018-12-11T12:05:33Z","intvolume":"      6397","alternative_title":["LNCS"],"has_accepted_license":"1","scopus_import":1,"quality_controlled":"1","type":"conference","publication_status":"published","publisher":"Springer","day":"09","title":"The complexity of partial-observation parity games","date_published":"2010-12-09T00:00:00Z"},{"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"pubrep_id":"59","year":"2010","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, 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"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"page":"505 - 516","oa_version":"Submitted Version","status":"public","file_date_updated":"2020-07-14T12:46:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.","lang":"eng"}],"ddc":["005"],"oa":1,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","date_created":"2018-12-12T10:15:27Z","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z","checksum":"1caabd6319b979927208117a41192637","file_id":"5147","content_type":"application/pdf","creator":"system","file_size":178278,"file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf"},{"content_type":"application/pdf","checksum":"3a59759ceeacdb5b578f3803d5e6769b","file_id":"5148","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z","date_created":"2018-12-12T10:15:28Z","file_name":"IST-2016-59-v2+1_2_1_.pdf","file_size":477976,"creator":"system"}],"volume":8,"doi":"10.4230/LIPIcs.FSTTCS.2010.505","conference":{"end_date":"2010-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15","location":"Chennai, India"},"_id":"3860","month":"12","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","mla":"Chatterjee, Krishnendu, et al. <i>Generalized Mean-Payoff and Energy Games</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2321","date_updated":"2021-01-12T07:52:44Z","date_created":"2018-12-11T12:05:34Z","intvolume":"         8","has_accepted_license":"1","alternative_title":["LIPIcs"],"publication_status":"published","scopus_import":1,"quality_controlled":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"13","date_published":"2010-12-13T00:00:00Z","title":"Generalized mean-payoff and energy games"},{"publist_id":"2317","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T11:46:57Z","date_created":"2018-12-11T12:05:34Z","intvolume":"       208","month":"06","citation":{"short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” <i>Information and Computation</i>, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>"},"issue":"6","_id":"3861","file":[{"checksum":"13bff93f3c2a014e2908145a4517f177","file_id":"4911","date_updated":"2020-07-14T12:46:18Z","relation":"main_file","date_created":"2018-12-12T10:11:54Z","access_level":"open_access","content_type":"application/pdf","creator":"system","file_size":189120,"file_name":"IST-2012-56-v1+1_Strategy_logic.pdf"}],"volume":208,"doi":"10.1016/j.ic.2009.07.004","day":"01","date_published":"2010-06-01T00:00:00Z","title":"Strategy logic","publication":"Information and Computation","publication_status":"published","quality_controlled":"1","type":"journal_article","scopus_import":1,"publisher":"Elsevier","has_accepted_license":"1","oa_version":"Submitted Version","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"page":"677 - 693","related_material":{"record":[{"id":"3884","status":"public","relation":"earlier_version"}]},"pubrep_id":"56","year":"2010","language":[{"iso":"eng"}],"ddc":["000","004"],"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula)."}],"file_date_updated":"2020-07-14T12:46:18Z"},{"citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2010;11(4). doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4. ACM, 2010.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4, 23, ACM, 2010, doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010).","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2010. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>."},"month":"07","intvolume":"        11","publist_id":"2318","date_created":"2018-12-11T12:05:34Z","date_updated":"2022-03-21T08:20:03Z","doi":"10.1145/1805950.1805953","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"file":[{"file_id":"5230","checksum":"f2e50bbd6871fba0aec30bd9625a1ee7","date_created":"2018-12-12T10:16:41Z","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","creator":"system","file_size":169136,"file_name":"IST-2012-57-v1+1_Quantitative_languages.pdf"}],"volume":11,"_id":"3862","extern":"1","issue":"4","publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","title":"Quantitative languages","date_published":"2010-07-01T00:00:00Z","has_accepted_license":"1","publisher":"ACM","scopus_import":"1","type":"journal_article","publication_status":"published","quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"status":"public","oa_version":"Submitted Version","ec_funded":1,"year":"2010","pubrep_id":"57","oa":1,"ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:18Z","article_number":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of the language-inclusion problem remains open for some classes of weighted automata, we introduce a notion of quantitative simulation that is decidable and implies language inclusion. We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized."}],"article_processing_charge":"No"},{"file_date_updated":"2020-07-14T12:46:18Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs."}],"oa":1,"ddc":["005"],"language":[{"iso":"eng"}],"ec_funded":1,"year":"2010","pubrep_id":"58","related_material":{"record":[{"id":"3880","status":"public","relation":"earlier_version"}]},"author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"De Wulf, Martin","last_name":"De Wulf","first_name":"Martin"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"page":"1206 - 1220","status":"public","oa_version":"Submitted Version","has_accepted_license":"1","publisher":"Elsevier","publication_status":"published","scopus_import":1,"quality_controlled":"1","type":"journal_article","publication":"Information and Computation","day":"01","title":"Strategy construction for parity games with imperfect information","date_published":"2010-10-01T00:00:00Z","doi":"10.1016/j.ic.2009.09.006","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:17:44Z","relation":"main_file","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_id":"5300","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","file_size":287496,"file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","creator":"system"}],"volume":208,"_id":"3863","issue":"10","citation":{"ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. 2010;208(10):1206-1220. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>.","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” <i>Information and Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010."},"month":"10","intvolume":"       208","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2319","date_created":"2018-12-11T12:05:35Z","date_updated":"2023-02-23T11:46:47Z"},{"year":"2010","page":"380 - 395","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"related_material":{"record":[{"id":"1856","status":"public","relation":"later_version"}]},"oa_version":"Preprint","status":"public","abstract":[{"lang":"eng","text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"volume":6174,"doi":"10.1007/978-3-642-14295-6_34","_id":"3864","conference":{"end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"201-07-15","location":"Edinburgh, United Kingdom"},"month":"07","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","mla":"Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395."},"date_updated":"2023-02-23T10:17:28Z","date_created":"2018-12-11T12:05:35Z","publist_id":"2313","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"intvolume":"      6174","alternative_title":["LNCS"],"scopus_import":1,"quality_controlled":"1","type":"conference","publication_status":"published","publisher":"Springer","title":"Measuring and synthesizing systems in probabilistic environments","date_published":"2010-07-09T00:00:00Z","day":"09"}]