[{"status":"public","type":"conference","conference":{"start_date":"2011-06-13","location":"Paris, France","end_date":"2011-06-15","name":"SCG: Symposium on Computational Geometry"},"_id":"3329","title":"Deconstructing approximate offsets","department":[{"_id":"HeEd"}],"author":[{"last_name":"Berberich","full_name":"Berberich, Eric","first_name":"Eric"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael"},{"first_name":"Roza","full_name":"Pogalnikova, Roza","last_name":"Pogalnikova"}],"publist_id":"3306","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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 Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.","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.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. ACM; 2011:187-196. doi:10.1145/1998196.1998225","apa":"Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225","mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225."},"date_updated":"2023-02-23T11:12:57Z","month":"06","scopus_import":1,"quality_controlled":"1","publisher":"ACM","main_file_link":[{"url":"http://arxiv.org/abs/1109.2158","open_access":"1"}],"oa":1,"oa_version":"Preprint","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"}],"date_published":"2011-06-13T00:00:00Z","doi":"10.1145/1998196.1998225","related_material":{"record":[{"status":"public","id":"3115","relation":"later_version"}]},"date_created":"2018-12-11T12:02:42Z","page":"187 - 196","day":"13","publication":"Proceedings of the twenty-seventh annual symposium on Computational geometry","language":[{"iso":"eng"}],"year":"2011","publication_status":"published"},{"article_type":"original","type":"journal_article","status":"public","_id":"3332","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:08Z","date_updated":"2021-01-12T07:42:43Z","ddc":["500"],"scopus_import":1,"intvolume":" 27","month":"03","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"}],"oa_version":"Submitted Version","volume":27,"issue":"3","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"7869","checksum":"a63a1e3e885dcc68f1e3dea68dfbe213","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-05-19T16:11:36Z","file_name":"2011_GraphsCombi_Kerber.pdf","creator":"dernst","date_updated":"2020-07-14T12:46:08Z","file_size":143976}],"article_processing_charge":"No","publist_id":"3301","author":[{"last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","full_name":"Sagraloff, Michael","last_name":"Sagraloff"}],"title":"A note on the complexity of real algebraic hypersurfaces","citation":{"apa":"Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7","ama":"Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 2011;27(3):419-430. doi:10.1007/s00373-011-1020-7","short":"M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.","ieee":"M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.","mla":"Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7.","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.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Springer","page":"419 - 430","date_created":"2018-12-11T12:02:43Z","date_published":"2011-03-17T00:00:00Z","doi":"10.1007/s00373-011-1020-7","year":"2011","has_accepted_license":"1","publication":"Graphs and Combinatorics","day":"17"},{"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."}],"oa_version":"Preprint","publisher":"Springer","scopus_import":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1362"}],"month":"06","publication_status":"published","year":"2011","day":"08","language":[{"iso":"eng"}],"page":"209 - 216","date_published":"2011-06-08T00:00:00Z","doi":"10.1145/1993886.1993920","date_created":"2018-12-11T12:02:43Z","_id":"3330","type":"conference","conference":{"end_date":"2011-06-11","location":"California, USA","start_date":"2011-06-08","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation"},"status":"public","date_updated":"2021-01-12T07:42:42Z","citation":{"chicago":"Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920.","ista":"Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.","mla":"Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials. Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920.","short":"M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.","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:10.1145/1993886.1993920","apa":"Kerber, M., & 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. https://doi.org/10.1145/1993886.1993920"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"last_name":"Sagraloff","full_name":"Sagraloff, Michael","first_name":"Michael"}],"publist_id":"3304","article_processing_charge":"No","external_id":{"arxiv":["1104.1362"]},"title":"Root refinement for real polynomials","department":[{"_id":"HeEd"}]},{"abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","quality_controlled":"1","scopus_import":1,"publisher":"ACM","oa":1,"main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/inria-00480031/file/RR-7274.pdf"}],"month":"06","publication_status":"published","year":"2011","day":"13","language":[{"iso":"eng"}],"page":"179 - 186","date_published":"2011-06-13T00:00:00Z","doi":"10.1145/1998196.1998224","date_created":"2018-12-11T12:02:42Z","_id":"3328","type":"conference","conference":{"name":"SCG: Symposium on Computational Geometry","start_date":"2011-06-13","end_date":"2011-06-15","location":"Paris, France"},"status":"public","citation":{"chicago":"Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. https://doi.org/10.1145/1998196.1998224.","ista":"Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.","mla":"Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224.","ama":"Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear geometric applications. In: ACM; 2011:179-186. doi:10.1145/1998196.1998224","apa":"Berberich, E., Hemmer, M., & 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. https://doi.org/10.1145/1998196.1998224","short":"E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.","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."},"date_updated":"2021-01-12T07:42:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Eric","full_name":"Berberich, Eric","last_name":"Berberich"},{"full_name":"Hemmer, Michael","last_name":"Hemmer","first_name":"Michael"},{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3307","article_processing_charge":"No","department":[{"_id":"HeEd"}],"title":"A generic algebraic kernel for non linear geometric applications"},{"year":"2011","publication_status":"published","day":"01","language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","page":"1 - 2","volume":45,"issue":"1","date_published":"2011-01-01T00:00:00Z","doi":"10.1007/s00454-010-9313-9","date_created":"2018-12-11T12:02:44Z","oa_version":"None","scopus_import":1,"quality_controlled":"1","publisher":"Springer","month":"01","intvolume":" 45","date_updated":"2021-01-12T07:42:44Z","citation":{"ista":"Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete & Computational Geometry. 45(1), 1–2.","chicago":"Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry. Springer, 2011. https://doi.org/10.1007/s00454-010-9313-9.","short":"H. Edelsbrunner, J. Pach, G. Ziegler, Discrete & Computational Geometry 45 (2011) 1–2.","ieee":"H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete & Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2, 2011.","apa":"Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9","ama":"Edelsbrunner H, Pach J, Ziegler G. Letter from the new editors-in-chief. Discrete & Computational Geometry. 2011;45(1):1-2. doi:10.1007/s00454-010-9313-9","mla":"Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pach","full_name":"Pach, János","first_name":"János"},{"first_name":"Günter","last_name":"Ziegler","full_name":"Ziegler, Günter"}],"publist_id":"3297","department":[{"_id":"HeEd"}],"title":"Letter from the new editors-in-chief","_id":"3334","article_type":"letter_note","type":"journal_article","status":"public"},{"oa_version":"Submitted Version","abstract":[{"text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces.","lang":"eng"}],"month":"07","intvolume":" 33","scopus_import":1,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5235","checksum":"5d44a8aa81e33210649beae507602138","creator":"system","file_size":775662,"date_updated":"2020-07-14T12:46:09Z","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","date_created":"2018-12-12T10:16:45Z"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"4","volume":33,"ec_funded":1,"_id":"3353","status":"public","pubrep_id":"85","type":"journal_article","ddc":["000","005"],"date_updated":"2021-01-12T07:42:52Z","file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"quality_controlled":"1","publisher":"ACM","oa":1,"day":"01","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","has_accepted_license":"1","year":"2011","date_published":"2011-07-01T00:00:00Z","doi":"10.1145/1985342.1985345","date_created":"2018-12-11T12:02:51Z","article_number":"14","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 2011;33(4). doi:10.1145/1985342.1985345","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011."},"title":"A theory of synchronous relational interfaces","publist_id":"3263","author":[{"first_name":"Stavros","full_name":"Tripakis, Stavros","last_name":"Tripakis"},{"last_name":"Lickly","full_name":"Lickly, Ben","first_name":"Ben"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Edward","full_name":"Lee, Edward","last_name":"Lee"}]},{"file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:53Z","ddc":["000","004"],"type":"conference","conference":{"name":"QEST: Quantitative Evaluation of Systems","start_date":"2011-09-05","location":"Aachen, Germany","end_date":"2011-09-08"},"status":"public","pubrep_id":"84","_id":"3355","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4648","checksum":"4dc8750ab7921f51de992000b13d1b01","creator":"system","date_updated":"2020-07-14T12:46:09Z","file_size":272017,"date_created":"2018-12-12T10:07:49Z","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"10","abstract":[{"text":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems.","lang":"eng"}],"oa_version":"Submitted Version","publist_id":"3260","author":[{"last_name":"Halalai","full_name":"Halalai, Raluca","id":"584C6850-E996-11E9-805B-F01764644770","first_name":"Raluca"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu"}],"title":"Quantitative evaluation of BFT protocols","citation":{"mla":"Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40.","ieee":"R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","apa":"Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.","ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"255 - 264","doi":"10.1109/QEST.2011.40","date_published":"2011-10-13T00:00:00Z","date_created":"2018-12-11T12:02:51Z","has_accepted_license":"1","year":"2011","day":"13","quality_controlled":"1","publisher":"IEEE","oa":1},{"date_updated":"2021-01-12T07:42:51Z","citation":{"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. https://doi.org/10.1007/978-3-642-24310-3_11.","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:10.1007/978-3-642-24310-3_11","apa":"Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11","short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","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.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3271","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"department":[{"_id":"KrCh"}],"editor":[{"first_name":"Uli","full_name":"Fahrenberg, Uli","last_name":"Fahrenberg"},{"full_name":"Tripakis, Stavros","last_name":"Tripakis","first_name":"Stavros"}],"title":"Minimum attention controller synthesis for omega regular objectives","_id":"3350","type":"conference","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Aalborg, Denmark","end_date":"2011-09-23","start_date":"2011-09-21"},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","year":"2011","day":"01","language":[{"iso":"eng"}],"page":"145 - 159","date_published":"2011-01-01T00:00:00Z","doi":"10.1007/978-3-642-24310-3_11","volume":6919,"date_created":"2018-12-11T12:02:49Z","abstract":[{"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.","lang":"eng"}],"oa_version":"None","alternative_title":["LNCS"],"quality_controlled":"1","publisher":"Springer","scopus_import":1,"month":"01","intvolume":" 6919"},{"publisher":"Springer","quality_controlled":"1","oa":1,"date_published":"2011-04-16T00:00:00Z","doi":"10.1007/978-3-642-22953-4_13","date_created":"2018-12-11T12:02:50Z","page":"148 - 159","day":"16","year":"2011","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"On memoryless quantitative objectives","editor":[{"first_name":"Olaf","last_name":"Owe","full_name":"Owe, Olaf"},{"last_name":"Steffen","full_name":"Steffen, Martin","first_name":"Martin"},{"first_name":"Jan Arne","full_name":"Telle, Jan Arne","last_name":"Telle"}],"publist_id":"3270","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.","mla":"Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.","apa":"Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/10.1007/978-3-642-22953-4_13","ama":"Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","ieee":"K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159."},"month":"04","intvolume":" 6914","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3211"}],"oa_version":"Submitted Version","abstract":[{"text":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions.","lang":"eng"}],"volume":6914,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","conference":{"start_date":"2011-08-22","location":"Oslo, Norway","end_date":"2011-08-25","name":"FCT: Fundamentals of Computation Theory"},"_id":"3351","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:52Z"},{"publication_status":"published","year":"2011","day":"04","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"doi":"10.1145/1970398.1970404","issue":"4","date_published":"2011-07-04T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"2054","status":"public"}]},"volume":12,"date_created":"2018-12-11T12:02:51Z","abstract":[{"text":"We consider two-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 independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-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 are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory.","lang":"eng"}],"oa_version":"None","scopus_import":1,"publisher":"ACM","quality_controlled":"1","month":"07","intvolume":" 12","citation":{"chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404","apa":"Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011."},"date_updated":"2023-02-23T10:26:18Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3262","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"De Alfaro","full_name":"De Alfaro, Luca","first_name":"Luca"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Qualitative concurrent parity games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3354","article_number":"28","type":"journal_article","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"status":"public"}]