[{"_id":"3327","status":"public","type":"conference","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Saarbrücken, Germany","end_date":"2011-04-03","start_date":"2011-03-26"},"extern":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:41Z","citation":{"mla":"Boker, Udi, and Orna Kupferman. Co-Büching Them All. Edited by Martin Hofmann, vol. 6604, Springer, 2011, pp. 184–98, doi:10.1007/978-3-642-19805-2_13.","ama":"Boker U, Kupferman O. Co-Büching them all. In: Hofmann M, ed. Vol 6604. Springer; 2011:184-198. doi:10.1007/978-3-642-19805-2_13","apa":"Boker, U., & Kupferman, O. (2011). Co-Büching them all. In M. Hofmann (Ed.) (Vol. 6604, pp. 184–198). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany: Springer. https://doi.org/10.1007/978-3-642-19805-2_13","short":"U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198.","ieee":"U. Boker and O. Kupferman, “Co-Büching them all,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany, 2011, vol. 6604, pp. 184–198.","chicago":"Boker, Udi, and Orna Kupferman. “Co-Büching Them All.” edited by Martin Hofmann, 6604:184–98. Springer, 2011. https://doi.org/10.1007/978-3-642-19805-2_13.","ista":"Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198."},"title":"Co-Büching them all","editor":[{"first_name":"Martin","last_name":"Hofmann","full_name":"Hofmann, Martin"}],"author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publist_id":"3308","oa_version":"None","abstract":[{"lang":"eng","text":"We solve the open problems of translating, when possible, all common classes of nondeterministic word automata to deterministic and nondeterministic co-Büchi word automata. The handled classes include Büchi, parity, Rabin, Streett and Muller automata. The translations follow a unified approach and are all asymptotically tight. The problem of translating Büchi automata to equivalent co-Büchi automata was solved in [2], leaving open the problems of translating automata with richer acceptance conditions. For these classes, one cannot easily extend or use the construction in [2]. In particular, going via an intermediate Büchi automaton is not optimal and might involve a blow-up exponentially higher than the known lower bound. Other known translations are also not optimal and involve a doubly exponential blow-up. We describe direct, simple, and asymptotically tight constructions, involving a 2Θ(n) blow-up. The constructions are variants of the subset construction, and allow for symbolic implementations. Beyond the theoretical importance of the results, the new constructions have various applications, among which is an improved algorithm for translating, when possible, LTL formulas to deterministic Büchi word automata."}],"month":"03","intvolume":" 6604","publisher":"Springer","alternative_title":["LNCS"],"quality_controlled":"1","day":"29","language":[{"iso":"eng"}],"year":"2011","publication_status":"published","date_published":"2011-03-29T00:00:00Z","doi":"10.1007/978-3-642-19805-2_13","volume":6604,"date_created":"2018-12-11T12:02:41Z","page":"184 - 198"},{"conference":{"name":"IROS: RSJ International Conference on Intelligent Robots and Systems","start_date":"2011-09-25","location":"San Francisco, USA","end_date":"2011-09-30"},"type":"conference","status":"public","_id":"3337","publist_id":"3293","author":[{"full_name":"Wang, Zhikun","last_name":"Wang","first_name":"Zhikun"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"},{"first_name":"Katharina","last_name":"Mülling","full_name":"Mülling, Katharina"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"first_name":"Jan","last_name":"Peters","full_name":"Peters, Jan"}],"department":[{"_id":"ChLa"}],"title":"Learning anticipation policies for robot table tennis","date_updated":"2021-01-12T07:42:45Z","citation":{"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. https://doi.org/10.1109/IROS.2011.6094892.","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.","mla":"Wang, Zhikun, et al. Learning Anticipation Policies for Robot Table Tennis. IEEE, 2011, pp. 332–37, doi:10.1109/IROS.2011.6094892.","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.","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:10.1109/IROS.2011.6094892","apa":"Wang, Z., Lampert, C., Mülling, K., Schölkopf, B., & 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. https://doi.org/10.1109/IROS.2011.6094892"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"IEEE","scopus_import":1,"month":"01","abstract":[{"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.","lang":"eng"}],"oa_version":"None","page":"332 - 337","date_created":"2018-12-11T12:02:45Z","date_published":"2011-01-01T00:00:00Z","doi":"10.1109/IROS.2011.6094892","year":"2011","publication_status":"published","language":[{"iso":"eng"}],"day":"01"},{"month":"07","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1107.2132","open_access":"1"}],"publisher":"ArXiv","oa_version":"Preprint","abstract":[{"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. ","lang":"eng"}],"date_created":"2018-12-11T12:02:46Z","date_published":"2011-07-11T00:00:00Z","page":"17","publication":"arXiv","language":[{"iso":"eng"}],"day":"11","year":"2011","publication_status":"published","status":"public","type":"preprint","_id":"3339","department":[{"_id":"KrCh"}],"title":"Magnifying lens abstraction for stochastic games with discounted and long-run average objectives","external_id":{"arxiv":["1107.2132"]},"publist_id":"3286","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"first_name":"Roy","full_name":"Pritam, Roy","last_name":"Pritam"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:46Z","citation":{"ieee":"K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.","short":"K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).","ama":"Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. 2011.","apa":"Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.","mla":"Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, 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, .","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011."}},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Manas","full_name":"Joglekar, Manas","last_name":"Joglekar"},{"first_name":"Shah","last_name":"Nisarg","full_name":"Nisarg, Shah"}],"publist_id":"3282","external_id":{"arxiv":["1104.3348"]},"article_processing_charge":"No","title":"Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives","editor":[{"first_name":"Ganesh","last_name":"Gopalakrishnan","full_name":"Gopalakrishnan, Ganesh"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"citation":{"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. https://doi.org/10.1007/978-3-642-22110-1_21.","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.","mla":"Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.","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:10.1007/978-3-642-22110-1_21","apa":"Chatterjee, K., Henzinger, M. H., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21","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.","short":"K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"page":"260 - 276","doi":"10.1007/978-3-642-22110-1_21","date_published":"2011-08-11T00:00:00Z","date_created":"2018-12-11T12:02:47Z","year":"2011","day":"11","quality_controlled":"1","publisher":"Springer","oa":1,"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T11:00:13Z","type":"conference","conference":{"location":"Snowbird, USA","end_date":"2011-07-20","start_date":"2011-07-14","name":"CAV: Computer Aided Verification"},"status":"public","_id":"3342","related_material":{"record":[{"id":"2831","status":"public","relation":"later_version"}]},"volume":6806,"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1104.3348","open_access":"1"}],"month":"08","intvolume":" 6806","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."}],"oa_version":"Preprint"},{"volume":6638,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1101.1727","open_access":"1"}],"month":"06","intvolume":" 6638","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 "eventually". 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"}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:50Z","type":"conference","conference":{"start_date":"2011-05-26","location":"Tarragona, Spain","end_date":"2011-05-31","name":"LATA: Language and Automata Theory and Applications"},"status":"public","_id":"3347","page":"216 - 226","doi":"10.1007/978-3-642-21254-3_16","date_published":"2011-06-16T00:00:00Z","date_created":"2018-12-11T12:02:48Z","year":"2011","day":"16","publisher":"Springer","quality_controlled":"1","oa":1,"publist_id":"3274","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Nathanaël","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0","full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow"}],"external_id":{"arxiv":["1101.1727"]},"title":"Finitary languages","citation":{"short":"K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.","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.","apa":"Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16","ama":"Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.","ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}]}]