[{"month":"09","_id":"2052","abstract":[{"lang":"eng","text":"A standard technique for solving the parameterized model checking problem is to reduce it to the classic model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the parameterized model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that model checking the parameterized system can be reduced to model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata."}],"date_published":"2014-09-01T00:00:00Z","date_created":"2018-12-11T11:55:26Z","page":"109 - 124","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","quality_controlled":"1","department":[{"_id":"KrCh"}],"intvolume":"      8704","status":"public","volume":8704,"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"4994","day":"01","type":"conference","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","last_name":"Aminof","first_name":"Benjamin","full_name":"Aminof, Benjamin"},{"last_name":"Kotek","first_name":"Tomer","full_name":"Kotek, Tomer"},{"last_name":"Rubin","full_name":"Rubin, Sacha","first_name":"Sacha"},{"full_name":"Spegni, Francesco","first_name":"Francesco","last_name":"Spegni"},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"}],"year":"2014","alternative_title":["LNCS"],"oa_version":"None","citation":{"mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>.","ieee":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 109–124.","ista":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model checking of rendezvous systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.","chicago":"Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>.","apa":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., &#38; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">https://doi.org/10.1007/978-3-662-44584-6_9</a>","ama":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking of rendezvous systems. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:109-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_9\">10.1007/978-3-662-44584-6_9</a>","short":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–124."},"title":"Parameterized model checking of rendezvous systems","conference":{"location":"Rome, Italy","name":"CONCUR: Concurrency Theory","end_date":"2014-09-05","start_date":"2014-09-02"},"editor":[{"last_name":"Baldan","first_name":"Paolo","full_name":"Baldan, Paolo"},{"first_name":"Daniele","full_name":"Gorla, Daniele","last_name":"Gorla"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:54:59Z","doi":"10.1007/978-3-662-44584-6_9","acknowledgement":"The second, third, fourth and fifth authors were supported by the Austrian National Research Network S11403-N23 (RiSE) of the Austrian Science Fund (FWF) and by the Vienna Science and Technology Fund (WWTF) through grants PROSEED, ICT12-059, and VRG11-005."},{"date_published":"2014-09-01T00:00:00Z","_id":"2053","abstract":[{"lang":"eng","text":"In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition refines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems."}],"volume":8704,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5084"}],"oa":1,"publication_status":"published","oa_version":"Submitted Version","year":"2014","publist_id":"4993","editor":[{"last_name":"Baldan","first_name":"Paolo","full_name":"Baldan, Paolo"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"date_updated":"2021-01-12T06:55:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:55:27Z","month":"09","page":"249 - 265","status":"public","intvolume":"      8704","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"author":[{"first_name":"Holger","full_name":"Hermanns, Holger","last_name":"Hermanns"},{"full_name":"Krčál, Jan","first_name":"Jan","last_name":"Krčál"},{"first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"}],"type":"conference","day":"01","conference":{"location":"Rome, Italy","start_date":"2014-09-02","end_date":"2014-09-05","name":"CONCUR: Concurrency Theory"},"title":"Probabilistic bisimulation: Naturally on distributions","ec_funded":1,"citation":{"short":"H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.","apa":"Hermanns, H., Krčál, J., &#38; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>","ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 249–265.","ista":"Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>.","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>."},"doi":"10.1007/978-3-662-44584-6_18","language":[{"iso":"eng"}],"acknowledgement":"This work is supported by the EU 7th Framework Programme under grant agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}]},{"publist_id":"4992","oa_version":"None","year":"2014","editor":[{"first_name":"Paolo","full_name":"Baldan, Paolo","last_name":"Baldan"},{"full_name":"Gorla, Daniele","first_name":"Daniele","last_name":"Gorla"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T11:23:36Z","abstract":[{"text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where 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. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games.","lang":"eng"}],"_id":"2054","date_published":"2014-09-01T00:00:00Z","volume":8704,"publication_status":"published","day":"01","type":"conference","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"citation":{"mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>.","ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 544–559.","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559."},"ec_funded":1,"title":"Qualitative concurrent parity games: Bounded rationality","conference":{"location":"Rome, Italy","name":"CONCUR: Concurrency Theory","start_date":"2014-09-02","end_date":"2014-09-05"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-44584-6_37","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3354"}]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"09","date_created":"2018-12-11T11:55:27Z","page":"544 - 559","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","quality_controlled":"1","department":[{"_id":"KrCh"}],"intvolume":"      8704","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"publisher":"Springer","publication_status":"published","status":"public","intvolume":"      8559","volume":8559,"quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"473 - 490","_id":"2063","date_published":"2014-07-01T00:00:00Z","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements.","lang":"eng"}],"date_created":"2018-12-11T11:55:30Z","month":"07","related_material":{"record":[{"status":"public","id":"5412","relation":"earlier_version"},{"id":"5413","relation":"earlier_version","status":"public"},{"id":"5414","relation":"earlier_version","status":"public"},{"status":"public","id":"1155","relation":"dissertation_contains"}]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"doi":"10.1007/978-3-319-08867-9_31","date_updated":"2023-09-07T11:58:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"CEGAR for qualitative analysis of probabilistic systems","conference":{"name":"CAV: Computer Aided Verification","end_date":"2014-07-22","start_date":"2014-07-18","location":"Vienna, Austria"},"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. Vol. 8559, Springer, 2014, pp. 473–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490."},"ec_funded":1,"type":"conference","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"}],"alternative_title":["LNCS"],"oa_version":"None","year":"2014","publist_id":"4978","day":"01"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2025-06-02T08:53:48Z","scopus_import":"1","oa_version":"Submitted Version","year":"2014","publist_id":"4883","oa":1,"main_file_link":[{"url":"https://eprints.cs.univie.ac.at/3933/","open_access":"1"}],"publication_status":"published","volume":61,"issue":"3","article_processing_charge":"No","date_published":"2014-05-01T00:00:00Z","_id":"2141","abstract":[{"text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem.","lang":"eng"}],"article_number":"a15","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"relation":"earlier_version","id":"3165","status":"public"}]},"doi":"10.1145/2597631","language":[{"iso":"eng"}],"title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","ec_funded":1,"citation":{"short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014).","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>","apa":"Chatterjee, K., &#38; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","ista":"Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>."},"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"type":"journal_article","day":"01","publisher":"ACM","intvolume":"        61","status":"public","department":[{"_id":"KrCh"}],"quality_controlled":"1","publication":"Journal of the ACM","date_created":"2018-12-11T11:55:57Z","month":"05"},{"publist_id":"4822","year":"2014","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:24:48Z","external_id":{"arxiv":["1404.5734"]},"arxiv":1,"issue":"Part 2","abstract":[{"text":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lies in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP ∩ coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games.","lang":"eng"}],"_id":"2162","date_published":"2014-01-01T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5734"}],"oa":1,"volume":8573,"ec_funded":1,"citation":{"ama":"Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Mean Payoff Games</i>. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133."},"conference":{"start_date":"2014-07-08","end_date":"2014-07-11","name":"ICST: International Conference on Software Testing, Verification and Validation","location":"Copenhagen, Denmark"},"title":"The complexity of ergodic mean payoff games","day":"01","alternative_title":["LNCS"],"type":"conference","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"id":"5404","relation":"earlier_version","status":"public"}]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-43951-7_11","page":"122 - 133","month":"01","date_created":"2018-12-11T11:56:04Z","publisher":"Springer","department":[{"_id":"KrCh"}],"quality_controlled":"1","status":"public","intvolume":"      8573"},{"date_updated":"2023-02-23T12:25:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1404.5453"]},"publist_id":"4821","year":"2014","oa_version":"Preprint","volume":8573,"publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1404.5453"}],"date_published":"2014-01-01T00:00:00Z","_id":"2163","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games.","lang":"eng"}],"arxiv":1,"issue":"Part 2","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-43951-7_10","acknowledgement":"This research was partly supported by European project Cassting (FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5418"}]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_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"}],"day":"01","alternative_title":["LNCS"],"type":"conference","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"ec_funded":1,"citation":{"ama":"Chatterjee K, Doyen L. Games with a weak adversary. In: <i>Lecture Notes in Computer Science</i>. Vol 8573. Springer; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2014). Games with a weak adversary. In <i>Lecture Notes in Computer Science</i> (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>","short":"K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” <i>Lecture Notes in Computer Science</i>, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In <i>Lecture Notes in Computer Science</i>, 8573:110–21. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>.","ieee":"K. Chatterjee and L. Doyen, “Games with a weak adversary,” in <i>Lecture Notes in Computer Science</i>, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121."},"conference":{"location":"Copenhagen, Denmark","name":"ICALP: Automata, Languages and Programming","start_date":"2014-07-08","end_date":"2014-07-11"},"title":"Games with a weak adversary","department":[{"_id":"KrCh"}],"quality_controlled":"1","publication":"Lecture Notes in Computer Science","intvolume":"      8573","status":"public","publisher":"Springer","month":"01","date_created":"2018-12-11T11:56:04Z","page":"110 - 121"},{"publisher":"Springer","intvolume":"        51","status":"public","publication":"Acta Informatica","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","page":"193 - 220","date_created":"2018-12-11T11:56:13Z","month":"06","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"doi":"10.1007/s00236-013-0191-5","ddc":["621"],"language":[{"iso":"eng"}],"title":"Synthesizing robust systems","citation":{"chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.","ieee":"R. Bloem <i>et al.</i>, “Synthesizing robust systems,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. <i>Acta Informatica</i>. 2014;51(3-4):193-220. doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>"},"ec_funded":1,"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Karin","full_name":"Greimel, Karin","last_name":"Greimel"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Georg","full_name":"Hofferek, Georg","last_name":"Hofferek"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"},{"full_name":"Könighofer, Bettina","first_name":"Bettina","last_name":"Könighofer"},{"full_name":"Könighofer, Robert","first_name":"Robert","last_name":"Könighofer"}],"type":"journal_article","day":"01","oa":1,"publication_status":"published","pubrep_id":"71","volume":51,"file_date_updated":"2020-07-14T12:45:31Z","article_processing_charge":"No","issue":"3-4","date_published":"2014-06-01T00:00:00Z","_id":"2187","abstract":[{"text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.","lang":"eng"}],"file":[{"relation":"main_file","file_id":"5234","content_type":"application/pdf","date_created":"2018-12-12T10:16:44Z","creator":"system","file_size":169523,"file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","checksum":"d7f560f3d923f0f00aa10a0652f83273","access_level":"open_access","date_updated":"2020-07-14T12:45:31Z"}],"scopus_import":1,"date_updated":"2021-01-12T06:55:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa_version":"Submitted Version","year":"2014","article_type":"original","publist_id":"4787"},{"doi":"10.1007/978-3-319-08867-9_13","language":[{"iso":"eng"}],"acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"alternative_title":["LNCS"],"author":[{"first_name":"Javier","full_name":"Esparza, Javier","last_name":"Esparza"},{"first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","day":"01","conference":{"name":"CAV: Computer Aided Verification"},"title":"From LTL to deterministic automata: A safraless compositional approach","ec_funded":1,"citation":{"ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.","ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>.","mla":"Esparza, Javier, and Jan Kretinsky. <i>From LTL to Deterministic Automata: A Safraless Compositional Approach</i>. Vol. 8559, Springer, 2014, pp. 192–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>.","short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","apa":"Esparza, J., &#38; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>"},"intvolume":"      8559","status":"public","quality_controlled":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","date_created":"2018-12-11T11:56:14Z","month":"01","page":"192 - 208","date_updated":"2021-01-12T06:55:53Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","year":"2014","publist_id":"4784","volume":8559,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.3388"}],"oa":1,"publication_status":"published","date_published":"2014-01-01T00:00:00Z","_id":"2190","abstract":[{"text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.","lang":"eng"}]},{"citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2579821\">https://doi.org/10.1145/2579821</a>.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 2. ACM, 2014.","ista":"Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 2, 16, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2579821\">10.1145/2579821</a>.","short":"K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014).","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2014;15(2). doi:<a href=\"https://doi.org/10.1145/2579821\">10.1145/2579821</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2579821\">https://doi.org/10.1145/2579821</a>"},"title":"Partial-observation stochastic games: How to win when belief fails","day":"01","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"type":"journal_article","related_material":{"record":[{"status":"public","id":"1903","relation":"earlier_version"},{"id":"2955","relation":"earlier_version","status":"public"},{"relation":"earlier_version","id":"5381","status":"public"}]},"language":[{"iso":"eng"}],"doi":"10.1145/2579821","month":"04","date_created":"2018-12-11T11:56:21Z","publisher":"ACM","quality_controlled":"1","department":[{"_id":"KrCh"}],"publication":"ACM Transactions on Computational Logic (TOCL)","intvolume":"        15","status":"public","publist_id":"4759","year":"2014","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:23:43Z","scopus_import":1,"external_id":{"arxiv":["1107.2141"]},"arxiv":1,"issue":"2","article_number":"16","_id":"2211","abstract":[{"text":"In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"date_published":"2014-04-01T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"oa":1,"volume":15},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-54830-7_14","related_material":{"record":[{"relation":"earlier_version","id":"5405","status":"public"}]},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported by European project Cassting (FP7-601148).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128.","day":"01","type":"conference","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Gimbert","first_name":"Hugo","full_name":"Gimbert, Hugo"},{"last_name":"Oualhadj","full_name":"Oualhadj, Youssouf","first_name":"Youssouf"}],"alternative_title":["LNCS"],"citation":{"short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.","mla":"Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. Vol. 8412, Springer, 2014, pp. 210–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>."},"ec_funded":1,"title":"Perfect-information stochastic mean-payoff parity games","conference":{"location":"Grenoble, France","end_date":"2014-04-13","start_date":"2014-04-05","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"      8412","status":"public","publisher":"Springer","month":"04","date_created":"2018-12-11T11:56:21Z","page":"210 - 225","scopus_import":1,"date_updated":"2023-02-23T12:24:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4758","oa_version":"None","year":"2014","volume":8412,"publication_status":"published","abstract":[{"text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2 1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic). We present an algorithm running in time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2 1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). ","lang":"eng"}],"_id":"2212","date_published":"2014-04-01T00:00:00Z"},{"doi":"10.1007/978-3-642-54830-7_16","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"5408","relation":"earlier_version"}]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"_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"}],"acknowledgement":"This research was supported by European project Cassting (FP7-601148), NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Sumit","full_name":"Nain, Sumit","last_name":"Nain"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}],"type":"conference","alternative_title":["LNCS"],"day":"01","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","conference":{"end_date":"2014-04-13","start_date":"2014-04-05","name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Grenoble, France"},"citation":{"ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.","ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">https://doi.org/10.1007/978-3-642-54830-7_16</a>.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. Vol. 8412, Springer, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">10.1007/978-3-642-54830-7_16</a>.","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.","apa":"Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">https://doi.org/10.1007/978-3-642-54830-7_16</a>","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Vol 8412. Springer; 2014:242-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_16\">10.1007/978-3-642-54830-7_16</a>"},"ec_funded":1,"status":"public","intvolume":"      8412","quality_controlled":"1","department":[{"_id":"KrCh"}],"publisher":"Springer","date_created":"2018-12-11T11:56:21Z","month":"04","page":"242 - 257","scopus_import":1,"external_id":{"arxiv":["1401.3289"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:24:58Z","oa_version":"Preprint","year":"2014","publist_id":"4757","volume":8412,"main_file_link":[{"url":"http://arxiv.org/abs/1401.3289","open_access":"1"}],"oa":1,"publication_status":"published","_id":"2213","abstract":[{"text":"We consider two-player partial-observation stochastic games on finitestate graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are ε-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME.We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis.","lang":"eng"}],"date_published":"2014-04-01T00:00:00Z","arxiv":1},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:01Z","language":[{"iso":"eng"}],"doi":"10.1145/2562059.2562141","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5409"}]},"day":"01","publist_id":"4752","year":"2014","oa_version":"Submitted Version","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"type":"conference","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. <a href=\"https://doi.org/10.1145/2562059.2562141\">https://doi.org/10.1145/2562059.2562141</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Timed Automata</i>. Springer, 2014, pp. 303–12, doi:<a href=\"https://doi.org/10.1145/2562059.2562141\">10.1145/2562059.2562141</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.","ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata. In: Springer; 2014:303-312. doi:<a href=\"https://doi.org/10.1145/2562059.2562141\">10.1145/2562059.2562141</a>","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1145/2562059.2562141\">https://doi.org/10.1145/2562059.2562141</a>"},"conference":{"location":"Berlin, Germany","end_date":"2017-04-17","start_date":"2017-04-15","name":"HSCC: Hybrid Systems - Computation and Control"},"title":"Edit distance for timed automata","department":[{"_id":"KrCh"}],"quality_controlled":"1","status":"public","publication_status":"published","publisher":"Springer","oa":1,"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=2562059.2562141"}],"month":"01","abstract":[{"text":"The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. In this paper, we lift the study of edit distances from untimed languages to the timed setting. We define an edit distance between timed words which incorporates both the edit distance between the untimed words and the absolute difference in time stamps. Our edit distance between two timed words is computable in polynomial time. Further, we show that the edit distance between a timed word and a timed language generated by a timed automaton, defined as the edit distance between the word and the closest word in the language, is PSPACE-complete. While computing the edit distance between two timed automata is undecidable, we show that the approximate version, where we decide if the edit distance between two timed automata is either less than a given parameter or more than δ away from the parameter, for δ &gt; 0, can be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques can be generalized to the setting of hybrid systems, and analogous decidability results hold for rectangular automata.","lang":"eng"}],"_id":"2216","date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:56:22Z","page":"303 - 312"},{"publist_id":"4727","year":"2014","oa_version":"Published Version","has_accepted_license":"1","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:11Z","publication_identifier":{"issn":["18605974"]},"issue":"1","file":[{"checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","file_name":"IST-2016-428-v1+1_1104.3489.pdf","file_size":375388,"creator":"system","date_created":"2018-12-12T10:07:57Z","content_type":"application/pdf","file_id":"4656","relation":"main_file"}],"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 κ limit-average 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 case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε &gt; 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε &gt; 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results."}],"_id":"2234","date_published":"2014-02-14T00:00:00Z","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"http://repository.ist.ac.at/id/eprint/428"}],"file_date_updated":"2020-07-14T12:45:34Z","pubrep_id":"428","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":10,"citation":{"ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014.","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>.","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>"},"ec_funded":1,"title":"Markov decision processes with multiple long-run average objectives","day":"14","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"full_name":"Brožek, Václav","first_name":"Václav","last_name":"Brožek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"type":"journal_article","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"doi":"10.2168/LMCS-10(1:13)2014","ddc":["000"],"month":"02","date_created":"2018-12-11T11:56:29Z","publisher":"International Federation of Computational Logic","publication":"Logical Methods in Computer Science","department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"        10","status":"public"},{"type":"journal_article","author":[{"last_name":"Grinshpun","full_name":"Grinshpun, Andrey","first_name":"Andrey"},{"first_name":"Pakawat","full_name":"Phalitnonkiat, Pakawat","last_name":"Phalitnonkiat"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","full_name":"Rubin, Sasha","last_name":"Rubin"},{"first_name":"Andrei","full_name":"Tarfulea, Andrei","last_name":"Tarfulea"}],"year":"2014","oa_version":"Submitted Version","day":"13","publist_id":"4703","title":"Alternating traps in Muller and parity games","citation":{"chicago":"Grinshpun, Andrey, Pakawat Phalitnonkiat, Sasha Rubin, and Andrei Tarfulea. “Alternating Traps in Muller and Parity Games.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">https://doi.org/10.1016/j.tcs.2013.11.032</a>.","ista":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.","ieee":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” <i>Theoretical Computer Science</i>, vol. 521. Elsevier, pp. 73–91, 2014.","mla":"Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.” <i>Theoretical Computer Science</i>, vol. 521, Elsevier, 2014, pp. 73–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">10.1016/j.tcs.2013.11.032</a>.","short":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.","ama":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. Alternating traps in Muller and parity games. <i>Theoretical Computer Science</i>. 2014;521:73-91. doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">10.1016/j.tcs.2013.11.032</a>","apa":"Grinshpun, A., Phalitnonkiat, P., Rubin, S., &#38; Tarfulea, A. (2014). Alternating traps in Muller and parity games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">https://doi.org/10.1016/j.tcs.2013.11.032</a>"},"publication_identifier":{"issn":["03043975"]},"doi":"10.1016/j.tcs.2013.11.032","scopus_import":1,"date_updated":"2021-01-12T06:56:16Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are parity games; these are of particular significance in computational complexity, as they remain one of the few combinatorial problems known to be in NP ∩ co-NP but not known to be in P. We show that winning regions for a Muller game can be determined from the alternating structure of its traps. To every Muller game we then associate a natural number that we call its trap depth; this parameter measures how complicated the trap structure is. We present algorithms for parity games that run in polynomial time for graphs of bounded trap depth, and in general run in time exponential in the trap depth. ","lang":"eng"}],"_id":"2246","date_published":"2014-02-13T00:00:00Z","date_created":"2018-12-11T11:56:33Z","month":"02","page":"73 - 91","status":"public","intvolume":"       521","volume":521,"publication":"Theoretical Computer Science","department":[{"_id":"KrCh"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.3777"}],"oa":1,"publisher":"Elsevier","publication_status":"published"},{"file_date_updated":"2020-07-14T12:46:35Z","volume":146,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"pubrep_id":"952","publication_status":"published","oa":1,"file":[{"file_id":"5260","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:17:08Z","creator":"system","file_size":100115,"file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","checksum":"4d7b4ab82980cca2b96ac7703992a8c8","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z"}],"date_published":"2014-04-01T00:00:00Z","_id":"475","abstract":[{"lang":"eng","text":"First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (or nodes) forming this cycle. These games are traditionally of interest because of their connection with infinite-duration games such as parity and mean-payoff games. We study the memory requirements for winning strategies of FCGs and certain associated infinite duration games. We exhibit a simple FCG that is not memoryless determined (this corrects a mistake in Memoryless determinacy of parity and mean payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims that FCGs for which Y is closed under cyclic permutations are memoryless determined). We show that θ (n)! memory (where n is the number of nodes in the graph), which is always sufficient, may be necessary to win some FCGs. On the other hand, we identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations, and both Y and its complement are closed under concatenation) that are sufficient to ensure that the corresponding FCGs and their associated infinite duration games are memoryless determined. We demonstrate that many games considered in the literature, such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE, solving some families of FCGs is PSPACE-hard. "}],"date_updated":"2021-01-12T08:00:53Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publist_id":"7345","has_accepted_license":"1","year":"2014","oa_version":"Published Version","quality_controlled":"1","department":[{"_id":"KrCh"}],"publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","status":"public","intvolume":"       146","publisher":"Open Publishing Association","month":"04","date_created":"2018-12-11T11:46:41Z","page":"83 - 90","language":[{"iso":"eng"}],"doi":"10.4204/EPTCS.146.11","ddc":["004"],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"day":"01","alternative_title":["EPTCS"],"author":[{"first_name":"Benjamin","full_name":"Aminof, Benjamin","last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","full_name":"Rubin, Sasha","first_name":"Sasha"}],"type":"conference","ec_funded":1,"citation":{"chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 146:83–90. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>.","ieee":"B. Aminof and S. Rubin, “First cycle games,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Grenoble, France, 2014, vol. 146, pp. 83–90.","ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","ama":"Aminof B, Rubin S. First cycle games. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 146. Open Publishing Association; 2014:83-90. doi:<a href=\"https://doi.org/10.4204/EPTCS.146.11\">10.4204/EPTCS.146.11</a>","apa":"Aminof, B., &#38; Rubin, S. (2014). First cycle games. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.146.11\">https://doi.org/10.4204/EPTCS.146.11</a>"},"conference":{"start_date":"2014-04-05","end_date":"2014-04-06","name":"SR: Strategic Reasoning","location":"Grenoble, France"},"title":"First cycle games"},{"intvolume":"        70","status":"public","publication":"Algorithmica","department":[{"_id":"KrCh"}],"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T11:47:01Z","month":"11","page":"457 - 492","doi":"10.1007/s00453-013-9843-7","language":[{"iso":"eng"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10905"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"type":"journal_article","day":"01","title":"Polynomial-time algorithms for energy games with special weight structures","citation":{"mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>.","ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” <i>Algorithmica</i>, vol. 70, no. 3. Springer, pp. 457–492, 2014.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. 2014;70(3):457-492. doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492."},"ec_funded":1,"volume":70,"main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"oa":1,"publication_status":"published","date_published":"2014-11-01T00:00:00Z","_id":"535","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help."}],"article_processing_charge":"No","issue":"3","arxiv":1,"scopus_import":"1","external_id":{"arxiv":["1604.08234"]},"date_updated":"2023-09-05T14:09:29Z","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","oa_version":"Preprint","year":"2014","article_type":"original","publist_id":"7282"},{"doi":"10.15479/AT:IST-2014-153-v1-1","ddc":["000"],"publication_identifier":{"issn":["2664-1690"]},"date_updated":"2023-02-23T12:25:18Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"id":"5413","relation":"later_version","status":"public"},{"relation":"later_version","id":"5414","status":"public"}]},"has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","year":"2014","type":"technical_report","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"}],"day":"29","title":"CEGAR for qualitative analysis of probabilistic systems","citation":{"apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>."},"pubrep_id":"153","status":"public","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z","oa":1,"publication_status":"published","publisher":"IST Austria","date_created":"2018-12-12T11:39:11Z","_id":"5412","date_published":"2014-01-29T00:00:00Z","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:47Z","checksum":"4d6cda4bebed970926403ad6ad8c745f","file_size":423322,"creator":"system","file_name":"IST-2014-153-v1+1_main.pdf","date_created":"2018-12-12T11:53:39Z","file_id":"5500","relation":"main_file","content_type":"application/pdf"}],"month":"01","page":"31"},{"title":"CEGAR for qualitative analysis of probabilistic systems","citation":{"chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>"},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"year":"2014","oa_version":"Published Version","has_accepted_license":"1","day":"06","related_material":{"record":[{"status":"public","relation":"later_version","id":"2063"},{"status":"public","relation":"earlier_version","id":"5412"},{"status":"public","id":"5414","relation":"later_version"}]},"publication_identifier":{"issn":["2664-1690"]},"ddc":["000"],"doi":"10.15479/AT:IST-2014-153-v2-2","language":[{"iso":"eng"}],"date_updated":"2023-02-23T12:25:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"33","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"_id":"5413","date_created":"2018-12-12T11:39:11Z","date_published":"2014-02-06T00:00:00Z","month":"02","file":[{"date_created":"2018-12-12T11:54:17Z","content_type":"application/pdf","file_id":"5539","relation":"main_file","checksum":"ce4967a184d84863eec76c66cbac1614","date_updated":"2020-07-14T12:46:47Z","access_level":"open_access","file_name":"IST-2014-153-v2+2_main.pdf","file_size":606049,"creator":"system"}],"oa":1,"publication_status":"published","publisher":"IST Austria","status":"public","pubrep_id":"164","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z"},{"related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"status":"public","id":"5412","relation":"earlier_version"},{"status":"public","id":"5413","relation":"earlier_version"}]},"publication_identifier":{"issn":["2664-1690"]},"ddc":["000"],"doi":"10.15479/AT:IST-2014-153-v3-1","language":[{"iso":"eng"}],"date_updated":"2023-02-23T12:25:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"CEGAR for qualitative analysis of probabilistic systems","citation":{"short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>."},"type":"technical_report","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","year":"2014","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","day":"07","oa":1,"publication_status":"published","publisher":"IST Austria","status":"public","pubrep_id":"165","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:48Z","page":"33","_id":"5414","date_created":"2018-12-12T11:39:12Z","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"date_published":"2014-02-07T00:00:00Z","month":"02","file":[{"creator":"system","file_size":606227,"file_name":"IST-2014-153-v3+1_main.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:48Z","checksum":"87b93fe9af71fc5c94b0eb6151537e11","file_id":"5464","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T11:53:03Z"}]}]