[{"_id":"1601","status":"public","conference":{"name":"CAV: Computer Aided Verification","end_date":"2015-07-24","location":"San Francisco, CA, United States","start_date":"2015-07-18"},"type":"conference","ddc":["000"],"date_updated":"2021-01-12T06:51:54Z","file_date_updated":"2020-07-14T12:45:04Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa_version":"Submitted Version","abstract":[{"text":"We propose a flexible exchange format for ω-automata, as typically used in formal verification, and implement support for it in a range of established tools. Our aim is to simplify the interaction of tools, helping the research community to build upon other people’s work. A key feature of the format is the use of very generic acceptance conditions, specified by Boolean combinations of acceptance primitives, rather than being limited to common cases such as Büchi, Streett, or Rabin. Such flexibility in the choice of acceptance conditions can be exploited in applications, for example in probabilistic model checking, and furthermore encourages the development of acceptance-agnostic tools for automata manipulations. The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata.","lang":"eng"}],"intvolume":" 9206","month":"07","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"file":[{"file_name":"2015_CAV_Babiak.pdf","date_created":"2020-05-15T08:38:12Z","file_size":1651779,"date_updated":"2020-07-14T12:45:04Z","creator":"dernst","checksum":"5885236fa88a439baba9ac6f3e801e93","file_id":"7850","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","ec_funded":1,"volume":9206,"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Babiak et al., “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.","short":"T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.","ama":"Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format. In: Vol 9206. Springer; 2015:479-486. doi:10.1007/978-3-319-21690-4_31","apa":"Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_31","mla":"Babiak, Tomáš, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer, 2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.","ista":"Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification, LNCS, vol. 9206, 479–486.","chicago":"Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata Format,” 9206:479–86. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_31."},"title":"The Hanoi omega-automata format","article_processing_charge":"No","publist_id":"5566","author":[{"first_name":"Tomáš","full_name":"Babiak, Tomáš","last_name":"Babiak"},{"first_name":"František","last_name":"Blahoudek","full_name":"Blahoudek, František"},{"full_name":"Duret Lutz, Alexandre","last_name":"Duret Lutz","first_name":"Alexandre"},{"first_name":"Joachim","full_name":"Klein, Joachim","last_name":"Klein"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"Mueller, Daniel","last_name":"Mueller","first_name":"Daniel"},{"last_name":"Parker","full_name":"Parker, David","first_name":"David"},{"first_name":"Jan","full_name":"Strejček, Jan","last_name":"Strejček"}],"oa":1,"quality_controlled":"1","publisher":"Springer","day":"16","year":"2015","has_accepted_license":"1","date_created":"2018-12-11T11:52:57Z","date_published":"2015-07-16T00:00:00Z","doi":"10.1007/978-3-319-21690-4_31","page":"479 - 486"},{"department":[{"_id":"KrCh"}],"date_updated":"2022-02-01T15:04:44Z","status":"public","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"type":"conference","_id":"1609","ec_funded":1,"volume":9135,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-662-47665-9"]},"intvolume":" 9135","month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.04844"}],"scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is “constructed from scratch” rather than composed from reusable components. However, this is rare in practice, and almost every non-trivial software system relies heavily on the use of libraries of reusable components. Recently, Lustig and Vardi introduced dataflow and controlflow synthesis from libraries of reusable components. They proved that dataflow synthesis is undecidable, while controlflow synthesis is decidable. The problem of controlflow synthesis from libraries of probabilistic components was considered by Nain, Lustig and Vardi, and was shown to be decidable for qualitative analysis (that asks that the specification be satisfied with probability 1). Our main contribution for controlflow synthesis from probabilistic components is to establish better complexity bounds for the qualitative analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i) is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; and (ii) belongs to UP ∩ coUP and is parity-games hard, when the specification is given directly as a parity condition on the components, improving the previously known EXPTIME upper bound."}],"title":"The complexity of synthesis from probabilistic components","article_processing_charge":"No","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Moshe","last_name":"Vardi","full_name":"Vardi, Moshe"}],"publist_id":"5557","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_9.","ista":"Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.","mla":"Chatterjee, Krishnendu, et al. “The Complexity of Synthesis from Probabilistic Components.” 42nd International Colloquium, vol. 9135, Springer Nature, 2015, pp. 108–20, doi:10.1007/978-3-662-47666-6_9.","apa":"Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_9","ama":"Chatterjee K, Doyen L, Vardi M. The complexity of synthesis from probabilistic components. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:108-120. doi:10.1007/978-3-662-47666-6_9","ieee":"K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, pp. 108–120.","short":"K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120."},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:53:00Z","date_published":"2015-06-20T00:00:00Z","doi":"10.1007/978-3-662-47666-6_9","page":"108 - 120","publication":"42nd International Colloquium","day":"20","year":"2015","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"This research was supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (SHiNE), ERC Start grant (279307: Graph Games), EU FP7 Project Cassting, NSF grants CNS 1049862 and CCF-1139011, by NSF Expeditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel."},{"author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Ben","full_name":"Adlam, Ben","last_name":"Adlam"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publist_id":"5536","title":"Cellular cooperation with shift updating and repulsion","citation":{"short":"A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).","ieee":"A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.","ama":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. Cellular cooperation with shift updating and repulsion. Scientific Reports. 2015;5. doi:10.1038/srep17147","apa":"Pavlogiannis, A., Chatterjee, K., Adlam, B., & Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep17147","mla":"Pavlogiannis, Andreas, et al. “Cellular Cooperation with Shift Updating and Repulsion.” Scientific Reports, vol. 5, 17147, Nature Publishing Group, 2015, doi:10.1038/srep17147.","ista":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5, 17147.","chicago":"Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.” Scientific Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep17147."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_number":"17147","date_created":"2018-12-11T11:53:06Z","doi":"10.1038/srep17147","date_published":"2015-11-25T00:00:00Z","year":"2015","has_accepted_license":"1","publication":"Scientific Reports","day":"25","oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","acknowledgement":"The research was supported by the Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft Faculty Fellows award. Support from the John Templeton foundation is gratefully acknowledged.","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:07Z","date_updated":"2021-01-12T06:52:05Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"466","status":"public","_id":"1624","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","volume":5,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:12:29Z","file_name":"IST-2016-466-v1+1_srep17147.pdf","creator":"system","date_updated":"2020-07-14T12:45:07Z","file_size":1021931,"file_id":"4947","checksum":"38e06d8310d2087cae5f6d4d4bfe082b","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"scopus_import":1,"intvolume":" 5","month":"11","abstract":[{"text":"Population structure can facilitate evolution of cooperation. In a structured population, cooperators can form clusters which resist exploitation by defectors. Recently, it was observed that a shift update rule is an extremely strong amplifier of cooperation in a one dimensional spatial model. For the shift update rule, an individual is chosen for reproduction proportional to fecundity; the offspring is placed next to the parent; a random individual dies. Subsequently, the population is rearranged (shifted) until all individual cells are again evenly spaced out. For large population size and a one dimensional population structure, the shift update rule favors cooperation for any benefit-to-cost ratio greater than one. But every attempt to generalize shift updating to higher dimensions while maintaining its strong effect has failed. The reason is that in two dimensions the clusters are fragmented by the movements caused by rearranging the cells. Here we introduce the natural phenomenon of a repulsive force between cells of different types. After a birth and death event, the cells are being rearranged minimizing the overall energy expenditure. If the repulsive force is sufficiently high, shift becomes a strong promoter of cooperation in two dimensions.","lang":"eng"}],"oa_version":"Published Version"},{"abstract":[{"lang":"eng","text":"We study the pattern frequency vector for runs in probabilistic Vector Addition Systems with States (pVASS). Intuitively, each configuration of a given pVASS is assigned one of finitely many patterns, and every run can thus be seen as an infinite sequence of these patterns. The pattern frequency vector assigns to each run the limit of pattern frequencies computed for longer and longer prefixes of the run. If the limit does not exist, then the vector is undefined. We show that for one-counter pVASS, the pattern frequency vector is defined and takes one of finitely many values for almost all runs. Further, these values and their associated probabilities can be approximated up to an arbitrarily small relative error in polynomial time. For stable two-counter pVASS, we show the same result, but we do not provide any upper complexity bound. As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the 80s."}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1505.02655","open_access":"1"}],"oa":1,"publisher":"IEEE","scopus_import":1,"alternative_title":["LICS"],"quality_controlled":"1","month":"07","publication_status":"published","year":"2015","language":[{"iso":"eng"}],"day":"01","page":"44 - 55","date_created":"2018-12-11T11:53:19Z","ec_funded":1,"date_published":"2015-07-01T00:00:00Z","doi":"10.1109/LICS.2015.15","_id":"1660","conference":{"start_date":"2015-07-06","end_date":"2015-07-10","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"type":"conference","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","citation":{"ama":"Brázdil T, Kiefer S, Kučera A, Novotný P. Long-run average behaviour of probabilistic vector addition systems. In: IEEE; 2015:44-55. doi:10.1109/LICS.2015.15","apa":"Brázdil, T., Kiefer, S., Kučera, A., & Novotný, P. (2015). Long-run average behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.15","short":"T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.","ieee":"T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour of probabilistic vector addition systems,” presented at the LICS: Logic in Computer Science, Kyoto, Japan, 2015, pp. 44–55.","mla":"Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.","ista":"Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS, , 44–55.","chicago":"Brázdil, Tomáš, Stefan Kiefer, Antonín Kučera, and Petr Novotný. “Long-Run Average Behaviour of Probabilistic Vector Addition Systems,” 44–55. IEEE, 2015. https://doi.org/10.1109/LICS.2015.15."},"date_updated":"2021-01-12T06:52:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5490","author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"full_name":"Kiefer, Stefan","last_name":"Kiefer","first_name":"Stefan"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny"}],"title":"Long-run average behaviour of probabilistic vector addition systems","department":[{"_id":"KrCh"}]},{"_id":"1665","status":"public","type":"journal_article","article_type":"original","date_updated":"2021-01-12T06:52:23Z","department":[{"_id":"KrCh"}],"pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Which genetic alterations drive tumorigenesis and how they evolve over the course of disease and therapy are central questions in cancer biology. Here we identify 44 recurrently mutated genes and 11 recurrent somatic copy number variations through whole-exome sequencing of 538 chronic lymphocytic leukaemia (CLL) and matched germline DNA samples, 278 of which were collected in a prospective clinical trial. These include previously unrecognized putative cancer drivers (RPS15, IKZF3), and collectively identify RNA processing and export, MYC activity, and MAPK signalling as central pathways involved in CLL. Clonality analysis of this large data set further enabled reconstruction of temporal relationships between driver events. Direct comparison between matched pre-treatment and relapse samples from 59 patients demonstrated highly frequent clonal evolution. Thus, large sequencing data sets of clinically informative samples enable the discovery of novel genes associated with cancer, the network of relationships between the driver events, and their impact on disease relapse and clinical outcome."}],"intvolume":" 526","month":"10","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":526,"issue":"7574","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 525–30, doi:10.1038/nature15395.","ieee":"D. Landau et al., “Mutations driving CLL and their evolution in progression and relapse,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp. 525–530, 2015.","short":"D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo, S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens, C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen, A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D. Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.","ama":"Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their evolution in progression and relapse. Nature. 2015;526(7574):525-530. doi:10.1038/nature15395","apa":"Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo, J., … Wu, C. (2015). Mutations driving CLL and their evolution in progression and relapse. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15395","chicago":"Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15395.","ista":"Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S, Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C, Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K, Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse. Nature. 526(7574), 525–530."},"title":"Mutations driving CLL and their evolution in progression and relapse","external_id":{"pmid":["26466571"]},"article_processing_charge":"No","publist_id":"5484","author":[{"first_name":"Dan","last_name":"Landau","full_name":"Landau, Dan"},{"full_name":"Tausch, Eugen","last_name":"Tausch","first_name":"Eugen"},{"first_name":"Amaro","full_name":"Taylor Weiner, Amaro","last_name":"Taylor Weiner"},{"first_name":"Chip","full_name":"Stewart, Chip","last_name":"Stewart"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"first_name":"Jasmin","last_name":"Bahlo","full_name":"Bahlo, Jasmin"},{"full_name":"Kluth, Sandra","last_name":"Kluth","first_name":"Sandra"},{"last_name":"Božić","full_name":"Božić, Ivana","first_name":"Ivana"},{"full_name":"Lawrence, Michael","last_name":"Lawrence","first_name":"Michael"},{"first_name":"Sebastian","last_name":"Böttcher","full_name":"Böttcher, Sebastian"},{"first_name":"Scott","full_name":"Carter, Scott","last_name":"Carter"},{"full_name":"Cibulskis, Kristian","last_name":"Cibulskis","first_name":"Kristian"},{"first_name":"Daniel","full_name":"Mertens, Daniel","last_name":"Mertens"},{"full_name":"Sougnez, Carrie","last_name":"Sougnez","first_name":"Carrie"},{"full_name":"Rosenberg, Mara","last_name":"Rosenberg","first_name":"Mara"},{"last_name":"Hess","full_name":"Hess, Julian","first_name":"Julian"},{"last_name":"Edelmann","full_name":"Edelmann, Jennifer","first_name":"Jennifer"},{"first_name":"Sabrina","full_name":"Kless, Sabrina","last_name":"Kless"},{"first_name":"Michael","full_name":"Kneba, Michael","last_name":"Kneba"},{"first_name":"Matthias","last_name":"Ritgen","full_name":"Ritgen, Matthias"},{"full_name":"Fink, Anna","last_name":"Fink","first_name":"Anna"},{"first_name":"Kirsten","full_name":"Fischer, Kirsten","last_name":"Fischer"},{"first_name":"Stacey","full_name":"Gabriel, Stacey","last_name":"Gabriel"},{"first_name":"Eric","last_name":"Lander","full_name":"Lander, Eric"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"},{"first_name":"Hartmut","full_name":"Döhner, Hartmut","last_name":"Döhner"},{"full_name":"Hallek, Michael","last_name":"Hallek","first_name":"Michael"},{"last_name":"Neuberg","full_name":"Neuberg, Donna","first_name":"Donna"},{"last_name":"Getz","full_name":"Getz, Gad","first_name":"Gad"},{"first_name":"Stephan","full_name":"Stilgenbauer, Stephan","last_name":"Stilgenbauer"},{"last_name":"Wu","full_name":"Wu, Catherine","first_name":"Catherine"}],"oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","publication":"Nature","day":"22","year":"2015","date_created":"2018-12-11T11:53:21Z","date_published":"2015-10-22T00:00:00Z","doi":"10.1038/nature15395","page":"525 - 530"},{"publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n∘ [291734]. This work is partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by the EU 7th Framework Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the Czech Science Foundation, grant No. 15-17564S, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","date_published":"2015-08-22T00:00:00Z","doi":"10.1007/978-3-319-22264-6_10","date_created":"2018-12-11T11:53:22Z","page":"141 - 159","day":"22","year":"2015","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"title":"Optimizing performance of continuous-time stochastic systems using timeout synthesis","publist_id":"5482","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"first_name":"L'Uboš","full_name":"Korenčiak, L'Uboš","last_name":"Korenčiak"},{"full_name":"Krčál, Jan","last_name":"Krčál","first_name":"Jan"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Řehák","full_name":"Řehák, Vojtěch","first_name":"Vojtěch"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.","ama":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159. doi:10.1007/978-3-319-22264-6_10","apa":"Brázdil, T., Korenčiak, L., Krčál, J., Novotný, P., & Řehák, V. (2015). Optimizing performance of continuous-time stochastic systems using timeout synthesis. Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-319-22264-6_10","ieee":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing performance of continuous-time stochastic systems using timeout synthesis,” vol. 9259. Springer, pp. 141–159, 2015.","short":"T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159.","chicago":"Brázdil, Tomáš, L’Uboš Korenčiak, Jan Krčál, Petr Novotný, and Vojtěch Řehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22264-6_10.","ista":"Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159."},"month":"08","intvolume":" 9259","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4777"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider parametric version of fixed-delay continuoustime Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimise expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of these parameters. To this end we identify and overcome several interesting phenomena arising in systems with fixed delays."}],"volume":9259,"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","conference":{"name":"QEST: Quantitative Evaluation of Systems","start_date":"2015-09-01","location":"Madrid, Spain","end_date":"2015-09-03"},"series_title":"Lecture Notes in Computer Science","_id":"1667","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:52:24Z"},{"_id":"1673","type":"journal_article","status":"public","date_updated":"2021-01-12T06:52:26Z","ddc":["000"],"file_date_updated":"2020-07-14T12:45:11Z","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement-that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two. "}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 471","month":"09","publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"kschuh","file_size":391466,"date_updated":"2020-07-14T12:45:11Z","file_name":"2015_rspa_Adlam.pdf","date_created":"2019-04-18T12:39:56Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6342","checksum":"e613d94d283c776322403a28aad11bdd"}],"ec_funded":1,"volume":471,"issue":"2181","article_number":"20150114","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"citation":{"mla":"Adlam, Ben, et al. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114.","short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).","ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181. Royal Society of London, 2015.","apa":"Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2015.0114","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181). doi:10.1098/rspa.2015.0114","chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.","ista":"Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Adlam, Ben","last_name":"Adlam","first_name":"Ben"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"publist_id":"5477","title":"Amplifiers of selection","acknowledgement":"K.C. gratefully acknowledges support from ERC Start grant no. (279307: Graph Games), Austrian Science Fund (FWF) grant no. P23499-N23, and FWF NFN grant no. S11407-N23 (RiSE). ","oa":1,"publisher":"Royal Society of London","quality_controlled":"1","year":"2015","has_accepted_license":"1","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","day":"08","date_created":"2018-12-11T11:53:24Z","date_published":"2015-09-08T00:00:00Z","doi":"10.1098/rspa.2015.0114"},{"author":[{"full_name":"Svoreňová, Mária","last_name":"Svoreňová","first_name":"Mária"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Kevin","last_name":"Leahy","full_name":"Leahy, Kevin"},{"first_name":"Hasan","last_name":"Eniser","full_name":"Eniser, Hasan"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Ivana","full_name":"Cěrná, Ivana","last_name":"Cěrná"},{"full_name":"Belta, Cǎlin","last_name":"Belta","first_name":"Cǎlin"}],"publist_id":"5453","department":[{"_id":"KrCh"}],"title":"Temporal logic motion planning using POMDPs with parity objectives: Case study paper","citation":{"mla":"Svoreňová, Mária, et al. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–38, doi:10.1145/2728606.2728617.","short":"M. Svoreňová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238.","ieee":"M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.","ama":"Svoreňová M, Chmelik M, Leahy K, et al. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:233-238. doi:10.1145/2728606.2728617","apa":"Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617","chicago":"Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.","ista":"Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238."},"date_updated":"2021-01-12T06:52:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","end_date":"2015-04-16","location":"Seattle, WA, United States","start_date":"2015-04-14"},"type":"conference","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","_id":"1691","page":"233 - 238","ec_funded":1,"date_created":"2018-12-11T11:53:29Z","doi":"10.1145/2728606.2728617","date_published":"2015-04-14T00:00:00Z","year":"2015","publication_status":"published","language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","day":"14","scopus_import":1,"publisher":"ACM","month":"04","abstract":[{"text":"We consider a case study of the problem of deploying an autonomous air vehicle in a partially observable, dynamic, indoor environment from a specification given as a linear temporal logic (LTL) formula over regions of interest. We model the motion and sensing capabilities of the vehicle as a partially observable Markov decision process (POMDP). We adapt recent results for solving POMDPs with parity objectives to generate a control policy. We also extend the existing framework with a policy minimization technique to obtain a better implementable policy, while preserving its correctness. The proposed techniques are illustrated in an experimental setup involving an autonomous quadrotor performing surveillance in a dynamic environment.","lang":"eng"}],"oa_version":"None"},{"_id":"1694","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":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"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"}],"status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:34Z","citation":{"ista":"Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2015.2404612.","ama":"Chatterjee K, Prabhu V. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 2015;60(9):2291-2306. doi:10.1109/TAC.2015.2404612","apa":"Chatterjee, K., & Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2015.2404612","short":"K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015) 2291–2306.","ieee":"K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” IEEE Transactions on Automatic Control, vol. 60, no. 9. IEEE, pp. 2291–2306, 2015.","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control, vol. 60, no. 9, IEEE, 2015, pp. 2291–306, doi:10.1109/TAC.2015.2404612."},"department":[{"_id":"KrCh"}],"title":"Quantitative temporal simulation and refinement distances for timed systems","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Prabhu","full_name":"Prabhu, Vinayak","first_name":"Vinayak"}],"publist_id":"5450","oa_version":"None","abstract":[{"text":"\r\nWe introduce quantitative timed refinement and timed simulation (directed) metrics, incorporating zenoness checks, for timed systems. These metrics assign positive real numbers which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximal timing mismatch that can arise, (2) the “steady-state” maximal timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation distances to within any desired degree of accuracy. In order to compute the values of the quantitative simulation distances, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite-state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives in graph games, and then use these algorithms to compute the values of the timed simulation distances over timed automata.\r\n","lang":"eng"}],"intvolume":" 60","month":"02","quality_controlled":"1","publisher":"IEEE","scopus_import":1,"language":[{"iso":"eng"}],"publication":"IEEE Transactions on Automatic Control","day":"24","publication_status":"published","year":"2015","ec_funded":1,"date_created":"2018-12-11T11:53:30Z","date_published":"2015-02-24T00:00:00Z","volume":60,"issue":"9","doi":"10.1109/TAC.2015.2404612","page":"2291 - 2306"},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","oa":1,"quality_controlled":"1","publisher":"Elsevier","publication":"Information and Computation","day":"01","year":"2015","date_created":"2018-12-11T11:53:32Z","doi":"10.1016/j.ic.2015.03.001","date_published":"2015-04-01T00:00:00Z","page":"177 - 196","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"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"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.001","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 2015;241(4):177-196. doi:10.1016/j.ic.2015.03.001","mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:10.1016/j.ic.2015.03.001.","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.","chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001."},"title":"The complexity of multi-mean-payoff and multi-energy games","publist_id":"5443","author":[{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Alexander","full_name":"Rabinovich, Alexander","last_name":"Rabinovich"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"oa_version":"Preprint","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete.","lang":"eng"}],"intvolume":" 241","month":"04","main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"issue":"4","volume":241,"_id":"1698","status":"public","type":"journal_article","date_updated":"2021-01-12T06:52:36Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"acknowledgement":" The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","quality_controlled":"1","publisher":"AAAI Press","oa":1,"year":"2015","day":"01","publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence ","page":"3496-3502","date_published":"2015-06-01T00:00:00Z","date_created":"2018-12-11T11:54:11Z","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , vol. 5, AAAI Press, 2015, pp. 3496–502.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . Vol 5. AAAI Press; 2015:3496-3502.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp. 3496–3502.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"last_name":"Kanodia","full_name":"Kanodia, Ayush","first_name":"Ayush"}],"publist_id":"5286","external_id":{"arxiv":["1411.3880"]},"title":"Optimal cost almost-sure reachability in POMDPs","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objec- tive we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the problem of approximating the optimal cost is decidable and present ap- proximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst- case running time of our algorithm is double exponential, we present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples.","lang":"eng"}],"oa_version":"Preprint","alternative_title":["Artifical Intelligence"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1411.3880","open_access":"1"}],"month":"06","intvolume":" 5","publication_status":"published","language":[{"iso":"eng"}],"volume":5,"related_material":{"record":[{"status":"public","id":"1529","relation":"later_version"}]},"ec_funded":1,"_id":"1820","type":"conference","conference":{"end_date":"2015-01-30","location":"Austin, TX, USA","start_date":"2015-01-25","name":"IAAI: Innovative Applications of Artificial Intelligence"},"status":"public","date_updated":"2023-02-23T10:02:57Z","department":[{"_id":"KrCh"}]},{"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"last_name":"Könighofer","full_name":"Könighofer, Robert","first_name":"Robert"}],"publist_id":"5264","title":"Assume-guarantee synthesis for concurrent reactive programs with partial information","citation":{"mla":"Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32, doi:10.1007/978-3-662-46681-0_50.","apa":"Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50","ama":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis for concurrent reactive programs with partial information. In: Vol 9035. Springer; 2015:517-532. doi:10.1007/978-3-662-46681-0_50","short":"R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.","ieee":"R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.","ista":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Springer","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by the European Commission through an ERC Start grant (279307: Graph Games) and project STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR 14 AVACS and project ASDPS(JA 2357/2-1).","page":"517 - 532","date_created":"2018-12-11T11:54:17Z","doi":"10.1007/978-3-662-46681-0_50","date_published":"2015-01-01T00:00:00Z","year":"2015","day":"01","conference":{"start_date":"2015-04-11","end_date":"2015-04-18","location":"London, United Kingdom","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"type":"conference","status":"public","_id":"1838","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:53:32Z","main_file_link":[{"url":"http://arxiv.org/abs/1411.4604","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 9035","month":"01","abstract":[{"text":"Synthesis of program parts is particularly useful for concurrent systems. However, most approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts, but thus far has been limited to the perfect information setting. This means that local variables cannot be hidden from other processes, which renders synthesis results cumbersome or even impossible to realize.We resolve this shortcoming by defining AGS under partial information. We analyze the complexity and decidability in different settings, showing that the problem has a high worstcase complexity and is undecidable in many interesting cases. Based on these observations, we present a pragmatic algorithm based on bounded synthesis, and demonstrate its practical applicability on several examples.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"volume":9035,"publication_status":"published","language":[{"iso":"eng"}]},{"page":"181 - 187","doi":"10.1007/978-3-662-46681-0_12","date_published":"2015-01-01T00:00:00Z","date_created":"2018-12-11T11:54:18Z","year":"2015","day":"01","publisher":"Springer","quality_controlled":"1","oa":1,"publist_id":"5263","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"}],"title":"Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.","mla":"Brázdil, Tomáš, et al. Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87, doi:10.1007/978-3-662-46681-0_12.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.","ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:10.1007/978-3-662-46681-0_12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"volume":9035,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1501.03093","open_access":"1"}],"month":"01","intvolume":" 9035","abstract":[{"text":"We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs) with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses the existing interface and simulator of PRISM. Our tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives, and also provides features such as (i) generating strategies and exploring them for simulation, and checking them with respect to other properties; and (ii) generating an approximate Pareto curve for two mean-payoff objectives. In addition, we present a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives under memoryless strategies.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_updated":"2020-01-21T13:18:52Z","type":"conference","conference":{"location":"London, United Kingdom","end_date":"2015-04-18","start_date":"2015-04-11","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"status":"public","_id":"1839","series_title":"Lecture Notes in Computer Science"},{"date_created":"2018-12-11T11:54:20Z","doi":"10.1007/s00236-015-0215-4","date_published":"2015-04-01T00:00:00Z","page":"269 - 297","publication":"Acta Informatica","day":"01","year":"2015","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer","title":"Refinement checking on parametric modal transition systems","article_processing_charge":"No","author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"first_name":"Kim","last_name":"Larsen","full_name":"Larsen, Kim"},{"full_name":"Möller, Mikael","last_name":"Möller","first_name":"Mikael"},{"full_name":"Sickert, Salomon","last_name":"Sickert","first_name":"Salomon"},{"first_name":"Jiří","last_name":"Srba","full_name":"Srba, Jiří"}],"publist_id":"5255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4","ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297. doi:10.1007/s00236-015-0215-4","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4."},"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"ec_funded":1,"issue":"2-3","volume":52,"language":[{"iso":"eng"}],"file":[{"file_id":"7854","checksum":"fb4037ddc4fc05f33080dd3547ede350","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2015_ActaInfo_Benes.pdf","date_created":"2020-05-15T08:57:44Z","creator":"dernst","file_size":488482,"date_updated":"2020-07-14T12:45:19Z"}],"publication_status":"published","intvolume":" 52","month":"04","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS."}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:19Z","ddc":["000"],"date_updated":"2021-01-12T06:53:35Z","status":"public","article_type":"original","type":"journal_article","_id":"1846"},{"intvolume":" 69","month":"02","scopus_import":"1","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"We consider mating strategies for females who search for males sequentially during a season of limited length. We show that the best strategy rejects a given male type if encountered before a time-threshold but accepts him after. For frequency-independent benefits, we obtain the optimal time-thresholds explicitly for both discrete and continuous distributions of males, and allow for mistakes being made in assessing the correct male type. When the benefits are indirect (genes for the offspring) and the population is under frequency-dependent ecological selection, the benefits depend on the mating strategy of other females as well. This case is particularly relevant to speciation models that seek to explore the stability of reproductive isolation by assortative mating under frequency-dependent ecological selection. We show that the indirect benefits are to be quantified by the reproductive values of couples, and describe how the evolutionarily stable time-thresholds can be found. We conclude with an example based on the Levene model, in which we analyze the evolutionarily stable assortative mating strategies and the strength of reproductive isolation provided by them."}],"ec_funded":1,"volume":69,"issue":"4","language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-07-14T12:45:19Z","file_size":967214,"date_created":"2020-05-15T09:05:34Z","file_name":"2015_Evolution_Priklopil.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798","file_id":"7855"}],"publication_status":"published","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"status":"public","type":"journal_article","article_type":"original","_id":"1851","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:19Z","ddc":["570"],"date_updated":"2022-06-07T10:52:37Z","oa":1,"publisher":"Wiley","quality_controlled":"1","date_created":"2018-12-11T11:54:21Z","doi":"10.1111/evo.12618","date_published":"2015-02-09T00:00:00Z","page":"1015 - 1026","publication":"Evolution","day":"09","year":"2015","has_accepted_license":"1","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","article_processing_charge":"No","external_id":{"pmid":["25662095"]},"publist_id":"5249","author":[{"first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","last_name":"Priklopil","full_name":"Priklopil, Tadeas"},{"last_name":"Kisdi","full_name":"Kisdi, Eva","first_name":"Eva"},{"first_name":"Mats","last_name":"Gyllenberg","full_name":"Gyllenberg, Mats"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.","ama":"Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618","apa":"Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","ieee":"T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015.","chicago":"Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618.","ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026."}},{"date_created":"2018-12-11T11:54:28Z","volume":221,"doi":"10.1016/j.artint.2014.12.009","date_published":"2015-04-01T00:00:00Z","page":"46 - 72","publication":"Artificial Intelligence","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2015","intvolume":" 221","month":"04","main_file_link":[{"url":"https://arxiv.org/abs/1408.2058","open_access":"1"}],"oa":1,"publisher":"Elsevier","scopus_import":1,"quality_controlled":"1","oa_version":"Preprint","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated with every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) a quantitative constraint defines the set of paths where the payoff is at least a given threshold λ1ε(0,1]; and (ii) a qualitative constraint which is a special case of the quantitative constraint with λ1=1. We consider the computation of the almost-sure winning set, where the controller needs to ensure that the path constraint is satisfied with probability 1. Our main results for qualitative path constraints are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative path constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We also present a prototype implementation of our EXPTIME algorithm and experimental results on several examples.","lang":"eng"}],"department":[{"_id":"KrCh"}],"title":"POMDPs under probabilistic semantics","external_id":{"arxiv":["1408.2058"]},"publist_id":"5224","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:53:46Z","citation":{"chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009.","ista":"Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence, vol. 221, Elsevier, 2015, pp. 46–72, doi:10.1016/j.artint.2014.12.009.","apa":"Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2014.12.009","ama":"Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. Artificial Intelligence. 2015;221:46-72. doi:10.1016/j.artint.2014.12.009","short":"K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.","ieee":"K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221. Elsevier, pp. 46–72, 2015."},"status":"public","type":"journal_article","_id":"1873"},{"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"author":[{"last_name":"Fahrenberg","full_name":"Fahrenberg, Uli","first_name":"Uli"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Axel","full_name":"Legay, Axel","last_name":"Legay"},{"full_name":"Traonouez, Louis","last_name":"Traonouez","first_name":"Louis"}],"publist_id":"5216","title":"Compositionality for quantitative specifications","citation":{"mla":"Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.","ieee":"U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.","apa":"Fahrenberg, U., Kretinsky, J., Legay, A., & Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. https://doi.org/10.1007/978-3-319-15317-9_19","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:10.1007/978-3-319-15317-9_19","chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. https://doi.org/10.1007/978-3-319-15317-9_19.","ista":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.","page":"306 - 324","date_created":"2018-12-11T11:54:31Z","date_published":"2015-01-30T00:00:00Z","doi":"10.1007/978-3-319-15317-9_19","year":"2015","day":"30","conference":{"start_date":"2014-09-10","end_date":"2014-09-12","location":"Bertinoro, Italy","name":"FACS: Formal Aspects of Component Software"},"type":"conference","status":"public","_id":"1882","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T06:53:49Z","main_file_link":[{"url":"http://arxiv.org/abs/1408.1256","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 8997","month":"01","abstract":[{"lang":"eng","text":"We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations."}],"oa_version":"Preprint","ec_funded":1,"volume":8997,"publication_status":"published","language":[{"iso":"eng"}]},{"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.","chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.001.","short":"B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","apa":"Bérard, B., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.001","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. Information Processing Letters. 2015;115(1):52-59. doi:10.1016/j.ipl.2014.09.001","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:10.1016/j.ipl.2014.09.001."},"title":"Probabilistic opacity for Markov decision processes","author":[{"last_name":"Bérard","full_name":"Bérard, Béatrice","first_name":"Béatrice"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Nathalie","last_name":"Sznajder","full_name":"Sznajder, Nathalie"}],"publist_id":"5025","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"01","publication":" Information Processing Letters","year":"2015","date_published":"2015-01-01T00:00:00Z","doi":"10.1016/j.ipl.2014.09.001","date_created":"2018-12-11T11:55:20Z","page":"52 - 59","_id":"2034","status":"public","type":"journal_article","date_updated":"2021-01-12T06:54:52Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","abstract":[{"text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers.","lang":"eng"}],"month":"01","intvolume":" 115","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1","volume":115,"ec_funded":1},{"acknowledgement":"The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n","oa":1,"quality_controlled":"1","publisher":"Elsevier","publication":"Theoretical Computer Science","day":"30","year":"2015","date_created":"2018-12-11T11:52:56Z","doi":"10.1016/j.tcs.2015.01.050","date_published":"2015-03-30T00:00:00Z","page":"71 - 89","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.","apa":"Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050","ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050","short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.","ista":"Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89."},"title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","external_id":{"arxiv":["1202.4175"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Joglekar","full_name":"Joglekar, Manas","first_name":"Manas"},{"full_name":"Shah, Nisarg","last_name":"Shah","first_name":"Nisarg"}],"publist_id":"5571","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small."}],"intvolume":" 573","month":"03","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.4175"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"2715","status":"public"}]},"volume":573,"issue":"3","_id":"1598","status":"public","type":"journal_article","date_updated":"2023-02-23T10:55:03Z","department":[{"_id":"KrCh"}]},{"citation":{"apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.06.003","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. Information and Computation. 2015;245(12):3-16. doi:10.1016/j.ic.2015.06.003","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” Information and Computation, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Gimbert","full_name":"Gimbert, Hugo","first_name":"Hugo"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"5395","title":"Randomness for free","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"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2015","publication":"Information and Computation","day":"01","page":"3 - 16","date_created":"2018-12-11T11:53:42Z","doi":"10.1016/j.ic.2015.06.003","date_published":"2015-12-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Elsevier","date_updated":"2023-02-23T11:45:42Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"1731","type":"journal_article","status":"public","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"issue":"12","related_material":{"record":[{"relation":"earlier_version","id":"3856","status":"public"}]},"volume":245,"abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1006.0673","open_access":"1"}],"scopus_import":1,"intvolume":" 245","month":"12"},{"intvolume":" 62","month":"02","main_file_link":[{"url":"https://arxiv.org/abs/1004.0739","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε > 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way."}],"ec_funded":1,"volume":62,"related_material":{"record":[{"status":"public","id":"3864","relation":"earlier_version"}]},"issue":"1","language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"1856","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T11:46:04Z","oa":1,"quality_controlled":"1","publisher":"ACM","date_created":"2018-12-11T11:54:23Z","doi":"10.1145/2699430","date_published":"2015-02-01T00:00:00Z","publication":"Journal of the ACM","day":"01","year":"2015","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"9","title":"Measuring and synthesizing systems in probabilistic environments","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"publist_id":"5244","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM. https://doi.org/10.1145/2699430","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 2015;62(1). doi:10.1145/2699430"}},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"article_number":"7174888","title":"Improved algorithms for one-pair and k-pair Streett objectives","article_processing_charge":"No","publist_id":"5489","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika","first_name":"Veronika"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34."},"oa":1,"quality_controlled":"1","publisher":"IEEE","acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","date_created":"2018-12-11T11:53:19Z","date_published":"2015-07-01T00:00:00Z","doi":"10.1109/LICS.2015.34","publication":"Proceedings - Symposium on Logic in Computer Science","day":"01","year":"2015","status":"public","conference":{"start_date":"2015-07-06","end_date":"2015-07-10","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"type":"conference","_id":"1661","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:20:05Z","month":"07","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"scopus_import":"1","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years."}],"ec_funded":1,"volume":"2015-July","related_material":{"record":[{"status":"public","id":"464","relation":"later_version"}]},"language":[{"iso":"eng"}],"publication_status":"published"},{"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T10:36:02Z","status":"public","type":"journal_article","_id":"523","issue":"6","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2279"}]},"volume":242,"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"03","intvolume":" 242","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.4248"}],"oa_version":"Preprint","abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"title":"Looking at mean-payoff and total-payoff through windows","publist_id":"7296","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"first_name":"Mickael","full_name":"Randour, Mickael","last_name":"Randour"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:10.1016/j.ic.2015.03.010.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010","apa":"Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.010","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52."},"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1016/j.ic.2015.03.010","date_published":"2015-03-24T00:00:00Z","date_created":"2018-12-11T11:46:57Z","page":"25 - 52","day":"24","publication":"Information and Computation","year":"2015","publisher":"Elsevier","quality_controlled":"1","oa":1},{"abstract":[{"text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1409.5306","open_access":"1"}],"scopus_import":1,"intvolume":" 242","month":"10","publication_status":"published","language":[{"iso":"eng"}],"volume":242,"related_material":{"record":[{"relation":"earlier_version","id":"5403","status":"public"}]},"issue":"6","_id":"524","type":"journal_article","status":"public","date_updated":"2023-02-23T12:24:45Z","department":[{"_id":"KrCh"}],"oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2015","publication":"Information and Computation","day":"11","page":"2 - 24","date_created":"2018-12-11T11:46:57Z","doi":"10.1016/j.ic.2015.03.009","date_published":"2015-10-11T00:00:00Z","citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. Information and Computation. 2015;242(6):2-24. doi:10.1016/j.ic.2015.03.009","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.009","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1409.5306"]},"publist_id":"7295","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"title":"Qualitative analysis of concurrent mean payoff games"},{"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:25:07Z","status":"public","conference":{"start_date":"2015-01-25","location":"Austin, TX, USA","end_date":"2015-01-30","name":"AAAI: Conference on Artificial Intelligence"},"type":"conference","_id":"1481","ec_funded":1,"volume":2,"related_material":{"record":[{"id":"5410","status":"public","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 2","month":"01","main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300","open_access":"1"}],"scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased. "}],"title":"Automatic generation of alternative starting positions for simple traditional board games","article_processing_charge":"No","author":[{"last_name":"Ahmed","full_name":"Ahmed, Umair","first_name":"Umair"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gulwani","full_name":"Gulwani, Sumit","first_name":"Sumit"}],"publist_id":"5713","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.","ama":"Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.","apa":"Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752."},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T11:52:16Z","date_published":"2015-01-01T00:00:00Z","page":"745 - 752","publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","day":"01","year":"2015","oa":1,"quality_controlled":"1","publisher":"AAAI Press","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. doi:10.1109/ICRA.2015.7139019","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019."},"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","external_id":{"arxiv":["1409.3360"]},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"full_name":"Gupta, Raghav","last_name":"Gupta","first_name":"Raghav"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}],"publist_id":"5394","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","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"}],"day":"01","year":"2015","date_created":"2018-12-11T11:53:43Z","doi":"10.1109/ICRA.2015.7139019","date_published":"2015-01-01T00:00:00Z","page":"325 - 330","oa":1,"publisher":"IEEE","quality_controlled":"1","date_updated":"2023-02-23T12:25:52Z","department":[{"_id":"KrCh"}],"_id":"1732","status":"public","conference":{"location":"Seattle, WA, United States","end_date":"2015-05-30","start_date":"2015-05-26","name":"ICRA: International Conference on Robotics and Automation"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"id":"5424","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5426"}]},"oa_version":"Preprint","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.","lang":"eng"}],"month":"01","main_file_link":[{"url":"http://arxiv.org/abs/1409.3360","open_access":"1"}],"scopus_import":1},{"_id":"5431","pubrep_id":"322","status":"public","type":"technical_report","ddc":["005","519"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:02:13Z","citation":{"mla":"Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p."},"title":"The patience of concurrent stochastic games with safety and reachability objectives","file_date_updated":"2020-07-14T12:46:53Z","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Kristoffer","last_name":"Hansen","full_name":"Hansen, Kristoffer"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"month":"02","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2015-322-v1+1_safetygames.pdf","date_created":"2018-12-12T11:53:31Z","file_size":661015,"date_updated":"2020-07-14T12:46:53Z","creator":"system","file_id":"5491","checksum":"bfb858262c30445b8e472c40069178a2","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"day":"19","year":"2015","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:17Z","date_published":"2015-02-19T00:00:00Z","doi":"10.15479/AT:IST-2015-322-v1-1","page":"25"},{"related_material":{"record":[{"status":"public","id":"466","relation":"later_version"},{"relation":"earlier_version","id":"5429","status":"public"},{"id":"5435","status":"public","relation":"earlier_version"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"07","scopus_import":1,"alternative_title":["LICS"],"oa_version":"None","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T12:26:16Z","status":"public","type":"conference","conference":{"start_date":"2015-07-06","end_date":"2015-07-10","location":"Kyoto, Japan","name":"LICS: Logic in Computer Science"},"series_title":"LICS","_id":"1657","date_published":"2015-07-01T00:00:00Z","doi":"10.1109/LICS.2015.32","date_created":"2018-12-11T11:53:18Z","page":"244 - 256","day":"01","year":"2015","quality_controlled":"1","publisher":"IEEE","acknowledgement":"A Technical Report of this paper is available at: https://repository.ist.ac.at/327\r\n","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","publist_id":"5493","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Komárková","full_name":"Komárková, Zuzana","first_name":"Zuzana"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.","apa":"Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256."},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}]},{"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"7174926","title":"Nested weighted automata","external_id":{"arxiv":["1606.03598"]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5494","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.72","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015, doi:10.1109/LICS.2015.72.","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72."},"publisher":"IEEE","quality_controlled":"1","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available at: \r\nhttps://repository.ist.ac.at/331/\r\n","date_created":"2018-12-11T11:53:17Z","doi":"10.1109/LICS.2015.72","date_published":"2015-07-31T00:00:00Z","publication":"Proceedings - Symposium on Logic in Computer Science","day":"31","year":"2015","status":"public","conference":{"name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"type":"conference","_id":"1656","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T12:26:19Z","month":"07","scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"ec_funded":1,"volume":"2015-July","related_material":{"record":[{"id":"467","status":"public","relation":"later_version"},{"relation":"earlier_version","id":"5415","status":"public"},{"relation":"earlier_version","id":"5436","status":"public"}]},"language":[{"iso":"eng"}],"publication_status":"published"},{"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"01","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"oa_version":"Published Version","page":"41","related_material":{"record":[{"relation":"later_version","id":"1657","status":"public"},{"relation":"later_version","status":"public","id":"466"},{"status":"public","id":"5435","relation":"later_version"}]},"doi":"10.15479/AT:IST-2015-318-v1-1","date_published":"2015-01-12T00:00:00Z","date_created":"2018-12-12T11:39:17Z","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2015","publication_status":"published","file":[{"file_size":689863,"date_updated":"2020-07-14T12:46:52Z","creator":"system","file_name":"IST-2015-318-v1+1_main.pdf","date_created":"2018-12-12T11:54:11Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5533","checksum":"e4869a584567c506349abda9c8ec7db3"}],"day":"12","language":[{"iso":"eng"}],"type":"technical_report","status":"public","pubrep_id":"318","_id":"5429","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Zuzana","full_name":"Komarkova, Zuzana","last_name":"Komarkova"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","file_date_updated":"2020-07-14T12:46:52Z","date_updated":"2023-02-23T12:26:16Z","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1","ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1"},"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:26:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1","ama":"Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p."},"department":[{"_id":"KrCh"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","file_date_updated":"2020-07-14T12:46:53Z","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Zuzana","last_name":"Komarkova","full_name":"Komarkova, Zuzana"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"_id":"5435","pubrep_id":"327","status":"public","type":"technical_report","language":[{"iso":"eng"}],"file":[{"checksum":"75284adec80baabdfe71ff9ebbc27445","file_id":"5525","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T11:54:03Z","file_name":"IST-2015-318-v2+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:53Z","file_size":717630}],"day":"23","publication_status":"published","year":"2015","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:19Z","date_published":"2015-02-23T00:00:00Z","doi":"10.15479/AT:IST-2015-318-v2-1","related_material":{"record":[{"status":"public","id":"1657","relation":"later_version"},{"relation":"later_version","id":"466","status":"public"},{"id":"5429","status":"public","relation":"earlier_version"}]},"page":"51","oa_version":"Published Version","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"month":"02","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"]},{"date_updated":"2023-02-23T12:25:21Z","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-170-v2-2","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Nested weighted automata","file_date_updated":"2020-07-14T12:46:54Z","_id":"5436","type":"technical_report","status":"public","pubrep_id":"331","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2015","file":[{"date_created":"2018-12-12T11:54:19Z","file_name":"IST-2015-170-v2+2_report.pdf","creator":"system","date_updated":"2020-07-14T12:46:54Z","file_size":569991,"checksum":"3c402f47d3669c28d04d1af405a08e3f","file_id":"5541","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"day":"24","language":[{"iso":"eng"}],"page":"29","date_published":"2015-04-24T00:00:00Z","doi":"10.15479/AT:IST-2015-170-v2-2","related_material":{"record":[{"id":"1656","status":"public","relation":"later_version"},{"status":"public","id":"467","relation":"later_version"},{"relation":"earlier_version","status":"public","id":"5415"}]},"date_created":"2018-12-12T11:39:19Z","abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"04"},{"quality_controlled":"1","publisher":"Springer Nature","oa":1,"year":"2015","day":"01","publication":"42nd International Colloquium","page":"121 - 133","doi":"10.1007/978-3-662-47666-6_10","date_published":"2015-07-01T00:00:00Z","date_created":"2018-12-11T11:53:01Z","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_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":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:121-133. doi:10.1007/978-3-662-47666-6_10","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_10","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"publist_id":"5556","external_id":{"arxiv":["1504.08259"]},"article_processing_charge":"No","title":"Edit distance for pushdown automata","abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k."}],"oa_version":"None","scopus_import":"1","alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/1504.08259","open_access":"1"}],"month":"07","intvolume":" 9135","publication_identifier":{"isbn":["978-3-662-47665-9"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"465","relation":"later_version"},{"relation":"earlier_version","status":"public","id":"5438"}]},"volume":9135,"issue":"Part II","ec_funded":1,"_id":"1610","type":"conference","conference":{"end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-07-06","name":"ICALP: Automata, Languages and Programming"},"status":"public","pubrep_id":"321","date_updated":"2023-02-23T12:26:24Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"status":"public","pubrep_id":"333","type":"technical_report","_id":"5437","file_date_updated":"2020-07-14T12:46:54Z","department":[{"_id":"KrCh"}],"title":"Faster algorithms for quantitative verification in constant treewidth graphs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2023-02-23T12:26:05Z","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015."},"month":"04","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"oa_version":"Published Version","abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. \r\nThe algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main theoretical results are as follows.\r\nFirst, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when the output is $\\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$ and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. ","lang":"eng"}],"date_published":"2015-04-27T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"1607","status":"public"},{"status":"public","id":"5430","relation":"earlier_version"}]},"doi":"10.15479/AT:IST-2015-330-v2-1","date_created":"2018-12-12T11:39:19Z","page":"27","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"f5917c20f84018b362d385c000a2e123","file_id":"5473","creator":"system","date_updated":"2020-07-14T12:46:54Z","file_size":1072137,"date_created":"2018-12-12T11:53:12Z","file_name":"IST-2015-330-v2+1_main.pdf"}],"day":"27","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2015","publication_status":"published"},{"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1."},"date_updated":"2023-02-23T12:26:22Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"file_date_updated":"2020-07-14T12:46:52Z","department":[{"_id":"KrCh"}],"title":"Faster algorithms for quantitative verification in constant treewidth graphs","_id":"5430","type":"technical_report","pubrep_id":"319","status":"public","year":"2015","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"file":[{"file_id":"5482","checksum":"62c6ea01e342553dcafb88a070fb1ad5","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2015-319-v1+1_long.pdf","date_created":"2018-12-12T11:53:21Z","file_size":1089651,"date_updated":"2020-07-14T12:46:52Z","creator":"system"}],"day":"10","page":"31","date_created":"2018-12-12T11:39:17Z","date_published":"2015-02-10T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1607"},{"id":"5437","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2015-319-v1-1","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"oa_version":"Published Version","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"02"},{"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:20:08Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p."},"file_date_updated":"2020-07-14T12:46:55Z","title":"Edit distance for pushdown automata","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"_id":"5438","pubrep_id":"334","status":"public","type":"technical_report","language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:46:55Z","file_size":422573,"creator":"system","date_created":"2018-12-12T11:53:56Z","file_name":"IST-2015-334-v1+1_report.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5518","checksum":"8a5f2d77560e552af87eb1982437a43b"}],"day":"05","year":"2015","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:20Z","doi":"10.15479/AT:IST-2015-334-v1-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"1610"},{"relation":"later_version","status":"public","id":"465"}]},"date_published":"2015-05-05T00:00:00Z","page":"15","oa_version":"Published Version","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. ","lang":"eng"}],"month":"05","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"]},{"department":[{"_id":"KrCh"}],"title":"The complexity of evolutionary games on graphs","file_date_updated":"2020-07-14T12:46:56Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"ddc":["005","576"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p."},"date_updated":"2023-02-23T12:26:10Z","status":"public","pubrep_id":"338","type":"technical_report","_id":"5440","related_material":{"record":[{"relation":"earlier_version","id":"5421","status":"public"},{"status":"public","id":"5432","relation":"earlier_version"}]},"date_published":"2015-06-16T00:00:00Z","doi":"10.15479/AT:IST-2015-323-v2-2","date_created":"2018-12-12T11:39:21Z","page":"18","day":"16","file":[{"file_name":"IST-2015-323-v2+2_main.pdf","date_created":"2018-12-12T11:53:23Z","file_size":466161,"date_updated":"2020-07-14T12:46:56Z","creator":"system","checksum":"66aace7d367032af97c15e35c9be9636","file_id":"5484","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2015","month":"06","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive."}]},{"language":[{"iso":"eng"}],"day":"19","file":[{"checksum":"546c1b291d545e7b24aaaf4199dac671","file_id":"5519","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-323-v1+1_main.pdf","date_created":"2018-12-12T11:53:57Z","creator":"system","file_size":576347,"date_updated":"2020-07-14T12:46:53Z"}],"publication_status":"published","year":"2015","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:18Z","date_published":"2015-02-19T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","id":"5421","status":"public"},{"relation":"later_version","id":"5440","status":"public"}]},"doi":"10.15479/AT:IST-2015-323-v1-1","page":"29","oa_version":"Published Version","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n","lang":"eng"}],"month":"02","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"ddc":["005","576"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1."},"date_updated":"2023-02-23T12:26:33Z","title":"The complexity of evolutionary games on graphs","file_date_updated":"2020-07-14T12:46:53Z","department":[{"_id":"KrCh"}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"_id":"5432","pubrep_id":"323","status":"public","type":"technical_report"},{"date_created":"2018-12-12T11:39:22Z","doi":"10.15479/AT:IST-2015-399-v1-1","date_published":"2015-12-30T00:00:00Z","page":"25","language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:46:58Z","file_size":3533200,"date_created":"2018-12-12T11:53:24Z","file_name":"IST-2015-399-v1+1_treeomics.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c47d33bdda06181753c0af36f16e7b5d","file_id":"5485"}],"day":"30","year":"2015","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"12","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"text":"A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal.","lang":"eng"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:58Z","title":"Reconstructing robust phylogenies of metastatic cancers","author":[{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353"},{"first_name":"Alvin","last_name":"Makohon-Moore","full_name":"Makohon-Moore, Alvin"},{"first_name":"Jeffrey","full_name":"Gerold, Jeffrey","last_name":"Gerold"},{"full_name":"Bozic, Ivana","last_name":"Bozic","first_name":"Ivana"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Iacobuzio-Donahue, Christine","last_name":"Iacobuzio-Donahue","first_name":"Christine"},{"last_name":"Vogelstein","full_name":"Vogelstein, Bert","first_name":"Bert"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"ddc":["000","576"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:05:07Z","citation":{"mla":"Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.","ieee":"J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.","short":"J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.","apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1","ama":"Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1","chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.","ista":"Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p."},"pubrep_id":"399","status":"public","type":"technical_report","_id":"5444"},{"oa_version":"Published Version","abstract":[{"text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach.","lang":"eng"}],"month":"11","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"file":[{"creator":"system","file_size":412379,"date_updated":"2020-07-14T12:46:57Z","file_name":"IST-2015-325-v2+1_main.pdf","date_created":"2018-12-12T11:53:05Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"f0fa31ad8161ed655137e94012123ef9","file_id":"5466"}],"day":"06","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2015","publication_status":"published","doi":"10.15479/AT:IST-2015-325-v2-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"1166"}]},"date_published":"2015-11-06T00:00:00Z","date_created":"2018-12-12T11:39:22Z","page":"23","_id":"5443","status":"public","pubrep_id":"362","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2023-02-21T16:24:05Z","citation":{"ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.","ama":"Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1","apa":"Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.","short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1."},"title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","file_date_updated":"2020-07-14T12:46:57Z","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Jessica","id":"378E0060-F248-11E8-B48F-1D18A9856A87","last_name":"Davies","full_name":"Davies, Jessica"}]},{"_id":"1709","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-07T11:40:43Z","department":[{"_id":"KrCh"}],"pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards and study the evolution of strategies. In biological all-pay auctions the bid of an individual corresponds to its strategy and is equivalent to its payment in the auction. The decreasingly ordered rewards are distributed according to the decreasingly ordered bids of the participating individuals. The reproductive success of an individual is proportional to its fitness given by the sum of the rewards won minus its payments. Hence, successful bidding strategies spread in the population. We find that the results for the multiple reward case are very different from the single reward case. While the mixed strategy equilibrium in the single reward case with more than two players consists of mostly low-bidding individuals, we show that the equilibrium can convert to many high-bidding individuals and a few low-bidding individuals in the multiple reward case. Some reward values lead to a specialization among the individuals where one subpopulation competes for the rewards and the other subpopulation largely avoids costly competitions. Whether the mixed strategy equilibrium is an evolutionarily stable strategy (ESS) depends on the specific values of the rewards."}],"month":"07","intvolume":" 282","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1812","volume":282,"related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 2015;282(1812). doi:10.1098/rspb.2015.1041","apa":"Reiter, J., Kanodia, A., Gupta, R., Nowak, M., & Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society. https://doi.org/10.1098/rspb.2015.1041","short":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).","ieee":"J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.","mla":"Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812, Royal Society, 2015, doi:10.1098/rspb.2015.1041.","ista":"Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).","chicago":"Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.” Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rspb.2015.1041."},"title":"Biological auctions with multiple rewards","publist_id":"5425","author":[{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353"},{"first_name":"Ayush","full_name":"Kanodia, Ayush","last_name":"Kanodia"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"pmid":["26180069"]},"article_processing_charge":"No","acknowledgement":"This work was supported by grants from the John Templeton Foundation, ERC Start Grant (279307: Graph Games), FWF NFN Grant (No S11407N23 RiSE/SHiNE), FWF Grant (No P23499N23) and a Microsoft faculty fellows award.","quality_controlled":"1","publisher":"Royal Society","oa":1,"day":"15","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","year":"2015","doi":"10.1098/rspb.2015.1041","date_published":"2015-07-15T00:00:00Z","date_created":"2018-12-11T11:53:35Z"},{"_id":"1400","type":"dissertation","status":"public","citation":{"apa":"Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science and Technology Austria.","ama":"Reiter J. The subclonal evolution of cancer. 2015.","ieee":"J. Reiter, “The subclonal evolution of cancer,” Institute of Science and Technology Austria, 2015.","short":"J. Reiter, The Subclonal Evolution of Cancer, Institute of Science and Technology Austria, 2015.","mla":"Reiter, Johannes. The Subclonal Evolution of Cancer. Institute of Science and Technology Austria, 2015.","ista":"Reiter J. 2015. The subclonal evolution of cancer. Institute of Science and Technology Austria.","chicago":"Reiter, Johannes. “The Subclonal Evolution of Cancer.” Institute of Science and Technology Austria, 2015."},"date_updated":"2023-09-07T11:40:44Z","supervisor":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5807","department":[{"_id":"KrCh"}],"title":"The subclonal evolution of cancer","abstract":[{"lang":"eng","text":"Cancer results from an uncontrolled growth of abnormal cells. Sequentially accumulated genetic and epigenetic alterations decrease cell death and increase cell replication. We used mathematical models to quantify the effect of driver gene mutations. The recently developed targeted therapies can lead to dramatic regressions. However, in solid cancers, clinical responses are often short-lived because resistant cancer cells evolve. We estimated that approximately 50 different mutations can confer resistance to a typical targeted therapeutic agent. We find that resistant cells are likely to be present in expanded subclones before the start of the treatment. The dominant strategy to prevent the evolution of resistance is combination therapy. Our analytical results suggest that in most patients, dual therapy, but not monotherapy, can result in long-term disease control. However, long-term control can only occur if there are no possible mutations in the genome that can cause cross-resistance to both drugs. Furthermore, we showed that simultaneous therapy with two drugs is much more likely to result in long-term disease control than sequential therapy with the same drugs. To improve our understanding of the underlying subclonal evolution we reconstruct the evolutionary history of a patient's cancer from next-generation sequencing data of spatially-distinct DNA samples. Using a quantitative measure of genetic relatedness, we found that pancreatic cancers and their metastases demonstrated a higher level of relatedness than that expected for any two cells randomly taken from a normal tissue. This minimal amount of genetic divergence among advanced lesions indicates that genetic heterogeneity, when quantitatively defined, is not a fundamental feature of the natural history of untreated pancreatic cancers. Our newly developed, phylogenomic tool Treeomics finds evidence for seeding patterns of metastases and can directly be used to discover rules governing the evolution of solid malignancies to transform cancer into a more predictable disease."}],"oa_version":"None","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"month":"04","degree_awarded":"PhD","year":"2015","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"day":"01","page":"183","date_created":"2018-12-11T11:51:48Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1709"},{"status":"public","id":"2000","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"2247","status":"public"},{"status":"public","id":"2816","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"2858","status":"public"},{"relation":"part_of_dissertation","id":"3157","status":"public"},{"relation":"part_of_dissertation","id":"3260","status":"public"}]},"date_published":"2015-04-01T00:00:00Z"},{"pubrep_id":"625","status":"public","conference":{"name":"CBSE: Component-Based Software Engineering ","end_date":"2015-05-08","location":"Montreal, QC, Canada","start_date":"2015-05-04"},"type":"conference","_id":"1502","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:59Z","ddc":["000"],"date_updated":"2023-09-07T11:58:33Z","month":"05","scopus_import":1,"alternative_title":["Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering "],"oa_version":"Submitted Version","abstract":[{"text":"We extend the theory of input-output conformance with operators for merge and quotient. The former is useful when testing against multiple requirements or views. The latter can be used to generate tests for patches of an already tested system. Both operators can combine systems with different action alphabets, which is usually the case when constructing complex systems and specifications from parts, for instance different views as well as newly defined functionality of a~previous version of the system.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"c6ce681035c163a158751f240cb7d389","file_id":"5303","file_size":467561,"date_updated":"2020-07-14T12:44:59Z","creator":"system","file_name":"IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf","date_created":"2018-12-12T10:17:46Z"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-3471-6"]},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Complete composition operators for IOCO-testing theory","publist_id":"5676","author":[{"first_name":"Nikola","last_name":"Beneš","full_name":"Beneš, Nikola"},{"full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition operators for IOCO-testing theory. CBSE: Component-Based Software Engineering , Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering , , 101–110.","chicago":"Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10. ACM, 2015. https://doi.org/10.1145/2737166.2737175.","short":"N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 101–110.","ieee":"N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.","apa":"Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM. https://doi.org/10.1145/2737166.2737175","ama":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175","mla":"Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory. ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175."},"oa":1,"quality_controlled":"1","publisher":"ACM","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373 (nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation, grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for Scientific Excellence.","date_created":"2018-12-11T11:52:24Z","date_published":"2015-05-01T00:00:00Z","doi":"10.1145/2737166.2737175","page":"101 - 110","day":"01","year":"2015","has_accepted_license":"1"},{"year":"2015","day":"01","publication":"Formal Methods in System Design","page":"230 - 264","doi":"10.1007/s10703-015-0235-2","date_published":"2015-10-01T00:00:00Z","date_created":"2018-12-11T11:52:23Z","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE), and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 2015;47(2):230-264. doi:10.1007/s10703-015-0235-2","apa":"Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.","short":"K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.","mla":"Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design, vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.","ista":"Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5677","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"}],"title":"CEGAR for compositional analysis of qualitative properties in Markov decision processes","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1155"}]},"issue":"2","volume":47,"ec_funded":1,"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. We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph algorithms with quadratic complexity to compute the simulation relation. We present an automated technique for assume-guarantee style reasoning for compositional analysis of two-player games by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We show a tight link between two-player games and MDPs, and as a consequence the results for games are lifted to MDPs with qualitative properties. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.0835"}],"month":"10","intvolume":" 47","date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"1501","type":"journal_article","status":"public"},{"department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T12:01:58Z","status":"public","conference":{"end_date":"2015-01-17","location":"Mumbai, India","start_date":"2015-01-15","name":"SIGPLAN: Symposium on Principles of Programming Languages"},"type":"journal_article","_id":"1602","ec_funded":1,"volume":50,"issue":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"821","status":"public"}]},"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 50","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1410.7724","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, etc. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect that we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that supportmultiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing, but can answer subsequent queries significantly faster as compared to the current best-known solutions for several important problems, such as interprocedural reachability and shortest path. We provide a prototype implementation for interprocedural reachability and intraprocedural shortest path that gives a significant speed-up on several benchmarks.","lang":"eng"}],"title":"Faster algorithms for algebraic path properties in recursive state machines with constant treewidth","external_id":{"arxiv":["1410.7724"]},"publist_id":"5565","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Prateesh","last_name":"Goyal","full_name":"Goyal, Prateesh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676979","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 2015;50(1):97-109. doi:10.1145/2676726.2676979","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices, vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 50(1), 97–109.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979."},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_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"}],"date_created":"2018-12-11T11:52:58Z","doi":"10.1145/2676726.2676979","date_published":"2015-01-01T00:00:00Z","page":"97 - 109","publication":"ACM SIGPLAN Notices","day":"01","year":"2015","oa":1,"quality_controlled":"1","publisher":"ACM","acknowledgement":"We thank anonymous reviewers for helpful comments to improve the presentation of the paper."},{"publication":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT ","day":"01","year":"2015","date_created":"2018-12-11T11:52:59Z","date_published":"2015-01-01T00:00:00Z","doi":"10.1145/2676726.2676968","page":"539 - 551","quality_controlled":"1","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015. https://doi.org/10.1145/2676726.2676968.","ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2015. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 50(1), 539–551.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1, ACM, 2015, pp. 539–51, doi:10.1145/2676726.2676968.","apa":"Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676968","ama":"Chatterjee K, Pavlogiannis A, Velner Y. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 2015;50(1):539-551. doi:10.1145/2676726.2676968","ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.","short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT 50 (2015) 539–551."},"title":"Quantitative interprocedural analysis","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"publist_id":"5563","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-3300-9"]},"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"5445","status":"public"},{"relation":"dissertation_contains","status":"public","id":"821"}]},"volume":50,"issue":"1","oa_version":"None","abstract":[{"text":"We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs.","lang":"eng"}],"intvolume":" 50","month":"01","scopus_import":1,"date_updated":"2023-09-07T12:01:59Z","department":[{"_id":"KrCh"}],"_id":"1604","pubrep_id":"523","status":"public","conference":{"name":"SIGPLAN: Symposium on Principles of Programming Languages","start_date":"2015-01-15","end_date":"2015-01-17","location":"Mumbai, India"},"type":"journal_article"},{"date_updated":"2023-09-07T12:01:59Z","department":[{"_id":"KrCh"}],"_id":"1607","status":"public","conference":{"name":"CAV: Computer Aided Verification","location":"San Francisco, CA, USA","end_date":"2015-07-24","start_date":"2015-07-18"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"id":"5430","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5437"},{"relation":"dissertation_contains","status":"public","id":"821"}]},"volume":9206,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m=O(n)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of ϵ in time O(n⋅log(n/ϵ)) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O(n⋅log(|a⋅b|))=O(n⋅log(n⋅W)), when the output is ab, as compared to the previously best known algorithm with running time O(n2⋅log(n⋅W)). Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O(n2⋅m) time and the associated decision problem can be solved in O(n⋅m) time, improving the previous known O(n3⋅m⋅log(n⋅W)) and O(n2⋅m) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O(n⋅logn) time, improving the previous known O(n4⋅log(n⋅W)) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"intvolume":" 9206","month":"07","main_file_link":[{"url":"http://arxiv.org/abs/1504.07384","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in constant treewidth graphs. In: Vol 9206. Springer; 2015:140-157. doi:10.1007/978-3-319-21690-4_9","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-21690-4_9","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9."},"title":"Faster algorithms for quantitative verification in constant treewidth graphs","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5560","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"day":"16","year":"2015","date_created":"2018-12-11T11:52:59Z","date_published":"2015-07-16T00:00:00Z","doi":"10.1007/978-3-319-21690-4_9","page":"140 - 157","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","oa":1,"quality_controlled":"1","publisher":"Springer"},{"date_created":"2018-12-11T11:53:37Z","doi":"10.1109/RTSS.2014.9","date_published":"2015-01-15T00:00:00Z","page":"118 - 127","publication":"Real-Time Systems Symposium","day":"15","year":"2015","quality_controlled":"1","publisher":"IEEE","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","article_processing_charge":"No","publist_id":"5417","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kößler","full_name":"Kößler, Alexander","first_name":"Alexander"},{"last_name":"Schmid","full_name":"Schmid, Ulrich","first_name":"Ulrich"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015. https://doi.org/10.1109/RTSS.2014.9.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In: Real-Time Systems Symposium. Vol 2015. IEEE; 2015:118-127. doi:10.1109/RTSS.2014.9","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9","mla":"Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” Real-Time Systems Symposium, vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:10.1109/RTSS.2014.9."},"issue":"January","related_material":{"record":[{"relation":"earlier_version","id":"5423","status":"public"},{"relation":"dissertation_contains","id":"821","status":"public"}]},"volume":2015,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 2015","month":"01","scopus_import":1,"oa_version":"None","abstract":[{"text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a task set and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including Dover, that have been proposed in the past, for various task sets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are task sets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application.","lang":"eng"}],"department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T12:01:59Z","status":"public","conference":{"end_date":"2014-12-05","location":"Rome, Italy","start_date":"2014-12-02","name":"RTSS: Real-Time Systems Symposium"},"type":"conference","_id":"1714"},{"abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"07","publication_status":"published","year":"2015","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2015-340-v1+1_main.pdf","date_created":"2018-12-12T11:54:09Z","creator":"system","file_size":861396,"date_updated":"2020-07-14T12:46:56Z","checksum":"df383dc62c94d7b2ea639aba088a76c6","file_id":"5531","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"day":"11","page":"24","date_created":"2018-12-12T11:39:21Z","doi":"10.15479/AT:IST-2015-340-v1-1","date_published":"2015-07-11T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1437"},{"relation":"earlier_version","status":"public","id":"5442"},{"relation":"later_version","id":"6009","status":"public"}]},"_id":"5441","type":"technical_report","pubrep_id":"340","status":"public","date_updated":"2023-09-19T14:36:19Z","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.","mla":"Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1"},"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"file_date_updated":"2020-07-14T12:46:56Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","department":[{"_id":"KrCh"}]},{"day":"14","publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","language":[{"iso":"eng"}],"year":"2015","publication_status":"published","related_material":{"record":[{"id":"1407","status":"public","relation":"later_version"}]},"date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728608","date_created":"2018-12-11T11:53:29Z","ec_funded":1,"page":"259 - 268","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study."}],"month":"04","scopus_import":1,"publisher":"ACM","main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:259-268. doi:10.1145/2728606.2728608","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268."},"date_updated":"2023-09-20T09:43:09Z","title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"first_name":"Mária","last_name":"Svoreňová","full_name":"Svoreňová, Mária"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Cěrná","full_name":"Cěrná, Ivana","first_name":"Ivana"},{"first_name":"Cǎlin","full_name":"Belta, Cǎlin","last_name":"Belta"}],"publist_id":"5456","_id":"1689","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_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","grant_number":"S11407","name":"Game Theory"}],"status":"public","type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Seattle, WA, United States","end_date":"2015-04-16","start_date":"2015-04-14"}},{"_id":"1681","status":"public","pubrep_id":"448","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2023-10-17T11:42:52Z","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:12Z","oa_version":"Published Version","abstract":[{"text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game.","lang":"eng"}],"month":"09","intvolume":" 6","scopus_import":"1","file":[{"checksum":"912e1acbaf201100f447a43e4d5958bd","file_id":"4959","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","date_created":"2018-12-12T10:12:41Z","file_size":518832,"date_updated":"2020-07-14T12:45:12Z","creator":"system"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2073-4336"]},"publication_status":"published","issue":"4","volume":6,"ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.","apa":"Priklopil, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. Games. 2015;6(4):413-437. doi:10.3390/g6040413","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413."},"title":"Evolution of decisions in population games with sequentially searching individuals","author":[{"full_name":"Priklopil, Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"publist_id":"5467","article_processing_charge":"No","quality_controlled":"1","publisher":"MDPI","oa":1,"day":"29","publication":"Games","has_accepted_license":"1","year":"2015","date_published":"2015-09-29T00:00:00Z","doi":"10.3390/g6040413","date_created":"2018-12-11T11:53:26Z","page":"413 - 437"},{"_id":"1603","conference":{"start_date":"2015-07-18","end_date":"2015-07-24","location":"San Francisco, CA, United States","name":"CAV: Computer Aided Verification"},"type":"conference","status":"public","date_updated":"2024-02-21T13:52:07Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 9206","month":"07","publication_status":"published","publication_identifier":{"eisbn":["978-3-319-21690-4"]},"language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"id":"5549","status":"public","relation":"research_paper"}]},"volume":9206,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","mla":"Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.","ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5564","author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"full_name":"Fellner, Andreas","last_name":"Fellner","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"}],"title":"Counterexample explanation by learning small strategies in Markov decision processes","acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","oa":1,"publisher":"Springer","quality_controlled":"1","year":"2015","day":"16","page":"158 - 177","date_created":"2018-12-11T11:52:58Z","date_published":"2015-07-16T00:00:00Z","doi":"10.1007/978-3-319-21690-4_10"},{"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","author":[{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Fellner, Andreas","last_name":"Fellner"}],"publist_id":"5564","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28","short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","mla":"Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:28.","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28."},"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2015-08-13T00:00:00Z","doi":"10.15479/AT:ISTA:28","date_created":"2018-12-12T12:31:29Z","day":"13","has_accepted_license":"1","year":"2015","status":"public","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"type":"research_data","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"_id":"5549","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:00Z","ddc":["004"],"date_updated":"2024-02-21T13:52:07Z","month":"08","oa_version":"Published Version","abstract":[{"text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication.","lang":"eng"}],"related_material":{"record":[{"relation":"popular_science","id":"1603","status":"public"}]},"contributor":[{"last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","ec_funded":1,"file":[{"date_updated":"2020-07-14T12:47:00Z","file_size":49557109,"creator":"system","date_created":"2018-12-12T13:02:31Z","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","content_type":"application/zip","access_level":"open_access","relation":"main_file","file_id":"5597","checksum":"b8bcb43c0893023cda66c1b69c16ac62"}],"datarep_id":"28"},{"scopus_import":"1","alternative_title":["LNCS"],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1311.4425","open_access":"1"}],"month":"01","intvolume":" 8318","abstract":[{"lang":"eng","text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token."}],"oa_version":"Preprint","volume":8318,"ec_funded":1,"publication_identifier":{"isbn":["9783642540127"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642540134"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2014-01-19","location":"San Diego, CA, United States","end_date":"2014-01-21"},"status":"public","_id":"10884","department":[{"_id":"KrCh"}],"date_updated":"2022-05-17T08:36:01Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","page":"262-281","date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_15","date_created":"2022-03-18T13:01:22Z","year":"2014","day":"30","publication":"Verification, Model Checking, and Abstract Interpretation","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"author":[{"full_name":"Aminof, Benjamin","last_name":"Aminof","first_name":"Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"full_name":"Khalimov, Ayrat","last_name":"Khalimov","first_name":"Ayrat"},{"first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha","last_name":"Rubin"}],"external_id":{"arxiv":["1311.4425"]},"article_processing_charge":"No","title":"Parameterized model checking of token-passing systems","citation":{"mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15","apa":"Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"external_id":{"arxiv":["1307.4473"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika","first_name":"Veronika"},{"first_name":"Michael","full_name":"Raskin, Michael","last_name":"Raskin"}],"publist_id":"5836","title":"Approximating the minimum cycle mean","citation":{"ista":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116. doi:10.1016/j.tcs.2014.06.031","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031","mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"_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"}],"page":"104 - 116","date_created":"2018-12-11T11:51:40Z","date_published":"2014-08-28T00:00:00Z","doi":"10.1016/j.tcs.2014.06.031","year":"2014","publication":"Theoretical Computer Science","day":"28","oa":1,"publisher":"Elsevier","quality_controlled":"1","department":[{"_id":"KrCh"}],"date_updated":"2022-09-09T11:50:58Z","type":"journal_article","article_type":"original","status":"public","_id":"1375","ec_funded":1,"volume":547,"issue":"C","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.4473"}],"scopus_import":"1","intvolume":" 547","month":"08","abstract":[{"lang":"eng","text":"We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound."}],"oa_version":"Preprint"},{"publication_status":"published","year":"2014","language":[{"iso":"eng"}],"day":"03","page":"85 - 90","date_created":"2018-12-11T11:54:22Z","date_published":"2014-02-03T00:00:00Z","doi":"10.1109/IOT.2014.7030120","abstract":[{"lang":"eng","text":"Wireless sensor networks (WSNs) composed of low-power, low-cost sensor nodes are expected to form the backbone of future intelligent networks for a broad range of civil, industrial and military applications. These sensor nodes are often deployed through random spreading, and function in dynamic environments. Many applications of WSNs such as pollution tracking, forest fire detection, and military surveillance require knowledge of the location of constituent nodes. But the use of technologies such as GPS on all nodes is prohibitive due to power and cost constraints. So, the sensor nodes need to autonomously determine their locations. Most localization techniques use anchor nodes with known locations to determine the position of remaining nodes. Localization techniques have two conflicting requirements. On one hand, an ideal localization technique should be computationally simple and on the other hand, it must be resistant to attacks that compromise anchor nodes. In this paper, we propose a computationally light-weight game theoretic secure localization technique and demonstrate its effectiveness in comparison to existing techniques."}],"oa_version":"None","quality_controlled":"1","publisher":"IEEE","month":"02","date_updated":"2021-01-12T06:53:38Z","citation":{"short":"S. Jha, S. Tripakis, S. Seshia, K. Chatterjee, in:, IEEE, 2014, pp. 85–90.","ieee":"S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.","ama":"Jha S, Tripakis S, Seshia S, Chatterjee K. Game theoretic secure localization in wireless sensor networks. In: IEEE; 2014:85-90. doi:10.1109/IOT.2014.7030120","apa":"Jha, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120","mla":"Jha, Susmit, et al. Game Theoretic Secure Localization in Wireless Sensor Networks. IEEE, 2014, pp. 85–90, doi:10.1109/IOT.2014.7030120.","ista":"Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things, 85–90.","chicago":"Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE, 2014. https://doi.org/10.1109/IOT.2014.7030120."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Susmit","full_name":"Jha, Susmit","last_name":"Jha"},{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"first_name":"Sanjit","last_name":"Seshia","full_name":"Seshia, Sanjit"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"publist_id":"5247","title":"Game theoretic secure localization in wireless sensor networks","department":[{"_id":"KrCh"}],"_id":"1853","conference":{"start_date":"2014-10-06","location":"Cambridge, USA","end_date":"2014-10-08","name":"IOT: Internet of Things"},"type":"conference","status":"public"},{"_id":"1884","status":"public","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"D. Landau et al., “Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples,” Blood, vol. 124, no. 21. American Society of Hematology, pp. 1952–1952, 2014.","short":"D. Landau, C. Stewart, J. Reiter, M. Lawrence, C. Sougnez, J. Brown, A. Lopez Guillermo, S. Gabriel, E. Lander, D. Neuberg, C. López Otín, E. Campo, G. Getz, C. Wu, Blood 124 (2014) 1952–1952.","apa":"Landau, D., Stewart, C., Reiter, J., Lawrence, M., Sougnez, C., Brown, J., … Wu, C. (2014). Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples. Blood. American Society of Hematology.","ama":"Landau D, Stewart C, Reiter J, et al. Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples. Blood. 2014;124(21):1952-1952.","mla":"Landau, Dan, et al. “Novel Putative Driver Gene Mutations in Chronic Lymphocytic Leukemia (CLL): Results from a Combined Analysis of Whole Exome Sequencing of 262 Primary CLL Aamples.” Blood, vol. 124, no. 21, American Society of Hematology, 2014, pp. 1952–1952.","ista":"Landau D, Stewart C, Reiter J, Lawrence M, Sougnez C, Brown J, Lopez Guillermo A, Gabriel S, Lander E, Neuberg D, López Otín C, Campo E, Getz G, Wu C. 2014. Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples. Blood. 124(21), 1952–1952.","chicago":"Landau, Dan, Chip Stewart, Johannes Reiter, Michael Lawrence, Carrie Sougnez, Jennifer Brown, Armando Lopez Guillermo, et al. “Novel Putative Driver Gene Mutations in Chronic Lymphocytic Leukemia (CLL): Results from a Combined Analysis of Whole Exome Sequencing of 262 Primary CLL Aamples.” Blood. American Society of Hematology, 2014."},"date_updated":"2021-01-12T06:53:50Z","title":"Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples","department":[{"_id":"KrCh"}],"author":[{"first_name":"Dan","last_name":"Landau","full_name":"Landau, Dan"},{"first_name":"Chip","full_name":"Stewart, Chip","last_name":"Stewart"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","last_name":"Reiter"},{"first_name":"Michael","last_name":"Lawrence","full_name":"Lawrence, Michael"},{"full_name":"Sougnez, Carrie","last_name":"Sougnez","first_name":"Carrie"},{"full_name":"Brown, Jennifer","last_name":"Brown","first_name":"Jennifer"},{"full_name":"Lopez Guillermo, Armando","last_name":"Lopez Guillermo","first_name":"Armando"},{"full_name":"Gabriel, Stacey","last_name":"Gabriel","first_name":"Stacey"},{"first_name":"Eric","full_name":"Lander, Eric","last_name":"Lander"},{"last_name":"Neuberg","full_name":"Neuberg, Donna","first_name":"Donna"},{"first_name":"Carlos","last_name":"López Otín","full_name":"López Otín, Carlos"},{"last_name":"Campo","full_name":"Campo, Elias","first_name":"Elias"},{"full_name":"Getz, Gad","last_name":"Getz","first_name":"Gad"},{"full_name":"Wu, Catherine","last_name":"Wu","first_name":"Catherine"}],"publist_id":"5211","oa_version":"None","abstract":[{"lang":"eng","text":"Unbiased high-throughput massively parallel sequencing methods have transformed the process of discovery of novel putative driver gene mutations in cancer. In chronic lymphocytic leukemia (CLL), these methods have yielded several unexpected findings, including the driver genes SF3B1, NOTCH1 and POT1. Recent analysis, utilizing down-sampling of existing datasets, has shown that the discovery process of putative drivers is far from complete across cancer. In CLL, while driver gene mutations affecting >10% of patients were efficiently discovered with previously published CLL cohorts of up to 160 samples subjected to whole exome sequencing (WES), this sample size has only 0.78 power to detect drivers affecting 5% of patients, and only 0.12 power for drivers affecting 2% of patients. These calculations emphasize the need to apply unbiased WES to larger patient cohorts."}],"intvolume":" 124","month":"12","main_file_link":[{"url":"http://www.bloodjournal.org/content/124/21/1952?sso-checked=true"}],"publisher":"American Society of Hematology","publication":"Blood","language":[{"iso":"eng"}],"day":"04","year":"2014","publication_status":"published","date_created":"2018-12-11T11:54:32Z","volume":124,"date_published":"2014-12-04T00:00:00Z","issue":"21","page":"1952 - 1952"},{"editor":[{"last_name":"Cassez","full_name":"Cassez, Franck","first_name":"Franck"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"title":"Verification of markov decision processes using learning algorithms","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Marta","last_name":"Kwiatkowska","full_name":"Kwiatkowska, Marta"},{"full_name":"Parker, David","last_name":"Parker","first_name":"David"},{"full_name":"Ujma, Mateusz","last_name":"Ujma","first_name":"Mateusz"}],"publist_id":"5046","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.","ieee":"T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Verification of markov decision processes using learning algorithms. In: Cassez F, Raskin J-F, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8837. Society of Industrial and Applied Mathematics; 2014:98-114. doi:10.1007/978-3-319-11936-6_8","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. https://doi.org/10.1007/978-3-319-11936-6_8","mla":"Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8."},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"LIGHT-REGULATED LIGAND TRAPS FOR SPATIO-TEMPORAL INHIBITION OF CELL SIGNALING","grant_number":"24696","_id":"26241A12-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T11:55:17Z","date_published":"2014-11-01T00:00:00Z","doi":"10.1007/978-3-319-11936-6_8","page":"98 - 114","publication":" Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","day":"01","year":"2014","oa":1,"quality_controlled":"1","publisher":"Society of Industrial and Applied Mathematics","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 246967 (VERIWARE), by the EU FP7 project HIERATIC, by the Czech Science Foundation grant No P202/12/P612, by EPSRC project EP/K038575/1.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T06:54:49Z","status":"public","conference":{"name":"ALENEX: Algorithm Engineering and Experiments","location":"Sydney, Australia","end_date":"2014-11-07","start_date":"2014-11-03"},"type":"conference","_id":"2027","ec_funded":1,"volume":8837,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 8837","month":"11","main_file_link":[{"url":"http://arxiv.org/abs/1402.2967","open_access":"1"}],"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"text":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.","lang":"eng"}]},{"oa_version":"Submitted Version","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."}],"intvolume":" 8704","month":"09","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5084"}],"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":8704,"_id":"2053","status":"public","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2014-09-02","end_date":"2014-09-05","location":"Rome, Italy"},"type":"conference","date_updated":"2021-01-12T06:55:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"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.","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","day":"01","year":"2014","date_created":"2018-12-11T11:55:27Z","doi":"10.1007/978-3-662-44584-6_18","date_published":"2014-09-01T00:00:00Z","page":"249 - 265","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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 Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_18.","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.","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.","apa":"Hermanns, H., Krčál, J., & Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_18","ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:10.1007/978-3-662-44584-6_18","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18."},"editor":[{"first_name":"Paolo","full_name":"Baldan, Paolo","last_name":"Baldan"},{"first_name":"Daniele","full_name":"Gorla, Daniele","last_name":"Gorla"}],"title":"Probabilistic bisimulation: Naturally on distributions","author":[{"last_name":"Hermanns","full_name":"Hermanns, Holger","first_name":"Holger"},{"first_name":"Jan","last_name":"Krčál","full_name":"Krčál, Jan"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"}],"publist_id":"4993"},{"title":"Parameterized model checking of rendezvous systems","department":[{"_id":"KrCh"}],"editor":[{"last_name":"Baldan","full_name":"Baldan, Paolo","first_name":"Paolo"},{"full_name":"Gorla, Daniele","last_name":"Gorla","first_name":"Daniele"}],"author":[{"full_name":"Aminof, Benjamin","last_name":"Aminof","first_name":"Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tomer","last_name":"Kotek","full_name":"Kotek, Tomer"},{"full_name":"Rubin, Sacha","last_name":"Rubin","first_name":"Sacha"},{"first_name":"Francesco","full_name":"Spegni, Francesco","last_name":"Spegni"},{"last_name":"Veith","full_name":"Veith, Helmut","first_name":"Helmut"}],"publist_id":"4994","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:59Z","citation":{"mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9.","ama":"Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking of rendezvous systems. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:109-124. doi:10.1007/978-3-662-44584-6_9","apa":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., & Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_9","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.","ieee":"B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.","chicago":"Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_9.","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."},"status":"public","type":"conference","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2014-09-02","location":"Rome, Italy","end_date":"2014-09-05"},"_id":"2052","doi":"10.1007/978-3-662-44584-6_9","date_published":"2014-09-01T00:00:00Z","volume":8704,"date_created":"2018-12-11T11:55:26Z","page":"109 - 124","day":"01","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","language":[{"iso":"eng"}],"publication_status":"published","year":"2014","month":"09","intvolume":" 8704","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"quality_controlled":"1","oa_version":"None","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.","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."}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","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. Acta Informatica. 2014;51(3-4):193-220. doi:10.1007/s00236-013-0191-5","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0191-5","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.","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.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5."},"title":"Synthesizing robust systems","article_processing_charge":"No","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karin","last_name":"Greimel","full_name":"Greimel, Karin"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Georg","full_name":"Hofferek, Georg","last_name":"Hofferek"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"first_name":"Bettina","full_name":"Könighofer, Bettina","last_name":"Könighofer"},{"full_name":"Könighofer, Robert","last_name":"Könighofer","first_name":"Robert"}],"publist_id":"4787","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_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"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication":"Acta Informatica","day":"01","year":"2014","has_accepted_license":"1","date_created":"2018-12-11T11:56:13Z","doi":"10.1007/s00236-013-0191-5","date_published":"2014-06-01T00:00:00Z","page":"193 - 220","oa":1,"publisher":"Springer","quality_controlled":"1","ddc":["621"],"date_updated":"2021-01-12T06:55:51Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:31Z","_id":"2187","pubrep_id":"71","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":169523,"date_updated":"2020-07-14T12:45:31Z","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","date_created":"2018-12-12T10:16:44Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5234","checksum":"d7f560f3d923f0f00aa10a0652f83273"}],"publication_status":"published","ec_funded":1,"volume":51,"issue":"3-4","oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"intvolume":" 51","month":"06","scopus_import":1},{"date_created":"2018-12-11T11:56:14Z","doi":"10.1007/978-3-319-08867-9_13","date_published":"2014-01-01T00:00:00Z","page":"192 - 208","day":"01","year":"2014","oa":1,"publisher":"Springer","quality_controlled":"1","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.","title":"From LTL to deterministic automata: A safraless compositional approach","publist_id":"4784","author":[{"first_name":"Javier","full_name":"Esparza, Javier","last_name":"Esparza"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_13.","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:10.1007/978-3-319-08867-9_13","apa":"Esparza, J., & 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. https://doi.org/10.1007/978-3-319-08867-9_13","short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 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.","mla":"Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13."},"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"volume":8559,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 8559","month":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.3388"}],"alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T06:55:53Z","status":"public","conference":{"name":"CAV: Computer Aided Verification"},"type":"conference","_id":"2190"},{"scopus_import":1,"main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/428","open_access":"1"}],"month":"02","intvolume":" 10","abstract":[{"text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ 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 ε > 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 ε > 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.","lang":"eng"}],"oa_version":"Published Version","issue":"1","volume":10,"ec_funded":1,"publication_identifier":{"issn":["18605974"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4656","checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","creator":"system","file_size":375388,"date_updated":"2020-07-14T12:45:34Z","file_name":"IST-2016-428-v1+1_1104.3489.pdf","date_created":"2018-12-12T10:07:57Z"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"428","_id":"2234","file_date_updated":"2020-07-14T12:45:34Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:56:11Z","ddc":["000"],"quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"doi":"10.2168/LMCS-10(1:13)2014","date_published":"2014-02-14T00:00:00Z","date_created":"2018-12-11T11:56:29Z","has_accepted_license":"1","year":"2014","day":"14","publication":"Logical Methods in Computer Science","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"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publist_id":"4727","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"full_name":"Brožek, Václav","last_name":"Brožek","first_name":"Václav"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"title":"Markov decision processes with multiple long-run average objectives","citation":{"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.” Logical Methods in Computer Science. International Federation of Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:13)2014.","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).","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:13)2014.","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.","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., & Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-10(1:13)2014","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 2014;10(1). doi:10.2168/LMCS-10(1:13)2014"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["03043975"]},"year":"2014","publication_status":"published","day":"13","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","page":"73 - 91","date_published":"2014-02-13T00:00:00Z","doi":"10.1016/j.tcs.2013.11.032","volume":521,"date_created":"2018-12-11T11:56:33Z","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"}],"oa_version":"Submitted Version","scopus_import":1,"publisher":"Elsevier","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.3777"}],"month":"02","intvolume":" 521","citation":{"chicago":"Grinshpun, Andrey, Pakawat Phalitnonkiat, Sasha Rubin, and Andrei Tarfulea. “Alternating Traps in Muller and Parity Games.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2013.11.032.","ista":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.","mla":"Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.” Theoretical Computer Science, vol. 521, Elsevier, 2014, pp. 73–91, doi:10.1016/j.tcs.2013.11.032.","short":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.","ieee":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” Theoretical Computer Science, vol. 521. Elsevier, pp. 73–91, 2014.","ama":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. Alternating traps in Muller and parity games. Theoretical Computer Science. 2014;521:73-91. doi:10.1016/j.tcs.2013.11.032","apa":"Grinshpun, A., Phalitnonkiat, P., Rubin, S., & Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2013.11.032"},"date_updated":"2021-01-12T06:56:16Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Andrey","last_name":"Grinshpun","full_name":"Grinshpun, Andrey"},{"first_name":"Pakawat","last_name":"Phalitnonkiat","full_name":"Phalitnonkiat, Pakawat"},{"full_name":"Rubin, Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha"},{"first_name":"Andrei","last_name":"Tarfulea","full_name":"Tarfulea, Andrei"}],"publist_id":"4703","title":"Alternating traps in Muller and parity games","department":[{"_id":"KrCh"}],"_id":"2246","type":"journal_article","status":"public"},{"date_created":"2018-12-11T11:59:14Z","date_published":"2014-06-01T00:00:00Z","doi":"10.1007/s00236-013-0182-6","page":"129 - 163","publication":"Acta Informatica","day":"01","year":"2014","oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","title":"Strategy synthesis for multi-dimensional quantitative objectives","article_processing_charge":"No","external_id":{"arxiv":["1201.5073"]},"publist_id":"4176","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Randour","full_name":"Randour, Mickael","first_name":"Mickael"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.","apa":"Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163."},"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"issue":"3-4","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10904"}]},"volume":51,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 51","month":"06","main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"department":[{"_id":"KrCh"}],"date_updated":"2023-02-21T16:06:56Z","status":"public","type":"journal_article","article_type":"original","_id":"2716"},{"_id":"1733","status":"public","type":"journal_article","date_updated":"2023-02-23T11:04:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"month":"12","intvolume":" 560","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"3","related_material":{"record":[{"status":"public","id":"2916","relation":"earlier_version"}]},"volume":560,"ec_funded":1,"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019."},"title":"Interface simulation distances","publist_id":"5392","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"04","publication":"Theoretical Computer Science","year":"2014","date_published":"2014-12-04T00:00:00Z","doi":"10.1016/j.tcs.2014.08.019","date_created":"2018-12-11T11:53:43Z","page":"348 - 363"},{"doi":"10.1145/2597631","date_published":"2014-05-01T00:00:00Z","date_created":"2018-12-11T11:55:57Z","year":"2014","day":"01","publication":"Journal of the ACM","publisher":"ACM","quality_controlled":"1","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"publist_id":"4883","article_processing_charge":"No","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","citation":{"chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.","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.” Journal of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.","apa":"Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. https://doi.org/10.1145/2597631","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 2014;61(3). doi:10.1145/2597631","ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014)."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_number":"a15","related_material":{"record":[{"relation":"earlier_version","id":"3165","status":"public"}]},"issue":"3","volume":61,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://eprints.cs.univie.ac.at/3933/","open_access":"1"}],"month":"05","intvolume":" 61","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>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 &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"}],"oa_version":"Submitted Version","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T11:15:12Z","type":"journal_article","status":"public","_id":"2141"},{"citation":{"mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37.","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.","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.","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."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4992","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"last_name":"Gorla","full_name":"Gorla, Daniele","first_name":"Daniele"}],"title":"Qualitative concurrent parity games: Bounded rationality","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_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"}],"year":"2014","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","day":"01","page":"544 - 559","date_created":"2018-12-11T11:55:27Z","date_published":"2014-09-01T00:00:00Z","doi":"10.1007/978-3-662-44584-6_37","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_updated":"2023-02-23T11:23:36Z","department":[{"_id":"KrCh"}],"_id":"2054","conference":{"name":"CONCUR: Concurrency Theory","location":"Rome, Italy","end_date":"2014-09-05","start_date":"2014-09-02"},"type":"conference","status":"public","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":8704,"related_material":{"record":[{"status":"public","id":"3354","relation":"earlier_version"}]},"abstract":[{"lang":"eng","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."}],"oa_version":"None","alternative_title":["LNCS"],"intvolume":" 8704","month":"09"},{"_id":"475","pubrep_id":"952","status":"public","conference":{"start_date":"2014-04-05","location":"Grenoble, France","end_date":"2014-04-06","name":"SR: Strategic Reasoning"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","ddc":["004"],"date_updated":"2021-01-12T08:00:53Z","file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","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. "}],"intvolume":" 146","month":"04","scopus_import":1,"alternative_title":["EPTCS"],"language":[{"iso":"eng"}],"file":[{"checksum":"4d7b4ab82980cca2b96ac7703992a8c8","file_id":"5260","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf","date_created":"2018-12-12T10:17:08Z","creator":"system","file_size":100115,"date_updated":"2020-07-14T12:46:35Z"}],"publication_status":"published","ec_funded":1,"volume":146,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.","chicago":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing Association, 2014. https://doi.org/10.4204/EPTCS.146.11.","ama":"Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90. doi:10.4204/EPTCS.146.11","apa":"Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11","ieee":"B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.","short":"B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.","mla":"Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:10.4204/EPTCS.146.11."},"title":"First cycle games","publist_id":"7345","author":[{"full_name":"Aminof, Benjamin","last_name":"Aminof","first_name":"Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rubin, Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha"}],"oa":1,"quality_controlled":"1","publisher":"Open Publishing Association","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","day":"01","year":"2014","has_accepted_license":"1","date_created":"2018-12-11T11:46:41Z","doi":"10.4204/EPTCS.146.11","date_published":"2014-04-01T00:00:00Z","page":"83 - 90"},{"abstract":[{"text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (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. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games.","lang":"eng"}],"oa_version":"None","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 8634","month":"01","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"issue":"PART 1","volume":8634,"related_material":{"record":[{"relation":"later_version","status":"public","id":"2211"},{"relation":"earlier_version","status":"public","id":"5381"}]},"_id":"1903","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2014-08-25","location":"Budapest, Hungary","end_date":"2014-08-29"},"type":"conference","pubrep_id":"141","status":"public","date_updated":"2023-02-23T12:23:43Z","department":[{"_id":"KrCh"}],"quality_controlled":"1","publisher":"Springer","year":"2014","day":"01","page":"1 - 4","date_created":"2018-12-11T11:54:38Z","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/978-3-662-44522-8_1","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","grant_number":"S11407","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.","chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1","mla":"Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5192","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"title":"Partial-observation stochastic reachability and parity games"},{"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1107.2141","open_access":"1"}],"month":"04","intvolume":" 15","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"}],"oa_version":"Preprint","related_material":{"record":[{"status":"public","id":"1903","relation":"earlier_version"},{"status":"public","id":"2955","relation":"earlier_version"},{"id":"5381","status":"public","relation":"earlier_version"}]},"volume":15,"issue":"2","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"2211","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:43Z","quality_controlled":"1","publisher":"ACM","oa":1,"date_published":"2014-04-01T00:00:00Z","doi":"10.1145/2579821","date_created":"2018-12-11T11:56:21Z","year":"2014","day":"01","publication":"ACM Transactions on Computational Logic (TOCL)","article_number":"16","publist_id":"4759","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"external_id":{"arxiv":["1107.2141"]},"title":"Partial-observation stochastic games: How to win when belief fails","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.","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.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.","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. ACM Transactions on Computational Logic (TOCL). 2014;15(2). doi:10.1145/2579821","apa":"Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2579821"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","file":[{"date_updated":"2020-07-14T12:45:26Z","file_size":346184,"creator":"system","date_created":"2018-12-12T10:10:59Z","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4851","checksum":"354c41d37500b56320afce94cf9a99c2"}],"language":[{"iso":"eng"}],"volume":15,"issue":"4","related_material":{"record":[{"id":"3356","status":"public","relation":"earlier_version"},{"id":"5385","status":"public","relation":"earlier_version"}]},"ec_funded":1,"abstract":[{"text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"month":"09","intvolume":" 15","date_updated":"2023-02-23T12:23:54Z","ddc":["000","004"],"file_date_updated":"2020-07-14T12:45:26Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"2038","type":"journal_article","article_type":"original","status":"public","pubrep_id":"192","has_accepted_license":"1","year":"2014","day":"16","publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/2629686","date_published":"2014-09-16T00:00:00Z","date_created":"2018-12-11T11:55:21Z","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","publisher":"ACM","quality_controlled":"1","oa":1,"citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 2014;15(4). doi:10.1145/2629686","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5013","author":[{"full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"article_processing_charge":"No","title":"Temporal specifications with accumulative values","article_number":"27","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"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"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"The complexity of ergodic mean payoff games","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"publist_id":"4822","external_id":{"arxiv":["1404.5734"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.","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.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:10.1007/978-3-662-43951-7_11","apa":"Chatterjee, K., & 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. https://doi.org/10.1007/978-3-662-43951-7_11","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.","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.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11."},"quality_controlled":"1","publisher":"Springer","oa":1,"date_published":"2014-01-01T00:00:00Z","doi":"10.1007/978-3-662-43951-7_11","date_created":"2018-12-11T11:56:04Z","page":"122 - 133","day":"01","year":"2014","status":"public","type":"conference","conference":{"name":"ICST: International Conference on Software Testing, Verification and Validation","start_date":"2014-07-08","location":"Copenhagen, Denmark","end_date":"2014-07-11"},"_id":"2162","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:24:48Z","month":"01","intvolume":" 8573","alternative_title":["LNCS"],"main_file_link":[{"url":"http://arxiv.org/abs/1404.5734","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"volume":8573,"issue":"Part 2","related_material":{"record":[{"id":"5404","status":"public","relation":"earlier_version"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published"},{"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Sumit","last_name":"Nain","full_name":"Nain, Sumit"},{"first_name":"Moshe","last_name":"Vardi","full_name":"Vardi, Moshe"}],"publist_id":"4757","external_id":{"arxiv":["1401.3289"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16.","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:10.1007/978-3-642-54830-7_16","apa":"Chatterjee, K., Doyen, L., Nain, S., & 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. https://doi.org/10.1007/978-3-642-54830-7_16","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 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. https://doi.org/10.1007/978-3-642-54830-7_16.","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."},"publisher":"Springer","quality_controlled":"1","oa":1,"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.","doi":"10.1007/978-3-642-54830-7_16","date_published":"2014-04-01T00:00:00Z","date_created":"2018-12-11T11:56:21Z","page":"242 - 257","day":"01","year":"2014","status":"public","type":"conference","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2014-04-05","location":"Grenoble, France","end_date":"2014-04-13"},"_id":"2213","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:24:58Z","month":"04","intvolume":" 8412","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1401.3289"}],"oa_version":"Preprint","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"}],"volume":8412,"related_material":{"record":[{"id":"5408","status":"public","relation":"earlier_version"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published"},{"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5405"}]},"volume":8412,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 8412","month":"04","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","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). "}],"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:24:50Z","status":"public","conference":{"start_date":"2014-04-05","end_date":"2014-04-13","location":"Grenoble, France","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"type":"conference","_id":"2212","date_created":"2018-12-11T11:56:21Z","date_published":"2014-04-01T00:00:00Z","doi":"10.1007/978-3-642-54830-7_14","page":"210 - 225","day":"01","year":"2014","publisher":"Springer","quality_controlled":"1","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.","title":"Perfect-information stochastic mean-payoff parity games","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"last_name":"Oualhadj","full_name":"Oualhadj, Youssouf","first_name":"Youssouf"}],"publist_id":"4758","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., Doyen, L., Gimbert, H., & 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. https://doi.org/10.1007/978-3-642-54830-7_14","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:10.1007/978-3-642-54830-7_14","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 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. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.","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.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14."},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","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"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"publisher":"Springer","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=2562059.2562141"}],"oa":1,"month":"01","abstract":[{"lang":"eng","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 δ > 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."}],"oa_version":"Submitted Version","page":"303 - 312","doi":"10.1145/2562059.2562141","date_published":"2014-01-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"5409","relation":"earlier_version"}]},"date_created":"2018-12-11T11:56:22Z","year":"2014","publication_status":"published","day":"01","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2017-04-15","location":"Berlin, Germany","end_date":"2017-04-17"},"status":"public","_id":"2216","publist_id":"4752","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"title":"Edit distance for timed automata","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:25:01Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.","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.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141","ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata. In: Springer; 2014:303-312. doi:10.1145/2562059.2562141","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:18Z","citation":{"short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v2-2","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2."},"status":"public","pubrep_id":"164","type":"technical_report","_id":"5413","date_published":"2014-02-06T00:00:00Z","related_material":{"record":[{"id":"2063","status":"public","relation":"later_version"},{"status":"public","id":"5412","relation":"earlier_version"},{"relation":"later_version","id":"5414","status":"public"}]},"doi":"10.15479/AT:IST-2014-153-v2-2","date_created":"2018-12-12T11:39:11Z","page":"33","file":[{"file_size":606049,"date_updated":"2020-07-14T12:46:47Z","creator":"system","file_name":"IST-2014-153-v2+2_main.pdf","date_created":"2018-12-12T11:54:17Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5539","checksum":"ce4967a184d84863eec76c66cbac1614"}],"day":"06","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","month":"02","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"oa_version":"Published Version","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"}]},{"month":"02","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"oa_version":"Published Version","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","doi":"10.15479/AT:IST-2014-153-v3-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"2063"},{"relation":"earlier_version","id":"5412","status":"public"},{"status":"public","id":"5413","relation":"earlier_version"}]},"date_created":"2018-12-12T11:39:12Z","page":"33","day":"07","file":[{"date_updated":"2020-07-14T12:46:48Z","file_size":606227,"creator":"system","date_created":"2018-12-12T11:53:03Z","file_name":"IST-2014-153-v3+1_main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5464","checksum":"87b93fe9af71fc5c94b0eb6151537e11"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2014","status":"public","pubrep_id":"165","type":"technical_report","_id":"5414","department":[{"_id":"KrCh"}],"title":"CEGAR for qualitative analysis of probabilistic systems","file_date_updated":"2020-07-14T12:46:48Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2023-02-23T12:25:15Z","citation":{"short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v3-1","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1."}},{"language":[{"iso":"eng"}],"day":"29","file":[{"file_name":"IST-2014-153-v1+1_main.pdf","date_created":"2018-12-12T11:53:39Z","creator":"system","file_size":423322,"date_updated":"2020-07-14T12:46:47Z","checksum":"4d6cda4bebed970926403ad6ad8c745f","file_id":"5500","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:11Z","doi":"10.15479/AT:IST-2014-153-v1-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"2063"},{"relation":"later_version","id":"5413","status":"public"},{"relation":"later_version","status":"public","id":"5414"}]},"date_published":"2014-01-29T00:00:00Z","page":"31","oa_version":"Published Version","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"}],"month":"01","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p."},"date_updated":"2023-02-23T12:25:18Z","title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"_id":"5412","pubrep_id":"153","status":"public","type":"technical_report"},{"title":"Games with a weak adversary","external_id":{"arxiv":["1404.5453"]},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"publist_id":"4821","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10.","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.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10.","short":"K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.","ieee":"K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.","apa":"Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10","ama":"Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in Computer Science. Vol 8573. Springer; 2014:110-121. doi:10.1007/978-3-662-43951-7_10"},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_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"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:56:04Z","doi":"10.1007/978-3-662-43951-7_10","date_published":"2014-01-01T00:00:00Z","page":"110 - 121","publication":"Lecture Notes in Computer Science","day":"01","year":"2014","oa":1,"quality_controlled":"1","publisher":"Springer","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","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:25:29Z","status":"public","conference":{"name":"ICALP: Automata, Languages and Programming","location":"Copenhagen, Denmark","end_date":"2014-07-11","start_date":"2014-07-08"},"type":"conference","_id":"2163","ec_funded":1,"issue":"Part 2","volume":8573,"related_material":{"record":[{"relation":"earlier_version","id":"5418","status":"public"}]},"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 8573","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1404.5453"}],"alternative_title":["LNCS"],"oa_version":"Preprint","abstract":[{"lang":"eng","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."}]},{"month":"04","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider the reachability and shortest path problems on low tree-width graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize W. We use O to hide polynomial factors of the inverse of the Ackermann function. Our main contributions are three fold:\r\n1. For reachability, we present an algorithm that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space, and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries. Note that for constant t our algorithm uses O(n·logn) time for preprocessing; and O(n/W) time for single-source queries, which is faster than depth first search/breath first search (after the preprocessing).\r\n2. We present an algorithm for shortest path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus query time trade-off algorithm for shortest path that, given any constant >0, requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair queries.\r\nOur algorithms improve all existing results, and use very simple data structures."}],"date_created":"2018-12-12T11:39:13Z","doi":"10.15479/AT:IST-2014-187-v1-1","date_published":"2014-04-14T00:00:00Z","page":"34","language":[{"iso":"eng"}],"day":"14","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c608e66030a4bf51d2d99b451f539b99","file_id":"5548","creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":670031,"date_created":"2018-12-12T11:54:25Z","file_name":"IST-2014-187-v1+1_main_full_tech.pdf"}],"year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"187","status":"public","type":"technical_report","_id":"5419","department":[{"_id":"KrCh"}],"title":"Improved algorithms for reachability and shortest path on low tree-width graphs","file_date_updated":"2020-07-14T12:46:50Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2021-01-12T08:02:03Z","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-187-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1","mla":"Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1."}},{"date_updated":"2023-02-23T10:30:58Z","citation":{"ama":"Chatterjee K, Doyen L. Games with a Weak Adversary. IST Austria; 2014. doi:10.15479/AT:IST-2014-176-v1-1","apa":"Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","ieee":"K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"title":"Games with a weak adversary","file_date_updated":"2020-07-14T12:46:49Z","department":[{"_id":"KrCh"}],"_id":"5418","type":"technical_report","pubrep_id":"176","status":"public","publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:46:49Z","file_size":328253,"creator":"system","date_created":"2018-12-12T11:53:07Z","file_name":"IST-2014-176-v1+1_icalp_14.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5468","checksum":"1d6958aa60050e1c3e932c6e5f34c39f"}],"day":"22","page":"18","date_created":"2018-12-12T11:39:13Z","date_published":"2014-03-22T00:00:00Z","doi":"10.15479/AT:IST-2014-176-v1-1","related_material":{"record":[{"relation":"later_version","id":"2163","status":"public"}]},"abstract":[{"lang":"eng","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, 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. Our results have tight connections with partial-observation stochastic games for which we derive new complexity results."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"03"},{"citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.","ieee":"K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-191-v1-1","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1."},"date_updated":"2021-01-12T08:02:05Z","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"}],"file_date_updated":"2020-07-14T12:46:50Z","title":"The value 1 problem for concurrent mean-payoff games","department":[{"_id":"KrCh"}],"_id":"5420","type":"technical_report","status":"public","pubrep_id":"191","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2014","publication_status":"published","file":[{"file_id":"5520","checksum":"49e0fd3e62650346daf7dc04604f7a0a","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2014-191-v1+1_main_full.pdf","date_created":"2018-12-12T11:53:58Z","file_size":584368,"date_updated":"2020-07-14T12:46:50Z","creator":"system"}],"day":"14","language":[{"iso":"eng"}],"page":"49","doi":"10.15479/AT:IST-2014-191-v1-1","date_published":"2014-04-14T00:00:00Z","date_created":"2018-12-12T11:39:14Z","abstract":[{"text":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) 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).","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"04"},{"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.","lang":"eng"}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"09","year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2014-305-v1+1_main.pdf","date_created":"2018-12-12T11:53:51Z","creator":"system","file_size":655774,"date_updated":"2020-07-14T12:46:51Z","checksum":"35009d5fad01198341e6c1a3353481b7","file_id":"5512","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"day":"09","page":"12","date_created":"2018-12-12T11:39:15Z","doi":"10.15479/AT:IST-2014-305-v1-1","date_published":"2014-09-09T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"1732","status":"public"},{"relation":"later_version","status":"public","id":"5426"}]},"_id":"5424","type":"technical_report","pubrep_id":"305","status":"public","date_updated":"2023-02-23T12:25:52Z","citation":{"ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria; 2014. doi:10.15479/AT:IST-2014-305-v1-1","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:51Z","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications"},{"oa_version":"Published Version","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.","lang":"eng"}],"month":"09","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"day":"29","file":[{"date_created":"2018-12-12T11:54:15Z","file_name":"IST-2014-305-v2+1_main2.pdf","creator":"system","date_updated":"2020-07-14T12:46:51Z","file_size":656019,"file_id":"5537","checksum":"730c0a8e97cf2712a884b2cc423f3919","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:16Z","date_published":"2014-09-29T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1732"},{"status":"public","id":"5424","relation":"earlier_version"}]},"doi":"10.15479/AT:IST-2014-305-v2-1","page":"10","_id":"5426","pubrep_id":"311","status":"public","type":"technical_report","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:47Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v2-1.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria; 2014. doi:10.15479/AT:IST-2014-305-v2-1","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p."},"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:51Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"last_name":"Gupta","full_name":"Gupta, Raghav","first_name":"Raghav"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}]},{"page":"14","date_created":"2018-12-12T11:39:15Z","date_published":"2014-07-29T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"1714","status":"public"}]},"doi":"10.15479/AT:IST-2014-300-v1-1","publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"29","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5514","checksum":"4b8fde4d9ef6653837f6803921d83032","creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":1270021,"date_created":"2018-12-12T11:53:53Z","file_name":"IST-2014-300-v1+1_main.pdf"}],"oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"07","abstract":[{"lang":"eng","text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm- deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including D(over), that have been proposed in the past, for various tasksets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are tasksets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application. "}],"oa_version":"Published Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Alexander","last_name":"Kössler","full_name":"Kössler, Alexander"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ulrich","last_name":"Schmid","full_name":"Schmid, Ulrich"}],"file_date_updated":"2020-07-14T12:46:50Z","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T10:11:15Z","citation":{"ieee":"K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.","short":"K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.","apa":"Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1","ama":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria; 2014. doi:10.15479/AT:IST-2014-300-v1-1","mla":"Chatterjee, Krishnendu, et al. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014, doi:10.15479/AT:IST-2014-300-v1-1.","ista":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.","chicago":"Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"type":"technical_report","pubrep_id":"300","status":"public","_id":"5423"},{"oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"11","abstract":[{"text":"We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and width t , on the standard RAM computational model with wordsize W = Θ (log n ) . Our contributions are two-fold: Our first contribution is an algorithm that given a graph and its tree-decomposition as input, computes a binary and balanced tree-decomposition of width at most 4 · t + 3 of the graph in O ( b ) time and space, improving a long-standing (from 1992) bound of O ( n · log n ) time for constant treewidth graphs. Our second contribution is on reachability queries for low treewidth graphs. We build on our tree-balancing algorithm and present a data-structure for graph reachability that requires O ( n · t 2 ) preprocessing time, O ( n · t ) space, and O ( d t/ log n e ) time for pair queries, and O ( n · t · log t/ log n ) time for single-source queries. For constant t our data-structure uses O ( n ) time for preprocessing, O (1) time for pair queries, and O ( n/ log n ) time for single-source queries. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries.","lang":"eng"}],"oa_version":"Published Version","page":"24","date_created":"2018-12-12T11:39:16Z","date_published":"2014-11-05T00:00:00Z","doi":"10.15479/AT:IST-2014-314-v1-1","year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"file":[{"checksum":"9d3b90bf4fff74664f182f2d95ef727a","file_id":"5471","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-314-v1+1_long.pdf","date_created":"2018-12-12T11:53:10Z","creator":"system","file_size":405561,"date_updated":"2020-07-14T12:46:52Z"}],"day":"05","type":"technical_report","pubrep_id":"314","status":"public","_id":"5427","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"title":"Optimal tree-decomposition balancing and reachability on low treewidth graphs","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:52Z","date_updated":"2021-01-12T08:02:09Z","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-314-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1."},"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"27","date_created":"2018-12-12T11:39:12Z","doi":"10.15479/AT:IST-2014-170-v1-1","related_material":{"record":[{"status":"public","id":"1656","relation":"later_version"},{"relation":"later_version","id":"467","status":"public"},{"relation":"later_version","id":"5436","status":"public"}]},"date_published":"2014-02-19T00:00:00Z","year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"19","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5497","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","creator":"system","date_updated":"2020-07-14T12:46:48Z","file_size":573457,"date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf"}],"oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"02","abstract":[{"text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains. ","lang":"eng"}],"oa_version":"Published Version","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:48Z","title":"Nested weighted automata","date_updated":"2023-02-23T12:26:19Z","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2014. doi:10.15479/AT:IST-2014-170-v1-1","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1."},"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","pubrep_id":"170","status":"public","_id":"5415"},{"language":[{"iso":"eng"}],"day":"18","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"42f3d8b563286eb0d903832bd9a848d3","file_id":"5538","creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":443529,"date_created":"2018-12-12T11:54:16Z","file_name":"IST-2014-190-v2+2_main_full.pdf"},{"checksum":"0c9a2fd822309719634495a35957e34d","file_id":"6852","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-190-v1+1_main_full.pdf","date_created":"2019-09-06T07:30:20Z","creator":"kschuh","file_size":440911,"date_updated":"2020-07-14T12:46:50Z"}],"year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:14Z","doi":"10.15479/AT:IST-2014-190-v2-2","related_material":{"record":[{"relation":"later_version","id":"5432","status":"public"},{"id":"5440","status":"public","relation":"later_version"}]},"date_published":"2014-04-18T00:00:00Z","page":"27","oa_version":"Published Version","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are: (1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure). (2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.","lang":"eng"}],"month":"04","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","ddc":["000","005"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolution on Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-190-v2-2","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2"},"date_updated":"2023-02-23T12:26:33Z","title":"The complexity of evolution on graphs","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:50Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"_id":"5421","pubrep_id":"190","status":"public","type":"technical_report"},{"title":"Doomsday equilibria for omega-regular games","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Emmanuel","last_name":"Filiot","full_name":"Filiot, Emmanuel"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"article_processing_charge":"No","external_id":{"arxiv":["1311.3238"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5."},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","name":"Game Theory","_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"}],"date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_5","date_created":"2022-03-18T13:03:15Z","page":"78-97","day":"30","publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","year":"2014","publisher":"Springer Nature","quality_controlled":"1","acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:52:24Z","status":"public","type":"conference","conference":{"end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"_id":"10885","related_material":{"record":[{"status":"public","id":"681","relation":"later_version"}]},"volume":8318,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783642540134"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642540127"]},"publication_status":"published","month":"01","intvolume":" 8318","alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games."}]},{"oa":1,"quality_controlled":"1","publisher":"Public Library of Science","date_created":"2018-12-11T11:55:22Z","doi":"10.1371/journal.pcbi.1003818","date_published":"2014-09-11T00:00:00Z","year":"2014","has_accepted_license":"1","publication":"PLoS Computational Biology","day":"11","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"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"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"7p","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"publist_id":"5012","title":"The time scale of evolutionary innovation","citation":{"mla":"Chatterjee, Krishnendu, et al. “The Time Scale of Evolutionary Innovation.” PLoS Computational Biology, vol. 10, no. 9, 7p, Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003818.","apa":"Chatterjee, K., Pavlogiannis, A., Adlam, B., & Nowak, M. (2014). The time scale of evolutionary innovation. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003818","ama":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. The time scale of evolutionary innovation. PLoS Computational Biology. 2014;10(9). doi:10.1371/journal.pcbi.1003818","short":"K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology 10 (2014).","ieee":"K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.” PLoS Computational Biology. Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.","ista":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9), 7p."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":" 10","month":"09","abstract":[{"lang":"eng","text":"A fundamental question in biology is the following: what is the time scale that is needed for evolutionary innovations? There are many results that characterize single steps in terms of the fixation time of new mutants arising in populations of certain size and structure. But here we ask a different question, which is concerned with the much longer time scale of evolutionary trajectories: how long does it take for a population exploring a fitness landscape to find target sequences that encode new biological functions? Our key variable is the length, (Formula presented.) of the genetic sequence that undergoes adaptation. In computer science there is a crucial distinction between problems that require algorithms which take polynomial or exponential time. The latter are considered to be intractable. Here we develop a theoretical approach that allows us to estimate the time of evolution as function of (Formula presented.) We show that adaptation on many fitness landscapes takes time that is exponential in (Formula presented.) even if there are broad selection gradients and many targets uniformly distributed in sequence space. These negative results lead us to search for specific mechanisms that allow evolution to work on polynomial time scales. We study a regeneration process and show that it enables evolution to work in polynomial time."}],"oa_version":"Published Version","ec_funded":1,"issue":"9","volume":10,"related_material":{"record":[{"relation":"research_data","status":"public","id":"9739"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"712d4c5787ddf97809cfc962507f0738","file_id":"4890","date_updated":"2020-07-14T12:45:26Z","file_size":1399093,"creator":"system","date_created":"2018-12-12T10:11:35Z","file_name":"IST-2016-440-v1+1_journal.pcbi.1003818.pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"440","status":"public","_id":"2039","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:26Z","date_updated":"2023-02-23T14:06:36Z","ddc":["510"]},{"_id":"9739","status":"public","type":"research_data_reference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Novak. “Detailed Proofs for ‘The Time Scale of Evolutionary Innovation.’” Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.s001.","ista":"Chatterjee K, Pavlogiannis A, Adlam B, Novak M. 2014. Detailed proofs for “The time scale of evolutionary innovation”, Public Library of Science, 10.1371/journal.pcbi.1003818.s001.","mla":"Chatterjee, Krishnendu, et al. Detailed Proofs for “The Time Scale of Evolutionary Innovation.” Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003818.s001.","ama":"Chatterjee K, Pavlogiannis A, Adlam B, Novak M. Detailed proofs for “The time scale of evolutionary innovation.” 2014. doi:10.1371/journal.pcbi.1003818.s001","apa":"Chatterjee, K., Pavlogiannis, A., Adlam, B., & Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.” Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003818.s001","ieee":"K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.","short":"K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Novak, (2014)."},"date_updated":"2023-02-23T10:25:37Z","department":[{"_id":"KrCh"}],"title":"Detailed proofs for “The time scale of evolutionary innovation”","article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ben","full_name":"Adlam, Ben","last_name":"Adlam"},{"first_name":"Martin","last_name":"Novak","full_name":"Novak, Martin"}],"oa_version":"Published Version","month":"09","publisher":"Public Library of Science","day":"11","year":"2014","date_created":"2021-07-28T08:13:57Z","related_material":{"record":[{"relation":"used_in_publication","id":"2039","status":"public"}]},"date_published":"2014-09-11T00:00:00Z","doi":"10.1371/journal.pcbi.1003818.s001"},{"_id":"535","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-05T14:09:29Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","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."}],"month":"11","intvolume":" 70","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","id":"10905","status":"public"}]},"issue":"3","volume":70,"ec_funded":1,"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"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"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.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 2014;70(3):457-492. doi:10.1007/s00453-013-9843-7","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. https://doi.org/10.1007/s00453-013-9843-7","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:10.1007/s00453-013-9843-7."},"title":"Polynomial-time algorithms for energy games with special weight structures","publist_id":"7282","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"article_processing_charge":"No","external_id":{"arxiv":["1604.08234"]},"quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Algorithmica","year":"2014","doi":"10.1007/s00453-013-9843-7","date_published":"2014-11-01T00:00:00Z","date_created":"2018-12-11T11:47:01Z","page":"457 - 492"},{"_id":"2063","conference":{"end_date":"2014-07-22","location":"Vienna, Austria","start_date":"2014-07-18","name":"CAV: Computer Aided Verification"},"type":"conference","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"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.","apa":"Chatterjee, K., Chmelik, M., & 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. https://doi.org/10.1007/978-3-319-08867-9_31","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:10.1007/978-3-319-08867-9_31","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 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."},"date_updated":"2023-09-07T11:58:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"}],"publist_id":"4978","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"CEGAR for qualitative analysis of probabilistic systems","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"}],"oa_version":"None","quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"intvolume":" 8559","month":"07","publication_status":"published","year":"2014","language":[{"iso":"eng"}],"day":"01","page":"473 - 490","date_created":"2018-12-11T11:55:30Z","ec_funded":1,"doi":"10.1007/978-3-319-08867-9_31","volume":8559,"date_published":"2014-07-01T00:00:00Z","related_material":{"record":[{"id":"5412","status":"public","relation":"earlier_version"},{"status":"public","id":"5413","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5414"},{"relation":"dissertation_contains","status":"public","id":"1155"}]}},{"type":"technical_report","pubrep_id":"315","status":"public","_id":"5428","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"file_date_updated":"2020-07-14T12:46:52Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Quantitative fair simulation games","date_updated":"2023-09-20T12:07:48Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1","ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative Fair Simulation Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-315-v1-1","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1.","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p."},"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"12","abstract":[{"lang":"eng","text":"Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. Again, while fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable for mean-payoff automata and the decidability is open for discounted-sum automata, whereas the (quantitative) simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games. For example, whereas for mean-payoff and discounted-sum games, the players do not need memory to play optimally; we show in contrast that for simulation games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal strategies for both players require infinite memory in general, and (ii) for discounted-sum objectives, optimal strategies need not exist for both players. While the simulation games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory requirements for mean-payoff objectives) as compared to their counterpart without Büchi acceptance conditions, we still present pseudo-polynomial time algorithms to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff and weighted discounted-sum automata."}],"oa_version":"Published Version","page":"26","date_created":"2018-12-12T11:39:16Z","doi":"10.15479/AT:IST-2014-315-v1-1","related_material":{"record":[{"id":"1066","status":"public","relation":"later_version"}]},"date_published":"2014-12-05T00:00:00Z","year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"05","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"b1d573bc04365625ff9974880c0aa807","file_id":"5521","creator":"system","date_updated":"2020-07-14T12:46:52Z","file_size":531046,"date_created":"2018-12-12T11:53:59Z","file_name":"IST-2014-315-v1+1_report.pdf"}]},{"date_updated":"2021-01-12T06:50:14Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:47Z","_id":"1374","series_title":"Leibniz International Proceedings in Informatics","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CSL: Computer Science Logic","end_date":"2013-09-05","location":"Torino, Italy","start_date":"203-09-02"},"type":"conference","pubrep_id":"624","status":"public","publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"b7091a3866db573c0db5ec486952255e","file_id":"5023","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:13:38Z","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","date_updated":"2020-07-14T12:44:47Z","file_size":547296,"creator":"system"}],"ec_funded":1,"volume":23,"abstract":[{"text":"We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 23","month":"09","citation":{"mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: 22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181","apa":"Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181","short":"K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.","ista":"Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5837","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nathanaël","last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël"}],"title":"Infinite-state games with finitary conditions","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"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"}],"year":"2013","has_accepted_license":"1","publication":"22nd EACSL Annual Conference on Computer Science Logic","day":"01","page":"181 - 196","date_created":"2018-12-11T11:51:39Z","date_published":"2013-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2013.181","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","mla":"Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.","apa":"Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013."},"title":"Multi-objective discounted reward verification in graphs and MDPs","publist_id":"4723","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"full_name":"Wojtczak, Dominik","last_name":"Wojtczak","first_name":"Dominik"}],"publisher":"Springer","quality_controlled":"1","day":"01","year":"2013","doi":"10.1007/978-3-642-45221-5_17","date_published":"2013-12-01T00:00:00Z","date_created":"2018-12-11T11:56:30Z","page":"228 - 242","_id":"2238","series_title":"Lecture Notes in Computer Science","status":"public","type":"conference","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2013-12-14","location":"Stellenbosch, South Africa","end_date":"2013-12-19"},"date_updated":"2020-08-11T10:09:42Z","department":[{"_id":"KrCh"}],"oa_version":"None","abstract":[{"text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n","lang":"eng"}],"month":"12","intvolume":" 8312","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","volume":8312,"ec_funded":1},{"doi":"10.1007/978-3-642-40313-2","volume":8087,"date_published":"2013-08-08T00:00:00Z","date_created":"2018-12-11T11:56:48Z","page":"VI - 854","day":"08","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-642-40312-5"]},"year":"2013","publication_status":"published","month":"08","intvolume":" 8087","publisher":"Springer","quality_controlled":"1","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence."}],"editor":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Sgall","full_name":"Sgall, Jiri","first_name":"Jiri"}],"title":"Mathematical Foundations of Computer Science 2013","department":[{"_id":"KrCh"}],"publist_id":"4636","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","ama":"Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science 2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2","apa":"Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2","mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2.","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2."},"date_updated":"2020-08-11T10:09:45Z","status":"public","type":"conference_editor","conference":{"location":"Klosterneuburg, Austria","end_date":"2013-08-30","start_date":"2013-08-26","name":"MFCS: Mathematical Foundations of Computer Science"},"_id":"2292","series_title":"Lecture Notes in Computer Science"},{"file":[{"file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","date_created":"2018-12-12T10:11:53Z","creator":"system","file_size":277372,"date_updated":"2020-07-14T12:45:37Z","file_id":"4910","checksum":"57b06a732dd8d6349190dba6b5b0d33b","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":15,"issue":"5-6","oa_version":"Submitted Version","abstract":[{"text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol.","lang":"eng"}],"month":"10","intvolume":" 15","scopus_import":1,"ddc":["000"],"date_updated":"2021-01-12T06:56:37Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:37Z","_id":"2299","status":"public","pubrep_id":"87","type":"journal_article","day":"01","publication":"International Journal on Software Tools for Technology Transfer","has_accepted_license":"1","year":"2013","date_published":"2013-10-01T00:00:00Z","doi":"10.1007/s10009-011-0207-9","date_created":"2018-12-11T11:56:51Z","page":"585 - 601","quality_controlled":"1","publisher":"Springer","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.","apa":"Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9."},"title":"Synthesis of AMBA AHB from formal specification: A case study","publist_id":"4629","author":[{"id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","first_name":"Yashdeep","last_name":"Godhal","full_name":"Godhal, Yashdeep"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"series_title":"Lecture Notes in Computer Science","_id":"2446","status":"public","type":"conference","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"date_updated":"2020-08-11T10:09:47Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements."}],"month":"07","intvolume":" 8044","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.5281","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":8044,"ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.","short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","apa":"Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37","ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:10.1007/978-3-642-39799-8_37","mla":"Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37."},"title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Gaiser","full_name":"Gaiser, Andreas","first_name":"Andreas"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4457","external_id":{"arxiv":["1304.5281"]},"quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","year":"2013","date_published":"2013-07-01T00:00:00Z","doi":"10.1007/978-3-642-39799-8_37","date_created":"2018-12-11T11:57:42Z","page":"559 - 575"}]