[{"publisher":"Springer","department":[{"_id":"ToHe"}],"month":"10","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2011-10-11","location":"Taipei, Taiwan","end_date":"2011-10-14"},"page":"482 - 491","alternative_title":["LNCS"],"ddc":["000"],"intvolume":"      6996","language":[{"iso":"eng"}],"status":"public","doi":"10.1007/978-3-642-24372-1_37","date_published":"2011-10-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:07Z","volume":6996,"type":"conference","oa_version":"Submitted Version","article_processing_charge":"No","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:46:07Z","file_name":"2011_LNCS_Almagor.pdf","relation":"main_file","date_created":"2020-05-19T16:08:32Z","file_id":"7868","creator":"dernst","access_level":"open_access","checksum":"a7ca08a2cb1b6925f4c18a3034ae5659","file_size":182309,"content_type":"application/pdf"}],"abstract":[{"text":"Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains.","lang":"eng"}],"publication_status":"published","year":"2011","_id":"3326","date_created":"2018-12-11T12:02:41Z","has_accepted_license":"1","title":"What’s decidable about weighted automata ","oa":1,"day":"14","publist_id":"3309","citation":{"mla":"Almagor, Shaull, et al. <i>What’s Decidable about Weighted Automata </i>. Vol. 6996, Springer, 2011, pp. 482–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2011). What’s decidable about weighted automata  (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>","ama":"Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>.","ista":"Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.","short":"S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491."},"date_updated":"2021-01-12T07:42:40Z","author":[{"first_name":"Shaull","last_name":"Almagor","full_name":"Almagor, Shaull"},{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}]},{"_id":"3328","scopus_import":1,"year":"2011","date_created":"2018-12-11T12:02:42Z","conference":{"name":"SCG: Symposium on Computational Geometry","location":"Paris, France","start_date":"2011-06-13","end_date":"2011-06-15"},"page":"179 - 186","article_processing_charge":"No","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/inria-00480031/file/RR-7274.pdf"}],"quality_controlled":"1","abstract":[{"text":"We report on a generic uni- and bivariate algebraic kernel that is publicly available with CGAL 3.7. It comprises complete, correct, though efficient state-of-the-art implementations on polynomials, roots of polynomial systems, and the support to analyze algebraic curves defined by bivariate polynomials. The kernel design is generic, that is, various number types and substeps can be exchanged. It is accompanied with a ready-to-use interface to enable arrangements induced by algebraic curves, that have already been used as basis for various geometric applications, as arrangements on Dupin cyclides or the triangulation of algebraic surfaces. We present two novel applications: arrangements of rotated algebraic curves and Boolean set operations on polygons bounded by segments of algebraic curves. We also provide experiments showing that our general implementation is competitive and even often clearly outperforms existing implementations that are explicitly tailored for specific types of non-linear curves that are available in CGAL.","lang":"eng"}],"month":"06","publication_status":"published","publisher":"ACM","department":[{"_id":"HeEd"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3307","day":"13","citation":{"short":"E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.","apa":"Berberich, E., Hemmer, M., &#38; Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM. <a href=\"https://doi.org/10.1145/1998196.1998224\">https://doi.org/10.1145/1998196.1998224</a>","ama":"Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear geometric applications. In: ACM; 2011:179-186. doi:<a href=\"https://doi.org/10.1145/1998196.1998224\">10.1145/1998196.1998224</a>","ieee":"E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.","mla":"Berberich, Eric, et al. <i>A Generic Algebraic Kernel for Non Linear Geometric Applications</i>. ACM, 2011, pp. 179–86, doi:<a href=\"https://doi.org/10.1145/1998196.1998224\">10.1145/1998196.1998224</a>.","ista":"Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.","chicago":"Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. <a href=\"https://doi.org/10.1145/1998196.1998224\">https://doi.org/10.1145/1998196.1998224</a>."},"type":"conference","date_updated":"2021-01-12T07:42:41Z","author":[{"first_name":"Eric","last_name":"Berberich","full_name":"Berberich, Eric"},{"last_name":"Hemmer","first_name":"Michael","full_name":"Hemmer, Michael"},{"first_name":"Michael","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299"}],"title":"A generic algebraic kernel for non linear geometric applications","status":"public","language":[{"iso":"eng"}],"date_published":"2011-06-13T00:00:00Z","doi":"10.1145/1998196.1998224"},{"day":"13","publist_id":"3306","publication":"Proceedings of the twenty-seventh annual symposium on Computational geometry","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"conference","date_updated":"2023-02-23T11:12:57Z","citation":{"ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” In <i>Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry</i>, 187–96. ACM, 2011. <a href=\"https://doi.org/10.1145/1998196.1998225\">https://doi.org/10.1145/1998196.1998225</a>.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2011). Deconstructing approximate offsets. In <i>Proceedings of the twenty-seventh annual symposium on Computational geometry</i> (pp. 187–196). Paris, France: ACM. <a href=\"https://doi.org/10.1145/1998196.1998225\">https://doi.org/10.1145/1998196.1998225</a>","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In: <i>Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry</i>. ACM; 2011:187-196. doi:<a href=\"https://doi.org/10.1145/1998196.1998225\">10.1145/1998196.1998225</a>","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in <i>Proceedings of the twenty-seventh annual symposium on Computational geometry</i>, Paris, France, 2011, pp. 187–196.","mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” <i>Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry</i>, ACM, 2011, pp. 187–96, doi:<a href=\"https://doi.org/10.1145/1998196.1998225\">10.1145/1998196.1998225</a>.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196."},"author":[{"full_name":"Berberich, Eric","last_name":"Berberich","first_name":"Eric"},{"last_name":"Halperin","first_name":"Dan","full_name":"Halperin, Dan"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pogalnikova, Roza","last_name":"Pogalnikova","first_name":"Roza"}],"doi":"10.1145/1998196.1998225","date_published":"2011-06-13T00:00:00Z","language":[{"iso":"eng"}],"title":"Deconstructing approximate offsets","status":"public","date_created":"2018-12-11T12:02:42Z","scopus_import":1,"year":"2011","_id":"3329","page":"187 - 196","conference":{"end_date":"2011-06-15","start_date":"2011-06-13","location":"Paris, France","name":"SCG: Symposium on Computational Geometry"},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.2158"}],"oa_version":"Preprint","publisher":"ACM","publication_status":"published","department":[{"_id":"HeEd"}],"related_material":{"record":[{"status":"public","id":"3115","relation":"later_version"}]},"month":"06","abstract":[{"text":"We consider the offset-deconstruction problem: 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 P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution shape P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. An alternative algorithm, based purely on rational arithmetic, answers the same deconstruction problem, up to an uncertainty parameter, and its running time depends on the parameter δ (in addition to the other input parameters: n, δ and the radius of the disk). If the input shape is found to be approximable, the rational-arithmetic algorithm also computes an approximate solution shape for the problem. For convex shapes, the complexity of the exact decision algorithm 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. Our study is motivated by applications from two different domains. However, since the offset operation has numerous uses, we anticipate that the reverse question that we study here will be still more broadly applicable. We present results obtained with our implementation of the rational-arithmetic algorithm.","lang":"eng"}]},{"citation":{"short":"M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.","ista":"Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.","chicago":"Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. <a href=\"https://doi.org/10.1145/1993886.1993920\">https://doi.org/10.1145/1993886.1993920</a>.","ieee":"M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.","ama":"Kerber M, Sagraloff M. Root refinement for real polynomials. In: Springer; 2011:209-216. doi:<a href=\"https://doi.org/10.1145/1993886.1993920\">10.1145/1993886.1993920</a>","apa":"Kerber, M., &#38; Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer. <a href=\"https://doi.org/10.1145/1993886.1993920\">https://doi.org/10.1145/1993886.1993920</a>","mla":"Kerber, Michael, and Michael Sagraloff. <i>Root Refinement for Real Polynomials</i>. Springer, 2011, pp. 209–16, doi:<a href=\"https://doi.org/10.1145/1993886.1993920\">10.1145/1993886.1993920</a>."},"author":[{"last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael"},{"full_name":"Sagraloff, Michael","first_name":"Michael","last_name":"Sagraloff"}],"date_updated":"2021-01-12T07:42:42Z","type":"conference","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"08","publist_id":"3304","language":[{"iso":"eng"}],"title":"Root refinement for real polynomials","status":"public","external_id":{"arxiv":["1104.1362"]},"doi":"10.1145/1993886.1993920","date_published":"2011-06-08T00:00:00Z","conference":{"end_date":"2011-06-11","start_date":"2011-06-08","location":"California, USA","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation"},"page":"209 - 216","arxiv":1,"year":"2011","scopus_import":1,"_id":"3330","date_created":"2018-12-11T12:02:43Z","abstract":[{"lang":"eng","text":"We consider the problem of approximating all real roots of a square-free polynomial f. Given isolating intervals, our algorithm refines each of them to a width at most 2-L, that is, each of the roots is approximated to L bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only requiring finite approximations of the polynomial coefficient and choosing a suitable working precision adaptively. In this way, we get a correct algorithm that is simple to implement and practically efficient. Our algorithm uses the quadratic interval refinement method; we adapt that method to be able to cope with inaccuracies when evaluating f, without sacrificing its quadratic convergence behavior. We prove a bound on the bit complexity of our algorithm in terms of degree, coefficient size and discriminant. Our bound improves previous work on integer polynomials by a factor of deg f and essentially matches best known theoretical bounds on root approximation which are obtained by very sophisticated algorithms."}],"department":[{"_id":"HeEd"}],"publication_status":"published","publisher":"Springer","month":"06","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1362"}]},{"has_accepted_license":"1","issue":"3","title":"A note on the complexity of real algebraic hypersurfaces","publist_id":"3301","day":"17","oa":1,"publication":"Graphs and Combinatorics","citation":{"short":"M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.","apa":"Kerber, M., &#38; Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. <i>Graphs and Combinatorics</i>. Springer. <a href=\"https://doi.org/10.1007/s00373-011-1020-7\">https://doi.org/10.1007/s00373-011-1020-7</a>","ieee":"M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” <i>Graphs and Combinatorics</i>, vol. 27, no. 3. Springer, pp. 419–430, 2011.","ama":"Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. <i>Graphs and Combinatorics</i>. 2011;27(3):419-430. doi:<a href=\"https://doi.org/10.1007/s00373-011-1020-7\">10.1007/s00373-011-1020-7</a>","mla":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” <i>Graphs and Combinatorics</i>, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:<a href=\"https://doi.org/10.1007/s00373-011-1020-7\">10.1007/s00373-011-1020-7</a>.","ista":"Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430.","chicago":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” <i>Graphs and Combinatorics</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00373-011-1020-7\">https://doi.org/10.1007/s00373-011-1020-7</a>."},"date_updated":"2021-01-12T07:42:43Z","author":[{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"Submitted Version","article_type":"original","publication_status":"published","abstract":[{"text":"Given an algebraic hypersurface O in ℝd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the complex must lie on O. We give asymptotically tight worst-case bounds for algebraic plane curves. Our results gradually improve known bounds in higher dimensions; however, the question for tight bounds remains unsolved for d ≥ 3.","lang":"eng"}],"file":[{"file_name":"2011_GraphsCombi_Kerber.pdf","relation":"main_file","date_created":"2020-05-19T16:11:36Z","file_id":"7869","date_updated":"2020-07-14T12:46:08Z","checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","file_size":143976,"content_type":"application/pdf","creator":"dernst","access_level":"open_access"}],"date_created":"2018-12-11T12:02:43Z","_id":"3332","year":"2011","ddc":["500"],"intvolume":"        27","date_published":"2011-03-17T00:00:00Z","doi":"10.1007/s00373-011-1020-7","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":27,"month":"03","department":[{"_id":"HeEd"}],"publisher":"Springer","scopus_import":1,"page":"419 - 430"},{"publisher":"Springer","article_type":"letter_note","publication_status":"published","department":[{"_id":"HeEd"}],"month":"01","oa_version":"None","quality_controlled":"1","page":"1 - 2","scopus_import":1,"year":"2011","_id":"3334","date_created":"2018-12-11T12:02:44Z","language":[{"iso":"eng"}],"status":"public","title":"Letter from the new editors-in-chief","doi":"10.1007/s00454-010-9313-9","date_published":"2011-01-01T00:00:00Z","issue":"1","intvolume":"        45","volume":45,"type":"journal_article","citation":{"short":"H. Edelsbrunner, J. Pach, G. Ziegler, Discrete &#38; Computational Geometry 45 (2011) 1–2.","ama":"Edelsbrunner H, Pach J, Ziegler G. Letter from the new editors-in-chief. <i>Discrete &#38; Computational Geometry</i>. 2011;45(1):1-2. doi:<a href=\"https://doi.org/10.1007/s00454-010-9313-9\">10.1007/s00454-010-9313-9</a>","ieee":"H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 1. Springer, pp. 1–2, 2011.","apa":"Edelsbrunner, H., Pach, J., &#38; Ziegler, G. (2011). Letter from the new editors-in-chief. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-010-9313-9\">https://doi.org/10.1007/s00454-010-9313-9</a>","mla":"Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/s00454-010-9313-9\">10.1007/s00454-010-9313-9</a>.","ista":"Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete &#38; Computational Geometry. 45(1), 1–2.","chicago":"Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00454-010-9313-9\">https://doi.org/10.1007/s00454-010-9313-9</a>."},"date_updated":"2021-01-12T07:42:44Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Ziegler, Günter","first_name":"Günter","last_name":"Ziegler"}],"publication":"Discrete & Computational Geometry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","publist_id":"3297"},{"scopus_import":1,"arxiv":1,"page":"60 - 101","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1306.3640"}],"department":[{"_id":"HeEd"}],"publisher":"Springer","editor":[{"full_name":"Gavrilova, Marina","first_name":"Marina","last_name":"Gavrilova"},{"full_name":"Tan, Kenneth","last_name":"Tan","first_name":"Kenneth"},{"last_name":"Mostafavi","first_name":"Mir","full_name":"Mostafavi, Mir"}],"month":"11","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","volume":6970,"intvolume":"      6970","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-25249-5_3","date_published":"2011-11-09T00:00:00Z","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:02:44Z","series_title":"Special Issue on Voronoi Diagrams and Delaunay Triangulation","year":"2011","_id":"3335","quality_controlled":"1","oa_version":"Preprint","publication_status":"published","abstract":[{"text":"We study the topology of the Megaparsec Cosmic Web in terms of the scale-dependent Betti numbers, which formalize the topological information content of the cosmic mass distribution. While the Betti numbers do not fully quantify topology, they extend the information beyond conventional cosmological studies of topology in terms of genus and Euler characteristic. The richer information content of Betti numbers goes along the availability of fast algorithms to compute them. For continuous density fields, we determine the scale-dependence of Betti numbers by invoking the cosmologically familiar filtration of sublevel or superlevel sets defined by density thresholds. For the discrete galaxy distribution, however, the analysis is based on the alpha shapes of the particles. These simplicial complexes constitute an ordered sequence of nested subsets of the Delaunay tessellation, a filtration defined by the scale parameter, α. As they are homotopy equivalent to the sublevel sets of the distance field, they are an excellent tool for assessing the topological structure of a discrete point distribution. In order to develop an intuitive understanding for the behavior of Betti numbers as a function of α, and their relation to the morphological patterns in the Cosmic Web, we first study them within the context of simple heuristic Voronoi clustering models. These can be tuned to consist of specific morphological elements of the Cosmic Web, i.e. clusters, filaments, or sheets. To elucidate the relative prominence of the various Betti numbers in different stages of morphological evolution, we introduce the concept of alpha tracks. Subsequently, we address the topology of structures emerging in the standard LCDM scenario and in cosmological scenarios with alternative dark energy content. The evolution of the Betti numbers is shown to reflect the hierarchical evolution of the Cosmic Web. We also demonstrate that the scale-dependence of the Betti numbers yields a promising measure of cosmological parameters, with a potential to help in determining the nature of dark energy and to probe primordial non-Gaussianities. We also discuss the expected Betti numbers as a function of the density threshold for superlevel sets of a Gaussian random field. Finally, we introduce the concept of persistent homology. It measures scale levels of the mass distribution and allows us to separate small from large scale features. Within the context of the hierarchical cosmic structure formation, persistence provides a natural formalism for a multiscale topology study of the Cosmic Web.","lang":"eng"}],"day":"09","publist_id":"3295","publication":"Transactions on Computational Science XIV","oa":1,"citation":{"short":"R. Van De Weygaert, G. Vegter, H. Edelsbrunner, B. Jones, P. Pranav, C. Park, W. Hellwing, B. Eldering, N. Kruithof, P. Bos, J. Hidding, J. Feldbrugge, E. Ten Have, M. Van Engelen, M. Caroli, M. Teillaud, in:, M. Gavrilova, K. Tan, M. Mostafavi (Eds.), Transactions on Computational Science XIV, Springer, 2011, pp. 60–101.","chicago":"Van De Weygaert, Rien, Gert Vegter, Herbert Edelsbrunner, Bernard Jones, Pratyush Pranav, Changbom Park, Wojciech Hellwing, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” In <i>Transactions on Computational Science XIV</i>, edited by Marina Gavrilova, Kenneth Tan, and Mir Mostafavi, 6970:60–101. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25249-5_3\">https://doi.org/10.1007/978-3-642-25249-5_3</a>.","ista":"Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.","mla":"Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” <i>Transactions on Computational Science XIV</i>, edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi:<a href=\"https://doi.org/10.1007/978-3-642-25249-5_3\">10.1007/978-3-642-25249-5_3</a>.","ieee":"R. Van De Weygaert <i>et al.</i>, “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in <i>Transactions on Computational Science XIV</i>, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.","ama":"Van De Weygaert R, Vegter G, Edelsbrunner H, et al. Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Gavrilova M, Tan K, Mostafavi M, eds. <i>Transactions on Computational Science XIV</i>. Vol 6970. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer; 2011:60-101. doi:<a href=\"https://doi.org/10.1007/978-3-642-25249-5_3\">10.1007/978-3-642-25249-5_3</a>","apa":"Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C., … Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, &#38; M. Mostafavi (Eds.), <i>Transactions on Computational Science XIV</i> (Vol. 6970, pp. 60–101). Springer. <a href=\"https://doi.org/10.1007/978-3-642-25249-5_3\">https://doi.org/10.1007/978-3-642-25249-5_3</a>"},"author":[{"full_name":"Van De Weygaert, Rien","last_name":"Van De Weygaert","first_name":"Rien"},{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"last_name":"Jones","first_name":"Bernard","full_name":"Jones, Bernard"},{"full_name":"Pranav, Pratyush","first_name":"Pratyush","last_name":"Pranav"},{"last_name":"Park","first_name":"Changbom","full_name":"Park, Changbom"},{"last_name":"Hellwing","first_name":"Wojciech","full_name":"Hellwing, Wojciech"},{"full_name":"Eldering, Bob","last_name":"Eldering","first_name":"Bob"},{"last_name":"Kruithof","first_name":"Nico","full_name":"Kruithof, Nico"},{"full_name":"Bos, Patrick","last_name":"Bos","first_name":"Patrick"},{"full_name":"Hidding, Johan","first_name":"Johan","last_name":"Hidding"},{"full_name":"Feldbrugge, Job","first_name":"Job","last_name":"Feldbrugge"},{"first_name":"Eline","last_name":"Ten Have","full_name":"Ten Have, Eline"},{"full_name":"Van Engelen, Matti","first_name":"Matti","last_name":"Van Engelen"},{"full_name":"Caroli, Manuel","last_name":"Caroli","first_name":"Manuel"},{"full_name":"Teillaud, Monique","first_name":"Monique","last_name":"Teillaud"}],"date_updated":"2021-01-12T07:42:44Z","external_id":{"arxiv":["1306.3640"]},"title":"Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web"},{"year":"2011","scopus_import":"1","_id":"3336","date_created":"2018-12-11T12:02:45Z","acknowledgement":"The first author is supported by the Austrian Science Fund (FWF) grant No. P20134-N13. The authors would like to thank Sebastian Nowozin for helpful discussions.","page":"2089 - 2096","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2011-06-20","location":"Colorado Springs, CO, United States","end_date":"2011-06-25"},"oa_version":"None","article_processing_charge":"No","quality_controlled":"1","abstract":[{"text":"We introduce TopoCut: a new way to integrate knowledge about topological properties (TPs) into random field image segmentation model. Instead of including TPs as additional constraints during minimization of the energy function, we devise an efficient algorithm for modifying the unary potentials such that the resulting segmentation is guaranteed with the desired properties. Our method is more flexible in the sense that it handles more topology constraints than previous methods, which were only able to enforce pairwise or global connectivity. In particular, our method is very fast, making it for the first time possible to enforce global topological properties in practical image segmentation tasks.","lang":"eng"}],"publisher":"IEEE","department":[{"_id":"HeEd"},{"_id":"ChLa"}],"related_material":{"record":[{"id":"5386","status":"public","relation":"earlier_version"}]},"publication_status":"published","month":"07","publication":"CVPR: Computer Vision and Pattern Recognition","publication_identifier":{"eisbn":["978-1-4577-0395-9"],"isbn":["978-1-4577-0394-2"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"22","publist_id":"3294","date_updated":"2023-02-23T12:23:56Z","type":"conference","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chao"},{"last_name":"Freedman","first_name":"Daniel","full_name":"Freedman, Daniel"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert"}],"citation":{"chicago":"Chen, Chao, Daniel Freedman, and Christoph Lampert. “Enforcing Topological Constraints in Random Field Image Segmentation.” In <i>CVPR: Computer Vision and Pattern Recognition</i>, 2089–96. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995503\">https://doi.org/10.1109/CVPR.2011.5995503</a>.","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.","mla":"Chen, Chao, et al. “Enforcing Topological Constraints in Random Field Image Segmentation.” <i>CVPR: Computer Vision and Pattern Recognition</i>, IEEE, 2011, pp. 2089–96, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995503\">10.1109/CVPR.2011.5995503</a>.","ama":"Chen C, Freedman D, Lampert C. Enforcing topological constraints in random field image segmentation. In: <i>CVPR: Computer Vision and Pattern Recognition</i>. IEEE; 2011:2089-2096. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995503\">10.1109/CVPR.2011.5995503</a>","ieee":"C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in <i>CVPR: Computer Vision and Pattern Recognition</i>, Colorado Springs, CO, United States, 2011, pp. 2089–2096.","apa":"Chen, C., Freedman, D., &#38; Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. In <i>CVPR: Computer Vision and Pattern Recognition</i> (pp. 2089–2096). Colorado Springs, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995503\">https://doi.org/10.1109/CVPR.2011.5995503</a>","short":"C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–2096."},"language":[{"iso":"eng"}],"status":"public","title":"Enforcing topological constraints in random field image segmentation","doi":"10.1109/CVPR.2011.5995503","date_published":"2011-07-22T00:00:00Z"},{"status":"public","title":"Learning anticipation policies for robot table tennis","language":[{"iso":"eng"}],"date_published":"2011-01-01T00:00:00Z","doi":"10.1109/IROS.2011.6094892","date_updated":"2021-01-12T07:42:45Z","type":"conference","author":[{"first_name":"Zhikun","last_name":"Wang","full_name":"Wang, Zhikun"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"full_name":"Mülling, Katharina","last_name":"Mülling","first_name":"Katharina"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Peters, Jan","first_name":"Jan","last_name":"Peters"}],"citation":{"short":"Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, J. Peters, in:, IEEE, 2011, pp. 332–337.","ieee":"Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, and J. Peters, “Learning anticipation policies for robot table tennis,” presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA, 2011, pp. 332–337.","apa":"Wang, Z., Lampert, C., Mülling, K., Schölkopf, B., &#38; Peters, J. (2011). Learning anticipation policies for robot table tennis (pp. 332–337). Presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA: IEEE. <a href=\"https://doi.org/10.1109/IROS.2011.6094892\">https://doi.org/10.1109/IROS.2011.6094892</a>","ama":"Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. Learning anticipation policies for robot table tennis. In: IEEE; 2011:332-337. doi:<a href=\"https://doi.org/10.1109/IROS.2011.6094892\">10.1109/IROS.2011.6094892</a>","mla":"Wang, Zhikun, et al. <i>Learning Anticipation Policies for Robot Table Tennis</i>. IEEE, 2011, pp. 332–37, doi:<a href=\"https://doi.org/10.1109/IROS.2011.6094892\">10.1109/IROS.2011.6094892</a>.","ista":"Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. 2011. Learning anticipation policies for robot table tennis. IROS: RSJ International Conference on Intelligent Robots and Systems, 332–337.","chicago":"Wang, Zhikun, Christoph Lampert, Katharina Mülling, Bernhard Schölkopf, and Jan Peters. “Learning Anticipation Policies for Robot Table Tennis,” 332–37. IEEE, 2011. <a href=\"https://doi.org/10.1109/IROS.2011.6094892\">https://doi.org/10.1109/IROS.2011.6094892</a>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3293","day":"01","abstract":[{"lang":"eng","text":"Playing table tennis is a difficult task for robots, especially due to their limitations of acceleration. A key bottleneck is the amount of time needed to reach the desired hitting position and velocity of the racket for returning the incoming ball. Here, it often does not suffice to simply extrapolate the ball's trajectory after the opponent returns it but more information is needed. Humans are able to predict the ball's trajectory based on the opponent's moves and, thus, have a considerable advantage. Hence, we propose to incorporate an anticipation system into robot table tennis players, which enables the robot to react earlier while the opponent is performing the striking movement. Based on visual observation of the opponent's racket movement, the robot can predict the aim of the opponent and adjust its movement generation accordingly. The policies for deciding how and when to react are obtained by reinforcement learning. We conduct experiments with an existing robot player to show that the learned reaction policy can significantly improve the performance of the overall system."}],"month":"01","publisher":"IEEE","publication_status":"published","department":[{"_id":"ChLa"}],"oa_version":"None","quality_controlled":"1","page":"332 - 337","conference":{"name":"IROS: RSJ International Conference on Intelligent Robots and Systems","location":"San Francisco, USA","start_date":"2011-09-25","end_date":"2011-09-30"},"_id":"3337","year":"2011","scopus_import":1,"date_created":"2018-12-11T12:02:45Z"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2146"}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"status":"public","id":"5380","relation":"earlier_version"}]},"publisher":"ArXiv","month":"07","abstract":[{"text":"We consider 2-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves inde- pendently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respec- tively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite- precision; and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as power- ful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms, that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.","lang":"eng"}],"date_created":"2018-12-11T12:02:45Z","year":"2011","_id":"3338","arxiv":1,"page":"1 - 51","date_published":"2011-07-11T00:00:00Z","language":[{"iso":"eng"}],"title":"Bounded rationality in concurrent parity games","external_id":{"arxiv":["1107.2146"]},"status":"public","day":"11","publist_id":"3287","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","oa":1,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}],"citation":{"chicago":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” <i>ArXiv</i>. ArXiv, 2011.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .","mla":"Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” <i>ArXiv</i>, ArXiv, 2011, pp. 1–51.","ieee":"K. Chatterjee, “Bounded rationality in concurrent parity games,” <i>arXiv</i>. ArXiv, pp. 1–51, 2011.","ama":"Chatterjee K. Bounded rationality in concurrent parity games. <i>arXiv</i>. 2011:1-51.","apa":"Chatterjee, K. (2011). Bounded rationality in concurrent parity games. <i>arXiv</i>. ArXiv.","short":"K. Chatterjee, ArXiv (2011) 1–51."},"date_updated":"2023-02-23T12:23:40Z","type":"preprint"},{"date_created":"2018-12-11T12:02:46Z","year":"2011","_id":"3339","arxiv":1,"page":"17","main_file_link":[{"url":"http://arxiv.org/abs/1107.2132","open_access":"1"}],"oa_version":"Preprint","publisher":"ArXiv","publication_status":"published","department":[{"_id":"KrCh"}],"month":"07","abstract":[{"lang":"eng","text":"Turn-based stochastic games and its important subclass Markov decision processes (MDPs) provide models for systems with both probabilistic and nondeterministic behaviors. We consider turn-based stochastic games with two classical quantitative objectives: discounted-sum and long-run average objectives. The game models and the quantitative objectives are widely used in probabilistic verification, planning, optimal inventory control, network protocol and performance analysis. Games and MDPs that model realistic systems often have very large state spaces, and probabilistic abstraction techniques are necessary to handle the state-space explosion. The commonly used full-abstraction techniques do not yield space-savings for systems that have many states with similar value, but does not necessarily have similar transition structure. A semi-abstraction technique, namely Magnifying-lens abstractions (MLA), that clusters states based on value only, disregarding differences in their transition relation was proposed for qualitative objectives (reachability and safety objectives). In this paper we extend the MLA technique to solve stochastic games with discounted-sum and long-run average objectives. We present the MLA technique based abstraction-refinement algorithm for stochastic games and MDPs with discounted-sum objectives. For long-run average objectives, our solution works for all MDPs and a sub-class of stochastic games where every state has the same value. "}],"day":"11","publist_id":"3286","publication":"arXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"preprint","date_updated":"2021-01-12T07:42:46Z","citation":{"short":"K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).","mla":"Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” <i>ArXiv</i>, ArXiv, 2011.","ieee":"K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” <i>arXiv</i>. ArXiv, 2011.","apa":"Chatterjee, K., De Alfaro, L., &#38; Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. <i>arXiv</i>. ArXiv.","ama":"Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. <i>arXiv</i>. 2011.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” <i>ArXiv</i>. ArXiv, 2011.","ista":"Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, ."},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Pritam","first_name":"Roy","full_name":"Pritam, Roy"}],"date_published":"2011-07-11T00:00:00Z","language":[{"iso":"eng"}],"status":"public","external_id":{"arxiv":["1107.2132"]},"title":"Magnifying lens abstraction for stochastic games with discounted and long-run average objectives"},{"language":[{"iso":"eng"}],"status":"public","doi":"10.1007/978-3-642-22110-1_21","date_published":"2011-08-11T00:00:00Z","intvolume":"      6806","alternative_title":["LNCS"],"volume":6806,"type":"conference","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","department":[{"_id":"KrCh"}],"publisher":"Springer","editor":[{"last_name":"Gopalakrishnan","first_name":"Ganesh","full_name":"Gopalakrishnan, Ganesh"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"month":"08","main_file_link":[{"url":"http://arxiv.org/abs/1104.3348","open_access":"1"}],"page":"260 - 276","conference":{"end_date":"2011-07-20","start_date":"2011-07-14","location":"Snowbird, USA","name":"CAV: Computer Aided Verification"},"arxiv":1,"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"title":"Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives","external_id":{"arxiv":["1104.3348"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"last_name":"Joglekar","first_name":"Manas","full_name":"Joglekar, Manas"},{"first_name":"Shah","last_name":"Nisarg","full_name":"Nisarg, Shah"}],"date_updated":"2023-02-23T11:00:13Z","citation":{"short":"K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.","ama":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>","ieee":"K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.","apa":"Chatterjee, K., Henzinger, M. H., Joglekar, M., &#38; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>","mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>.","ista":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>."},"oa":1,"day":"11","publist_id":"3282","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with ω-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for Büchi objectives (a special case of parity objectives). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives; our algorithm takes O(nm)  symbolic steps as compared to the previous known algorithm that takes O(n 2) symbolic steps, where n is the number of states and m is the number of edges of the MDP. In practice MDPs often have constant out-degree, and then our symbolic algorithm takes O(nn)  symbolic steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second, we present a new algorithm, namely win-lose algorithm, with the following two properties: (a) the algorithm iteratively computes subsets of the almost-sure winning set and its complement, as compared to all previous algorithms that discover the almost-sure winning set upon termination; and (b) requires O(nK)  symbolic steps, where K is the maximal number of edges of strongly connected components (scc’s) of the MDP. The win-lose algorithm requires symbolic computation of scc’s. Third, we improve the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and our new algorithm improves the constants associated with the linear number of steps. In the worst case the previous known algorithm takes 5·n symbolic steps, whereas our new algorithm takes 4 ·n symbolic steps."}],"related_material":{"record":[{"id":"2831","status":"public","relation":"later_version"}]},"publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","quality_controlled":"1","year":"2011","_id":"3342","date_created":"2018-12-11T12:02:47Z"},{"date_created":"2018-12-11T12:02:47Z","_id":"3343","year":"2011","scopus_import":"1","conference":{"start_date":"2011-01-23","name":"SODA: Symposium on Discrete Algorithms","location":"San Francisco, SA, United States","end_date":"2011-01-25"},"page":"1318 - 1336","main_file_link":[{"url":"https://eprints.cs.univie.ac.at/21/","open_access":"1"}],"quality_controlled":"1","article_processing_charge":"No","oa_version":"Submitted Version","month":"01","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"SIAM","abstract":[{"text":"We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity objectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m · √m) bound for m &gt; n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity objectives with d priorities, improving the previous O(m · √m · d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m · log d) time for parity ob jectives.","lang":"eng"}],"publist_id":"3278","day":"01","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"date_updated":"2023-02-14T10:36:10Z","type":"conference","citation":{"mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. <i>Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification</i>. SIAM, 2011, pp. 1318–36, doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>.","ama":"Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>","ieee":"K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>.","ista":"Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.","short":"K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336."},"date_published":"2011-01-01T00:00:00Z","doi":"10.1137/1.9781611973082.101","status":"public","title":"Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification","language":[{"iso":"eng"}]},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"15","publist_id":"3277","volume":6945,"citation":{"ista":"Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.","chicago":"Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>.","apa":"Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno &#38; I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>","ieee":"K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.","ama":"Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>","mla":"Chatterjee, Krishnendu. <i>Graph Games with Reachability Objectives</i>. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>.","short":"K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1."},"date_updated":"2021-01-12T07:42:48Z","type":"conference","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"alternative_title":["LNCS"],"intvolume":"      6945","language":[{"iso":"eng"}],"status":"public","title":"Graph games with reachability objectives","doi":"10.1007/978-3-642-24288-5_1","date_published":"2011-10-15T00:00:00Z","year":"2011","_id":"3344","date_created":"2018-12-11T12:02:47Z","page":"1 - 1","conference":{"start_date":"2011-09-28","location":"Genoa, Italy","name":"RP: Reachability Problems","end_date":"2011-09-30"},"oa_version":"None","quality_controlled":"1","abstract":[{"text":"Games played on graphs provide the mathematical framework to analyze several important problems in computer science as well as mathematics, such as the synthesis problem of Church, model checking of open reactive systems and many others. On the basis of mode of interaction of the players these games can be classified as follows: (a) turn-based (players make moves in turns); and (b) concurrent (players make moves simultaneously). On the basis of the information available to the players these games can be classified as follows: (a) perfect-information (players have perfect view of the game); and (b) partial-information (players have partial view of the game). In this talk we will consider all these classes of games with reachability objectives, where the goal of one player is to reach a set of target vertices of the graph, and the goal of the opponent player is to prevent the player from reaching the target. We will survey the results for various classes of games, and the results range from linear time decision algorithms to EXPTIME-complete problems to undecidable problems.","lang":"eng"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"month":"10","editor":[{"full_name":"Delzanno, Giorgo","last_name":"Delzanno","first_name":"Giorgo"},{"first_name":"Igor","last_name":"Potapov","full_name":"Potapov, Igor"}]},{"year":"2011","_id":"3345","date_created":"2018-12-11T12:02:48Z","abstract":[{"lang":"eng","text":"We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode ω-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition re- quires that the resource level never drops below 0, and the mean-payoff condi- tion requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound."}],"related_material":{"record":[{"status":"public","id":"5387","relation":"earlier_version"}]},"publication_status":"published","oa_version":"Preprint","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. Vol. 6907, Springer, 2011, pp. 206–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.","ama":"Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>.","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218."},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"date_updated":"2023-02-23T12:23:59Z","oa":1,"day":"28","publist_id":"3276","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Energy and mean-payoff parity Markov Decision Processes","external_id":{"arxiv":["1104.2909"]},"page":"206 - 218","conference":{"end_date":"2011-08-26","start_date":"2011-08-22","name":"MFCS: Mathematical Foundations of Computer Science","location":"Warsaw, Poland"},"arxiv":1,"scopus_import":1,"publisher":"Springer","department":[{"_id":"KrCh"}],"month":"09","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2909"}],"volume":6907,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","doi":"10.1007/978-3-642-22993-0_21","date_published":"2011-09-28T00:00:00Z","alternative_title":["LNCS"],"intvolume":"      6907"},{"ec_funded":1,"date_created":"2018-12-11T12:02:48Z","_id":"3346","scopus_import":1,"year":"2011","conference":{"end_date":"2011-06-24","start_date":"2011-06-21","name":"LICS: Logic in Computer Science","location":"Toronto, Canada"},"main_file_link":[{"url":"http://arxiv.org/abs/1104.3489","open_access":"1"}],"quality_controlled":"1","oa_version":"Submitted Version","month":"06","publisher":"IEEE","publication_status":"published","department":[{"_id":"KrCh"}],"abstract":[{"text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k reward functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the single-objective case, both randomization and memory are necessary for strategies, and that finite-memory randomized strategies are sufficient. Under the satisfaction objective, in contrast to the single-objective case, infinite memory is necessary for strategies, and that randomized memoryless strategies are sufficient for epsilon-approximation, for all epsilon&gt;;0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon, and exponential in the number of reward functions, for all epsilon&gt;;0. Our results also reveal flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, correct the flaws and obtain improved results.","lang":"eng"}],"publist_id":"3275","day":"21","oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"last_name":"Brožek","first_name":"Václav","full_name":"Brožek, Václav"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"}],"citation":{"ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>.","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>","mla":"Brázdil, Tomáš, et al. <i>Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes</i>. 5970225, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011."},"date_updated":"2021-01-12T07:42:49Z","type":"conference","article_number":"5970225","date_published":"2011-06-21T00:00:00Z","doi":"10.1109/LICS.2011.10","status":"public","title":"Two views on multiple mean payoff objectives in Markov Decision Processes","language":[{"iso":"eng"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"doi":"10.1007/978-3-642-21254-3_16","date_published":"2011-06-16T00:00:00Z","language":[{"iso":"eng"}],"status":"public","intvolume":"      6638","alternative_title":["LNCS"],"type":"conference","volume":6638,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"publisher":"Springer","month":"06","main_file_link":[{"url":"http://arxiv.org/abs/1101.1727","open_access":"1"}],"arxiv":1,"page":"216 - 226","conference":{"end_date":"2011-05-31","location":"Tarragona, Spain","start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications"},"scopus_import":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"external_id":{"arxiv":["1101.1727"]},"title":"Finitary languages","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Nathanaël","last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0"}],"date_updated":"2021-01-12T07:42:50Z","citation":{"mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Finitary Languages</i>. Vol. 6638, Springer, 2011, pp. 216–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>.","ama":"Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>","apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>","ieee":"K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>.","ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.","short":"K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226."},"day":"16","publist_id":"3274","oa":1,"publication_status":"published","abstract":[{"text":"The class of omega-regular languages provides a robust specification language in verification. Every omega-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens &quot;eventually&quot;. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness. It requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider automata with finitary acceptance conditions defined by finitary Buchi, parity and Streett languages. We study languages expressible by such automata: we give their topological complexity and present a regular-expression characterization. We compare the expressive power of finitary automata and give optimal algorithms for classical decisions questions. We show that the finitary languages are Sigma 2-complete; we present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; we show that the languages defined by finitary parity automata exactly characterize the star-free fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete and universality as well as language inclusion are PSPACE-complete for finitary parity and Streett automata.","lang":"eng"}],"quality_controlled":"1","oa_version":"Preprint","date_created":"2018-12-11T12:02:48Z","year":"2011","_id":"3347"},{"abstract":[{"lang":"eng","text":"We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two-player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a linear (in the number of clocks) number of memory bits. Precisely, we show that for safety objectives, a memory of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential bound. We also settle the open question of whether winning region controller strategies require memory for safety objectives by showing with an example the necessity of memory for region strategies to win for safety objectives."}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer","month":"01","oa_version":"Submitted Version","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1101.5842","open_access":"1"}],"page":"221 - 230","conference":{"end_date":"2011-04-14","location":"Chicago, USA","start_date":"2011-04-12","name":"HSCC: Hybrid Systems - Computation and Control"},"year":"2011","scopus_import":1,"_id":"3348","date_created":"2018-12-11T12:02:49Z","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"title":"Synthesis of memory efficient real time controllers for safety objectives","status":"public","doi":"10.1145/1967701.1967734","date_published":"2011-01-31T00:00:00Z","date_updated":"2021-01-12T07:42:50Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"type":"conference","citation":{"short":"K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>.","ista":"Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. <i>Synthesis of Memory Efficient Real Time Controllers for Safety Objectives</i>. Springer, 2011, pp. 221–30, doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>.","apa":"Chatterjee, K., &#38; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>","ama":"Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>","ieee":"K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"31","publist_id":"3273"},{"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3272","day":"04","volume":54,"type":"conference","citation":{"short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>A Reduction from Parity Games to Simple Stochastic Games</i>. Vol. 54, EPTCS, 2011, pp. 74–86, doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>.","ieee":"K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>","ama":"Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>.","ista":"Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86."},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"date_updated":"2021-01-12T07:42:51Z","alternative_title":["EPTCS"],"intvolume":"        54","title":"A reduction from parity games to simple stochastic games","status":"public","language":[{"iso":"eng"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"date_published":"2011-06-04T00:00:00Z","doi":"10.4204/EPTCS.54.6","_id":"3349","year":"2011","scopus_import":1,"date_created":"2018-12-11T12:02:49Z","page":"74 - 86","conference":{"start_date":"2011-06-15","name":"GandALF: Games, Automata, Logic, and Formal Verification","location":"Minori, Italy","end_date":"2011-06-17"},"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1106.1232"}],"abstract":[{"lang":"eng","text":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena."}],"month":"06","publisher":"EPTCS","publication_status":"published","department":[{"_id":"KrCh"}]},{"intvolume":"      6919","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Minimum attention controller synthesis for omega regular objectives","status":"public","doi":"10.1007/978-3-642-24310-3_11","date_published":"2011-01-01T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","publist_id":"3271","volume":6919,"type":"conference","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"date_updated":"2021-01-12T07:42:51Z","citation":{"short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","apa":"Chatterjee, K., &#38; Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg &#38; S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>","ieee":"K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.","ama":"Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Minimum Attention Controller Synthesis for Omega Regular Objectives</i>. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>.","ista":"Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>."},"oa_version":"None","quality_controlled":"1","abstract":[{"lang":"eng","text":"A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata."}],"publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","month":"01","editor":[{"first_name":"Uli","last_name":"Fahrenberg","full_name":"Fahrenberg, Uli"},{"full_name":"Tripakis, Stavros","last_name":"Tripakis","first_name":"Stavros"}],"year":"2011","scopus_import":1,"_id":"3350","date_created":"2018-12-11T12:02:49Z","conference":{"start_date":"2011-09-21","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Aalborg, Denmark","end_date":"2011-09-23"},"page":"145 - 159"}]