--- _id: '3327' 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. alternative_title: - LNCS author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: 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' 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. 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.' ista: 'Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198.' 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. short: U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198. conference: end_date: 2011-04-03 location: Saarbrücken, Germany name: 'FoSSaCS: Foundations of Software Science and Computation Structures' start_date: 2011-03-26 date_created: 2018-12-11T12:02:41Z date_published: 2011-03-29T00:00:00Z date_updated: 2021-01-12T07:42:41Z day: '29' doi: 10.1007/978-3-642-19805-2_13 editor: - first_name: Martin full_name: Hofmann, Martin last_name: Hofmann extern: '1' intvolume: ' 6604' language: - iso: eng month: '03' oa_version: None page: 184 - 198 publication_status: published publisher: Springer publist_id: '3308' quality_controlled: '1' status: public title: Co-Büching them all type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6604 year: '2011' ... --- _id: '3337' 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. author: - first_name: Zhikun full_name: Wang, Zhikun last_name: Wang - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Katharina full_name: Mülling, Katharina last_name: Mülling - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Jan full_name: Peters, Jan last_name: Peters citation: 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' 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. 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.' 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. conference: end_date: 2011-09-30 location: San Francisco, USA name: 'IROS: RSJ International Conference on Intelligent Robots and Systems' start_date: 2011-09-25 date_created: 2018-12-11T12:02:45Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:45Z day: '01' department: - _id: ChLa doi: 10.1109/IROS.2011.6094892 language: - iso: eng month: '01' oa_version: None page: 332 - 337 publication_status: published publisher: IEEE publist_id: '3293' quality_controlled: '1' scopus_import: 1 status: public title: Learning anticipation policies for robot table tennis type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3339' 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. ' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Roy full_name: Pritam, Roy last_name: Pritam citation: 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. 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. 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. ista: Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, . mla: Chatterjee, Krishnendu, et al. “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). date_created: 2018-12-11T12:02:46Z date_published: 2011-07-11T00:00:00Z date_updated: 2021-01-12T07:42:46Z day: '11' department: - _id: KrCh external_id: arxiv: - '1107.2132' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.2132 month: '07' oa: 1 oa_version: Preprint page: '17' publication: arXiv publication_status: published publisher: ArXiv publist_id: '3286' status: public title: Magnifying lens abstraction for stochastic games with discounted and long-run average objectives type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3342' 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.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Manas full_name: Joglekar, Manas last_name: Joglekar - first_name: Shah full_name: Nisarg, Shah last_name: Nisarg citation: 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' 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. 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.' 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. short: K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276. conference: end_date: 2011-07-20 location: Snowbird, USA name: 'CAV: Computer Aided Verification' start_date: 2011-07-14 date_created: 2018-12-11T12:02:47Z date_published: 2011-08-11T00:00:00Z date_updated: 2023-02-23T11:00:13Z day: '11' department: - _id: KrCh doi: 10.1007/978-3-642-22110-1_21 editor: - first_name: Ganesh full_name: Gopalakrishnan, Ganesh last_name: Gopalakrishnan - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer external_id: arxiv: - '1104.3348' intvolume: ' 6806' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.3348 month: '08' oa: 1 oa_version: Preprint page: 260 - 276 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3282' quality_controlled: '1' related_material: record: - id: '2831' relation: later_version status: public status: public title: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives type: conference user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 6806 year: '2011' ... --- _id: '3347' abstract: - lang: eng 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.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathanaël full_name: Fijalkow, Nathanaël id: A1B5DD72-E997-11E9-8398-E808B6C6ADC0 last_name: Fijalkow citation: ama: 'Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16' 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' 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. 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.' ista: 'Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.' 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. short: K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226. conference: end_date: 2011-05-31 location: Tarragona, Spain name: 'LATA: Language and Automata Theory and Applications' start_date: 2011-05-26 date_created: 2018-12-11T12:02:48Z date_published: 2011-06-16T00:00:00Z date_updated: 2021-01-12T07:42:50Z day: '16' department: - _id: KrCh doi: 10.1007/978-3-642-21254-3_16 external_id: arxiv: - '1101.1727' intvolume: ' 6638' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1101.1727 month: '06' oa: 1 oa_version: Preprint page: 216 - 226 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3274' quality_controlled: '1' scopus_import: 1 status: public title: Finitary languages type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6638 year: '2011' ... --- _id: '3346' abstract: - lang: eng 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>;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>;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. article_number: '5970225' author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Václav full_name: Brožek, Václav last_name: Brožek - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera citation: 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:10.1109/LICS.2011.10' apa: '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. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10' 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. https://doi.org/10.1109/LICS.2011.10. 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.' 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.' mla: Brázdil, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10. short: T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011. conference: end_date: 2011-06-24 location: Toronto, Canada name: 'LICS: Logic in Computer Science' start_date: 2011-06-21 date_created: 2018-12-11T12:02:48Z date_published: 2011-06-21T00:00:00Z date_updated: 2021-01-12T07:42:49Z day: '21' department: - _id: KrCh doi: 10.1109/LICS.2011.10 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.3489 month: '06' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: IEEE publist_id: '3275' quality_controlled: '1' scopus_import: 1 status: public title: Two views on multiple mean payoff objectives in Markov Decision Processes type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3348' 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. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Vinayak full_name: Prabhu, Vinayak last_name: Prabhu citation: ama: 'Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734' apa: 'Chatterjee, K., & 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. https://doi.org/10.1145/1967701.1967734' chicago: Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734. 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.' 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. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734. short: K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230. conference: end_date: 2011-04-14 location: Chicago, USA name: 'HSCC: Hybrid Systems - Computation and Control' start_date: 2011-04-12 date_created: 2018-12-11T12:02:49Z date_published: 2011-01-31T00:00:00Z date_updated: 2021-01-12T07:42:50Z day: '31' department: - _id: KrCh doi: 10.1145/1967701.1967734 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1101.5842 month: '01' oa: 1 oa_version: Submitted Version page: 221 - 230 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3273' quality_controlled: '1' scopus_import: 1 status: public title: Synthesis of memory efficient real time controllers for safety objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3344' abstract: - lang: eng 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.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1' apa: 'Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1' chicago: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1. ieee: 'K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.' ista: 'Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.' mla: Chatterjee, Krishnendu. Graph Games with Reachability Objectives. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:10.1007/978-3-642-24288-5_1. short: K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1. conference: end_date: 2011-09-30 location: Genoa, Italy name: 'RP: Reachability Problems' start_date: 2011-09-28 date_created: 2018-12-11T12:02:47Z date_published: 2011-10-15T00:00:00Z date_updated: 2021-01-12T07:42:48Z day: '15' department: - _id: KrCh doi: 10.1007/978-3-642-24288-5_1 editor: - first_name: Giorgo full_name: Delzanno, Giorgo last_name: Delzanno - first_name: Igor full_name: Potapov, Igor last_name: Potapov intvolume: ' 6945' language: - iso: eng month: '10' oa_version: None page: 1 - 1 publication_status: published publisher: Springer publist_id: '3277' quality_controlled: '1' status: public title: Graph games with reachability objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6945 year: '2011' ... --- _id: '3343' abstract: - lang: eng 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 > 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.' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: 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:10.1137/1.9781611973082.101' apa: 'Chatterjee, K., & 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. https://doi.org/10.1137/1.9781611973082.101' 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. https://doi.org/10.1137/1.9781611973082.101. 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.' 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.' mla: Chatterjee, Krishnendu, and Monika H. Henzinger. Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM, 2011, pp. 1318–36, doi:10.1137/1.9781611973082.101. short: K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336. conference: end_date: 2011-01-25 location: San Francisco, SA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2011-01-23 date_created: 2018-12-11T12:02:47Z date_published: 2011-01-01T00:00:00Z date_updated: 2023-02-14T10:36:10Z day: '01' department: - _id: KrCh doi: 10.1137/1.9781611973082.101 language: - iso: eng main_file_link: - open_access: '1' url: https://eprints.cs.univie.ac.at/21/ month: '01' oa: 1 oa_version: Submitted Version page: 1318 - 1336 publication_status: published publisher: SIAM publist_id: '3278' quality_controlled: '1' scopus_import: '1' status: public title: Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3360' abstract: - lang: eng text: 'A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 < lambda < 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. ' alternative_title: - LIPIcs author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82' apa: 'Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82' chicago: Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82. ieee: 'U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.' ista: 'Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.' mla: Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82. short: U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96. conference: end_date: 2011-09-15 location: Bergen, Norway name: 'CSL: Computer Science Logic' start_date: 2011-09-12 date_created: 2018-12-11T12:02:53Z date_published: 2011-08-31T00:00:00Z date_updated: 2021-01-12T07:42:56Z day: '31' ddc: - '004' department: - _id: ToHe doi: 10.4230/LIPIcs.CSL.2011.82 ec_funded: 1 file: - access_level: open_access checksum: 250603c6be8ccad4fbd4d7b24221f0ee content_type: application/pdf creator: system date_created: 2018-12-12T10:10:17Z date_updated: 2020-07-14T12:46:10Z file_id: '4803' file_name: IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf file_size: 504270 relation: main_file file_date_updated: 2020-07-14T12:46:10Z has_accepted_license: '1' intvolume: ' 12' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 82 - 96 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems publication_status: published publisher: Springer publist_id: '3255' pubrep_id: '82' quality_controlled: '1' scopus_import: 1 status: public title: Determinizing discounted-sum automata tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2011' ...