[{"_id":"3849","date_updated":"2021-01-12T07:52:38Z","type":"conference","volume":6281,"status":"public","quality_controlled":"1","pubrep_id":"537","date_published":"2010-08-10T00:00:00Z","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","last_name":"Bendich","full_name":"Bendich, Paul","first_name":"Paul"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber"},{"last_name":"Patel","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","full_name":"Patel, Amit","first_name":"Amit"}],"scopus_import":1,"conference":{"location":"Brno, Czech Republic","start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15155-2_2","title":"Persistent homology under non-uniform error","page":"12 - 23","has_accepted_license":"1","date_created":"2018-12-11T12:05:30Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:17Z","month":"08","department":[{"_id":"HeEd"}],"day":"10","oa_version":"Submitted Version","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"}],"intvolume":"      6281","publist_id":"2333","citation":{"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>","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.","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>.","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>","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."},"file":[{"creator":"system","relation":"main_file","checksum":"af61e1c2bb42f3d556179d4692caeb1b","file_id":"4994","access_level":"open_access","date_created":"2018-12-12T10:13:13Z","file_size":142357,"date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf"}],"publisher":"Springer","alternative_title":["LNCS"],"ddc":["000"],"year":"2010","oa":1,"publication_status":"published"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/0908.0371.pdf"}],"year":"2010","publication_status":"published","oa":1,"intvolume":"       104","doi":"10.1103/PhysRevLett.104.016401","publist_id":"7444","title":"STM imaging of electronic waves on the surface of Bi2Te3 Topologically protected surface states and hexagonal warping effects","citation":{"short":"Z. Alpichshev, J. Analytis, J. Chu, I. Fisher, Y. Chen, Z. Shen, A. Fang, A. Kapitulnik, Physical Review Letters 104 (2010).","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).","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>.","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>","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>.","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.","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>"},"publisher":"American Physical Society","publication":"Physical Review Letters","date_created":"2018-12-11T11:46:10Z","month":"01","extern":"1","date_published":"2010-01-04T00:00:00Z","author":[{"last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203"},{"last_name":"Analytis","full_name":"Analytis, James","first_name":"James"},{"first_name":"Jiunhaw","full_name":"Chu, Jiunhaw","last_name":"Chu"},{"full_name":"Fisher, Ian","first_name":"Ian","last_name":"Fisher"},{"full_name":"Chen, Yulin","first_name":"Yulin","last_name":"Chen"},{"last_name":"Shen","full_name":"Shen, Zhixun","first_name":"Zhixun"},{"full_name":"Fang, Aiping","first_name":"Aiping","last_name":"Fang"},{"last_name":"Kapitulnik","first_name":"Aharon","full_name":"Kapitulnik, Aharon"}],"day":"04","issue":"1","oa_version":"None","abstract":[{"lang":"eng","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. "}],"language":[{"iso":"eng"}],"type":"journal_article","_id":"385","date_updated":"2021-01-12T07:52:39Z","volume":104,"status":"public"},{"department":[{"_id":"HeEd"}],"month":"01","date_published":"2010-01-01T00:00:00Z","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","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","first_name":"Michael"},{"full_name":"Pogalnikova, Roza","first_name":"Roza","last_name":"Pogalnikova"}],"day":"01","oa_version":"None","conference":{"location":"Dortmund, Germany","start_date":"2010-03-22","name":"EuroCG: European Workshop on Computational Geometry","end_date":"2010-03-24"},"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."}],"language":[{"iso":"eng"}],"type":"conference","_id":"3850","date_updated":"2021-01-12T07:52:39Z","status":"public","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2010","publication_status":"published","publist_id":"2334","title":"Polygonal reconstruction from approximate offsets","page":"12 - 23","citation":{"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.","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.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Polygonal Reconstruction from Approximate Offsets,” 12–23. TU Dortmund, 2010.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.","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."},"publisher":"TU Dortmund","date_created":"2018-12-11T12:05:30Z"},{"date_created":"2018-12-11T12:05:31Z","external_id":{"arxiv":["1001.5183"]},"page":"599 - 610","title":"Energy parity games","doi":"10.1007/978-3-642-14162-1_50","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","volume":6199,"date_updated":"2023-02-23T11:06:35Z","_id":"3851","type":"conference","language":[{"iso":"eng"}],"conference":{"start_date":"2010-07-06","location":"Bordeaux, France","end_date":"2010-07-10","name":" ICALP: Automata, Languages and Programming, 37th International Colloquium"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"scopus_import":1,"date_published":"2010-09-10T00:00:00Z","publisher":"Springer","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>.","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>","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.","ista":"Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.","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>"},"publist_id":"2330","intvolume":"      6199","publication_status":"published","oa":1,"year":"2010","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1001.5183"}],"alternative_title":["LNCS"],"abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"id":"2972","status":"public","relation":"later_version"}]},"day":"10","oa_version":"Preprint","arxiv":1,"month":"09","department":[{"_id":"KrCh"}]},{"file_date_updated":"2020-07-14T12:46:17Z","arxiv":1,"department":[{"_id":"KrCh"}],"month":"06","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. "}],"oa_version":"Published Version","day":"08","publist_id":"2329","intvolume":"        25","publisher":"EPTCS","citation":{"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>.","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>","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>.","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, 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>","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."},"file":[{"file_id":"4937","access_level":"open_access","relation":"main_file","checksum":"2bdf1e9103710555c6251ca4153cb5e9","creator":"system","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:12:19Z","file_size":74598}],"alternative_title":["EPTCS"],"publication_status":"published","oa":1,"year":"2010","ddc":["000"],"volume":25,"date_updated":"2023-09-04T11:47:04Z","_id":"3852","type":"conference","quality_controlled":"1","status":"public","scopus_import":"1","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"pubrep_id":"491","date_published":"2010-06-08T00:00:00Z","language":[{"iso":"eng"}],"conference":{"start_date":"2010-06-17","location":"Minori, Italy","end_date":"2010-06-18","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"title":"Discounting in games across time scales","doi":"10.4204/EPTCS.25.6","date_created":"2018-12-11T12:05:31Z","has_accepted_license":"1","page":"22 - 29","external_id":{"arxiv":["1006.1403"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"ec_funded":1,"title":"Mean-payoff automaton expressions","doi":"10.1007/978-3-642-15375-4_19","date_created":"2018-12-11T12:05:31Z","has_accepted_license":"1","page":"269 - 283","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":6269,"date_updated":"2021-01-12T07:52:40Z","_id":"3853","type":"conference","quality_controlled":"1","status":"public","scopus_import":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rannou","full_name":"Rannou, Philippe","first_name":"Philippe"}],"date_published":"2010-11-18T00:00:00Z","pubrep_id":"62","language":[{"iso":"eng"}],"conference":{"start_date":"2010-08-31","location":"Paris, France","end_date":"2010-09-03","name":"CONCUR: Concurrency Theory"},"publist_id":"2328","intvolume":"      6269","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:17Z","file_size":233260,"date_created":"2018-12-12T10:15:41Z","file_id":"5163","access_level":"open_access","relation":"main_file","checksum":"4f753ae99d076553fb8733e2c8b390e2","creator":"system"}],"citation":{"short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","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>","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>.","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.","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>"},"alternative_title":["LNCS"],"oa":1,"publication_status":"published","year":"2010","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:17Z","month":"11","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"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."}],"oa_version":"Submitted Version","day":"18"},{"doi":"10.1007/978-3-642-15375-4_20","intvolume":"      6269","publist_id":"2327","title":"Obliging games","page":"284 - 296","citation":{"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>.","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>.","ista":"Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.","short":"K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.","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>","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."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2018-12-11T12:05:32Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"year":"2010","publication_status":"published","_id":"3854","date_updated":"2021-01-12T07:52:41Z","type":"conference","volume":6269,"status":"public","quality_controlled":"1","department":[{"_id":"KrCh"}],"date_published":"2010-09-08T00:00:00Z","month":"09","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","full_name":"Horn, Florian","first_name":"Florian"},{"last_name":"Löding","first_name":"Christof","full_name":"Löding, Christof"}],"scopus_import":1,"day":"08","oa_version":"None","conference":{"end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France"},"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}]},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"page":"258 - 269","has_accepted_license":"1","date_created":"2018-12-11T12:05:32Z","doi":"10.1007/978-3-642-15155-2_24","title":"Qualitative analysis of partially-observable Markov Decision Processes","ec_funded":1,"conference":{"location":"Brno, Czech Republic","start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27"},"language":[{"iso":"eng"}],"date_published":"2010-08-01T00:00:00Z","pubrep_id":"61","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"scopus_import":1,"status":"public","quality_controlled":"1","_id":"3855","date_updated":"2023-02-23T12:24:22Z","type":"conference","volume":6281,"ddc":["004"],"year":"2010","publication_status":"published","oa":1,"alternative_title":["LNCS"],"citation":{"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>","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.","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>.","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>","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>."},"file":[{"file_id":"5038","access_level":"open_access","creator":"system","relation":"main_file","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","file_size":173948,"date_created":"2018-12-12T10:13:51Z"}],"publisher":"Springer","intvolume":"      6281","publist_id":"2326","day":"01","oa_version":"Submitted Version","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5395"}]},"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."}],"month":"08","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:17Z"},{"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","date_created":"2018-12-11T12:05:32Z","page":"246 - 257","title":"Randomness for free","ec_funded":1,"doi":"10.1007/978-3-642-15155-2_23","language":[{"iso":"eng"}],"conference":{"end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","location":"Brno, Czech Republic"},"scopus_import":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Gimbert","full_name":"Gimbert, Hugo","first_name":"Hugo"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"date_published":"2010-09-06T00:00:00Z","pubrep_id":"60","quality_controlled":"1","status":"public","volume":6281,"_id":"3856","type":"conference","date_updated":"2023-02-23T10:12:00Z","oa":1,"publication_status":"published","year":"2010","main_file_link":[{"url":"https://arxiv.org/abs/1006.0673v1","open_access":"1"}],"alternative_title":["LNCS"],"publisher":"Springer","citation":{"short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 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>.","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>","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.","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>"},"publist_id":"2325","intvolume":"      6281","related_material":{"record":[{"id":"1731","relation":"later_version","status":"public"}]},"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"}],"oa_version":"Preprint","day":"06","month":"09","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"quality_controlled":"1","status":"public","volume":6252,"_id":"3857","date_updated":"2023-02-23T12:24:14Z","type":"conference","language":[{"iso":"eng"}],"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2010-09-24","location":"Singapore, Singapore","start_date":"2010-09-21"},"scopus_import":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"28","date_published":"2010-10-12T00:00:00Z","date_created":"2018-12-11T12:05:33Z","page":"1 - 16","ec_funded":1,"title":"Probabilistic Automata on infinite words: decidability and undecidability results","doi":"10.1007/978-3-642-15643-4_1","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs 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.","lang":"eng"}],"related_material":{"record":[{"id":"5392","status":"public","relation":"earlier_version"}]},"oa_version":"None","day":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"10","publisher":"Springer","citation":{"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.","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>.","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>.","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>","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>","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."},"publist_id":"2324","intvolume":"      6252","publication_status":"published","year":"2010","alternative_title":["LNCS"]},{"department":[{"_id":"KrCh"}],"month":"12","article_processing_charge":"No","oa_version":"Submitted Version","day":"09","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."}],"file_date_updated":"2020-07-14T12:46:18Z","alternative_title":["LNCS"],"year":"2010","ddc":["000"],"publication_status":"published","oa":1,"intvolume":"      6397","publist_id":"2323","file":[{"file_name":"2010_LPAR_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","date_created":"2020-05-19T16:29:04Z","file_size":142836,"file_id":"7872","access_level":"open_access","relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","creator":"dernst"}],"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>","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.","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.","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>.","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>.","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>"},"publisher":"Springer","date_published":"2010-12-09T00:00:00Z","scopus_import":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"conference":{"location":"Yogyakarta, Indonesia","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2010-10-15"},"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:52:43Z","_id":"3858","type":"conference","volume":6397,"status":"public","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-16242-8_1","title":"The complexity of partial-observation parity games","page":"1 - 14","date_created":"2018-12-11T12:05:33Z","has_accepted_license":"1"},{"day":"20","oa_version":"None","conference":{"end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08","location":"Klosterneuburg, Austria"},"abstract":[{"text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications.","lang":"eng"}],"related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","description":"eBook available via IST BookList","relation":"other"}]},"language":[{"iso":"eng"}],"month":"09","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2010-09-20T00:00:00Z","status":"public","quality_controlled":"1","type":"conference_editor","_id":"3859","date_updated":"2019-11-14T08:42:42Z","volume":6246,"year":"2010","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>.","ama":"Chatterjee K, Henzinger TA, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol 6246. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>.","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (Eds.). (2010). <i>Formal modeling and analysis of timed systems</i> (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>","ieee":"K. Chatterjee and T. A. Henzinger, Eds., <i>Formal modeling and analysis of timed systems</i>, vol. 6246. Springer, 2010."},"publisher":"Springer","editor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"date_created":"2018-12-11T12:05:33Z","intvolume":"      6246","doi":"10.1007/978-3-642-15297-9","title":"Formal modeling and analysis of timed systems","publist_id":"2322"},{"scopus_import":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"pubrep_id":"59","date_published":"2010-12-13T00:00:00Z","language":[{"iso":"eng"}],"conference":{"start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"volume":8,"_id":"3860","date_updated":"2021-01-12T07:52:44Z","type":"conference","quality_controlled":"1","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Generalized mean-payoff and energy games","doi":"10.4230/LIPIcs.FSTTCS.2010.505","date_created":"2018-12-11T12:05:34Z","has_accepted_license":"1","page":"505 - 516","month":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"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"}],"oa_version":"Submitted Version","day":"13","file_date_updated":"2020-07-14T12:46:18Z","alternative_title":["LIPIcs"],"publication_status":"published","oa":1,"year":"2010","ddc":["005"],"publist_id":"2321","intvolume":"         8","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","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>","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>.","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>."},"file":[{"creator":"system","checksum":"1caabd6319b979927208117a41192637","relation":"main_file","access_level":"open_access","file_id":"5147","file_size":178278,"date_created":"2018-12-12T10:15:27Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf"},{"file_size":477976,"date_created":"2018-12-12T10:15:28Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2016-59-v2+1_2_1_.pdf","creator":"system","checksum":"3a59759ceeacdb5b578f3803d5e6769b","relation":"main_file","access_level":"open_access","file_id":"5148"}]},{"publication":"Information and Computation","date_created":"2018-12-11T12:05:34Z","has_accepted_license":"1","page":"677 - 693","title":"Strategy logic","doi":"10.1016/j.ic.2009.07.004","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","volume":208,"date_updated":"2023-02-23T11:46:57Z","_id":"3861","type":"journal_article","language":[{"iso":"eng"}],"scopus_import":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"pubrep_id":"56","date_published":"2010-06-01T00:00:00Z","publisher":"Elsevier","file":[{"access_level":"open_access","file_id":"4911","relation":"main_file","checksum":"13bff93f3c2a014e2908145a4517f177","creator":"system","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","file_size":189120,"date_created":"2018-12-12T10:11:54Z"}],"citation":{"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.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","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>.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>."},"publist_id":"2317","intvolume":"       208","oa":1,"publication_status":"published","year":"2010","ddc":["000","004"],"file_date_updated":"2020-07-14T12:46:18Z","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)."}],"related_material":{"record":[{"id":"3884","relation":"earlier_version","status":"public"}]},"oa_version":"Submitted Version","issue":"6","day":"01","month":"06","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"doi":"10.1145/1805950.1805953","title":"Quantitative languages","ec_funded":1,"date_created":"2018-12-11T12:05:34Z","publication":"ACM Transactions on Computational Logic (TOCL)","article_number":"23","has_accepted_license":"1","pubrep_id":"57","date_published":"2010-07-01T00:00:00Z","extern":"1","scopus_import":"1","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"_id":"3862","date_updated":"2022-03-21T08:20:03Z","type":"journal_article","volume":11,"status":"public","quality_controlled":"1","year":"2010","ddc":["004"],"oa":1,"publication_status":"published","intvolume":"        11","publist_id":"2318","file":[{"file_size":169136,"date_created":"2018-12-12T10:16:41Z","file_name":"IST-2012-57-v1+1_Quantitative_languages.pdf","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","relation":"main_file","checksum":"f2e50bbd6871fba0aec30bd9625a1ee7","creator":"system","file_id":"5230","access_level":"open_access"}],"citation":{"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>","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>.","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>","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>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010)."},"publisher":"ACM","month":"07","article_processing_charge":"No","oa_version":"Submitted Version","issue":"4","day":"01","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."}],"file_date_updated":"2020-07-14T12:46:18Z"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"10","oa_version":"Submitted Version","day":"01","issue":"10","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3880"}]},"file_date_updated":"2020-07-14T12:46:18Z","year":"2010","ddc":["005"],"publication_status":"published","oa":1,"intvolume":"       208","publist_id":"2319","file":[{"date_created":"2018-12-12T10:17:44Z","file_size":287496,"file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","relation":"main_file","creator":"system","file_id":"5300","access_level":"open_access"}],"citation":{"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.","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>","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","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>.","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>","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>."},"publisher":"Elsevier","pubrep_id":"58","date_published":"2010-10-01T00:00:00Z","scopus_import":1,"author":[{"last_name":"Berwanger","first_name":"Dietmar","full_name":"Berwanger, Dietmar"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"De Wulf","first_name":"Martin","full_name":"De Wulf, Martin"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"language":[{"iso":"eng"}],"type":"journal_article","_id":"3863","date_updated":"2023-02-23T11:46:47Z","volume":208,"status":"public","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.ic.2009.09.006","ec_funded":1,"title":"Strategy construction for parity games with imperfect information","page":"1206 - 1220","publication":"Information and Computation","date_created":"2018-12-11T12:05:35Z","has_accepted_license":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","page":"380 - 395","date_created":"2018-12-11T12:05:35Z","doi":"10.1007/978-3-642-14295-6_34","title":"Measuring and synthesizing systems in probabilistic environments","conference":{"name":"CAV: Computer Aided Verification","end_date":"2010-07-19","location":"Edinburgh, United Kingdom","start_date":"201-07-15"},"language":[{"iso":"eng"}],"date_published":"2010-07-09T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"scopus_import":1,"status":"public","quality_controlled":"1","date_updated":"2023-02-23T10:17:28Z","_id":"3864","type":"conference","volume":6174,"year":"2010","oa":1,"publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"alternative_title":["LNCS"],"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>","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>.","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>.","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.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395."},"publisher":"Springer","intvolume":"      6174","publist_id":"2313","day":"09","oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"id":"1856","relation":"later_version","status":"public"}]},"month":"07","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"date_created":"2018-12-11T12:05:35Z","editor":[{"last_name":"Rosenblum","full_name":"Rosenblum, David","first_name":"David"},{"full_name":"Taenzer, Gabriele","first_name":"Gabriele","last_name":"Taenzer"}],"publisher":"Springer","citation":{"apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>","ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.","mla":"Chatterjee, Krishnendu, et al. <i>Analyzing the Impact of Change in Multi-Threaded Programs</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 293–307, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>.","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:293-307. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>.","ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307."},"page":"293 - 307","title":"Analyzing the impact of change in multi-threaded programs","publist_id":"2315","intvolume":"      6013","doi":"10.1007/978-3-642-12029-9_21","publication_status":"published","year":"2010","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","volume":6013,"type":"conference","_id":"3865","date_updated":"2021-01-12T07:52:47Z","language":[{"iso":"eng"}],"abstract":[{"text":"We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool DIRECT. Our approach uses a combination of source code instrumentation and runtime management. The source code along with a test harness is instrumented to monitor Operating System (OS) and user defined function calls. DIRECT tracks all concurrency control primitives and, optionally, data from the program. DIRECT maintains an abstract global state that combines information from every thread, including the sequence of function calls and concurrency primitives executed. The runtime manager can insert delays, provoking thread inter-leavings that may exhibit bugs that are difficult to reach otherwise. The runtime manager collects an approximation of the reachable state space and uses this approximation to assess the impact of change in a new version of the program.","lang":"eng"}],"oa_version":"None","conference":{"end_date":"2010-03-28","name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","location":"Paphos, Cyprus"},"day":"21","scopus_import":1,"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Raman","full_name":"Raman, Vishwanath","first_name":"Vishwanath"},{"full_name":"Sánchez, César","first_name":"César","last_name":"Sánchez"}],"department":[{"_id":"KrCh"}],"month":"04","date_published":"2010-04-21T00:00:00Z"},{"abstract":[{"lang":"eng","text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees."}],"oa_version":"Submitted Version","day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"07","file_date_updated":"2020-07-14T12:46:19Z","publication_status":"published","oa":1,"year":"2010","ddc":["004"],"alternative_title":["LNCS"],"publisher":"Springer","file":[{"file_size":213083,"date_created":"2018-12-12T10:16:52Z","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","relation":"main_file","checksum":"9d204611c8d7855bed8134f8708a0010","creator":"system","access_level":"open_access","file_id":"5243"}],"citation":{"short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>"},"publist_id":"2310","intvolume":"      6174","language":[{"iso":"eng"}],"conference":{"start_date":"2010-07-15","location":"Edinburgh, UK","end_date":"2010-07-19","name":"CAV: Computer Aided Verification"},"scopus_import":1,"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Greimel","full_name":"Greimel, Karin","first_name":"Karin"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"}],"pubrep_id":"54","date_published":"2010-07-01T00:00:00Z","quality_controlled":"1","status":"public","volume":6174,"date_updated":"2021-01-12T07:52:47Z","_id":"3866","type":"conference","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:05:36Z","editor":[{"last_name":"Touili","first_name":"Tayssir","full_name":"Touili, Tayssir"},{"first_name":"Byron","full_name":"Cook, Byron","last_name":"Cook"},{"last_name":"Jackson","first_name":"Paul","full_name":"Jackson, Paul"}],"has_accepted_license":"1","page":"410 - 424","ec_funded":1,"title":"Robustness in the presence of liveness","doi":"10.1007/978-3-642-14295-6_36"},{"_id":"3867","date_updated":"2023-02-23T12:15:42Z","type":"journal_article","volume":6,"status":"public","tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"quality_controlled":"1","pubrep_id":"504","date_published":"2010-08-30T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.2168/LMCS-6(3:10)2010","ec_funded":1,"title":"Expressiveness and closure properties for quantitative languages","page":"1 - 23","has_accepted_license":"1","date_created":"2018-12-11T12:05:36Z","publication":"Logical Methods in Computer Science","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"file_date_updated":"2020-07-14T12:46:19Z","month":"08","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"30","issue":"3","oa_version":"Published Version","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"intvolume":"         6","publist_id":"2311","file":[{"file_size":216598,"date_created":"2018-12-12T10:17:54Z","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","relation":"main_file","checksum":"0243da726476817f2ea33b48b78be696","creator":"system","access_level":"open_access","file_id":"5312"},{"file_name":"IST-2016-55-v2+1_1007.4018.pdf","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_size":302416,"date_created":"2018-12-12T10:17:55Z","access_level":"open_access","file_id":"5313","relation":"main_file","checksum":"5e512b8503a9cb263de26331c4ee9cf2","creator":"system"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010."},"publisher":"International Federation of Computational Logic","ddc":["000","004"],"year":"2010","publication_status":"published","oa":1}]