[{"department":[{"_id":"KrCh"}],"title":"CEGAR for qualitative analysis of probabilistic systems","publication_identifier":{"issn":["2664-1690"]},"page":"31","year":"2014","month":"01","oa_version":"Published Version","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:47Z","file_size":423322,"checksum":"4d6cda4bebed970926403ad6ad8c745f","date_created":"2018-12-12T11:53:39Z","file_name":"IST-2014-153-v1+1_main.pdf","creator":"system","file_id":"5500","relation":"main_file"}],"ddc":["000"],"type":"technical_report","citation":{"chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">10.15479/AT:IST-2014-153-v1-1</a>"},"date_created":"2018-12-12T11:39:11Z","publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5412","publisher":"IST Austria","pubrep_id":"153","oa":1,"status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"doi":"10.15479/AT:IST-2014-153-v1-1","file_date_updated":"2020-07-14T12:46:47Z","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"relation":"later_version","status":"public","id":"5413"},{"id":"5414","relation":"later_version","status":"public"}]},"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"date_published":"2014-01-29T00:00:00Z","day":"29","date_updated":"2023-02-23T12:25:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"doi":"10.15479/AT:IST-2014-153-v2-2","file_date_updated":"2020-07-14T12:46:47Z","status":"public","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"}],"day":"06","date_updated":"2023-02-23T12:25:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"2063"},{"status":"public","relation":"earlier_version","id":"5412"},{"status":"public","relation":"later_version","id":"5414"}]},"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"date_published":"2014-02-06T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"page":"33","year":"2014","month":"02","department":[{"_id":"KrCh"}],"title":"CEGAR for qualitative analysis of probabilistic systems","publisher":"IST Austria","pubrep_id":"164","oa":1,"file":[{"file_name":"IST-2014-153-v2+2_main.pdf","creator":"system","file_id":"5539","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:47Z","checksum":"ce4967a184d84863eec76c66cbac1614","file_size":606049,"date_created":"2018-12-12T11:54:17Z"}],"oa_version":"Published Version","ddc":["000"],"type":"technical_report","date_created":"2018-12-12T11:39:11Z","citation":{"ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","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, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>."},"publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5413"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"status":"public","doi":"10.15479/AT:IST-2014-153-v3-1","file_date_updated":"2020-07-14T12:46:48Z","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"has_accepted_license":"1","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"id":"5412","status":"public","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5413"}]},"date_published":"2014-02-07T00:00:00Z","date_updated":"2023-02-23T12:25:15Z","day":"07","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"publication_identifier":{"issn":["2664-1690"]},"month":"02","year":"2014","page":"33","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>.","apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>.","ama":"Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p."},"date_created":"2018-12-12T11:39:12Z","oa_version":"Published Version","ddc":["000"],"type":"technical_report","file":[{"file_name":"IST-2014-153-v3+1_main.pdf","creator":"system","file_id":"5464","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:48Z","checksum":"87b93fe9af71fc5c94b0eb6151537e11","file_size":606227,"date_created":"2018-12-12T11:53:03Z"}],"_id":"5414","publication_status":"published","alternative_title":["IST Austria Technical Report"],"pubrep_id":"165","publisher":"IST Austria","oa":1},{"publication_identifier":{"issn":["2664-1690"]},"month":"02","year":"2014","page":"27","title":"Nested weighted automata","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"170","publisher":"IST Austria","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2014). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2014.","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014."},"date_created":"2018-12-12T11:39:12Z","type":"technical_report","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:48Z","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","file_size":573457,"date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf","creator":"system","file_id":"5497","relation":"main_file"}],"oa_version":"Published Version","ddc":["004"],"_id":"5415","alternative_title":["IST Austria Technical Report"],"publication_status":"published","doi":"10.15479/AT:IST-2014-170-v1-1","file_date_updated":"2020-07-14T12:46:48Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"status":"public","date_updated":"2023-02-23T12:26:19Z","day":"19","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"related_material":{"record":[{"id":"1656","relation":"later_version","status":"public"},{"status":"public","relation":"later_version","id":"467"},{"id":"5436","status":"public","relation":"later_version"}]},"has_accepted_license":"1","date_published":"2014-02-19T00:00:00Z"},{"doi":"10.15479/AT:IST-2014-171-v1-1","file_date_updated":"2020-07-14T12:46:49Z","status":"public","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"day":"19","date_updated":"2023-02-23T10:33:21Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"2217"}]},"has_accepted_license":"1","abstract":[{"text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem.","lang":"eng"}],"date_published":"2014-02-19T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"page":"22","year":"2014","month":"02","department":[{"_id":"ToHe"}],"title":"Model measuring for hybrid systems","publisher":"IST Austria","pubrep_id":"171","oa":1,"oa_version":"Published Version","type":"technical_report","file":[{"date_updated":"2020-07-14T12:46:49Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T11:53:32Z","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_size":712077,"file_name":"IST-2014-171-v1+1_report.pdf","relation":"main_file","creator":"system","file_id":"5492"}],"ddc":["005"],"date_created":"2018-12-12T11:39:12Z","citation":{"apa":"Henzinger, T. A., &#38; Otop, J. (2014). <i>Model measuring for hybrid systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>","chicago":"Henzinger, Thomas A, and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>.","mla":"Henzinger, Thomas A., and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>.","ama":"Henzinger TA, Otop J. <i>Model Measuring for Hybrid Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","ieee":"T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST Austria, 2014."},"alternative_title":["IST Austria Technical Report"],"publication_status":"published","_id":"5416"},{"department":[{"_id":"ToHe"}],"title":"From model checking to model measuring","publication_identifier":{"issn":["2664-1690"]},"page":"14","month":"02","year":"2014","ddc":["000"],"oa_version":"Published Version","type":"technical_report","file":[{"file_name":"IST-2014-172-v1+1_report.pdf","relation":"main_file","file_id":"5481","creator":"system","date_updated":"2020-07-14T12:46:49Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T11:53:20Z","file_size":383052,"checksum":"fcc3eab903cfcd3778b338d2d0d44d18"}],"date_created":"2018-12-12T11:39:13Z","citation":{"ama":"Henzinger TA, Otop J. <i>From Model Checking to Model Measuring</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">10.15479/AT:IST-2014-172-v1-1</a>","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.","ieee":"T. A. Henzinger and J. Otop, <i>From model checking to model measuring</i>. IST Austria, 2014.","apa":"Henzinger, T. A., &#38; Otop, J. (2014). <i>From model checking to model measuring</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">https://doi.org/10.15479/AT:IST-2014-172-v1-1</a>","chicago":"Henzinger, Thomas A, and Jan Otop. <i>From Model Checking to Model Measuring</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">https://doi.org/10.15479/AT:IST-2014-172-v1-1</a>.","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-172-v1-1\">10.15479/AT:IST-2014-172-v1-1</a>."},"alternative_title":["IST Austria Technical Report"],"publication_status":"published","_id":"5417","publisher":"IST Austria","pubrep_id":"175","oa":1,"status":"public","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"doi":"10.15479/AT:IST-2014-172-v1-1","file_date_updated":"2020-07-14T12:46:49Z","related_material":{"record":[{"id":"2327","relation":"later_version","status":"public"}]},"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M'within distance ρ from M satisfy (or violate)φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata.\r\nThe model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification.\r\nWe show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.\r\nWe use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. \r\nWe give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications."}],"date_published":"2014-02-19T00:00:00Z","day":"19","date_updated":"2023-02-23T10:38:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"date_created":"2018-12-12T11:39:13Z","citation":{"ieee":"K. Chatterjee and L. Doyen, <i>Games with a weak adversary</i>. IST Austria, 2014.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","ama":"Chatterjee K, Doyen L. <i>Games with a Weak Adversary</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). <i>Games with a weak adversary</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>"},"oa_version":"Published Version","ddc":["000","005"],"type":"technical_report","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:49Z","checksum":"1d6958aa60050e1c3e932c6e5f34c39f","file_size":328253,"date_created":"2018-12-12T11:53:07Z","file_name":"IST-2014-176-v1+1_icalp_14.pdf","creator":"system","file_id":"5468","relation":"main_file"}],"_id":"5418","alternative_title":["IST Austria Technical Report"],"publication_status":"published","pubrep_id":"176","publisher":"IST Austria","oa":1,"title":"Games with a weak adversary","department":[{"_id":"KrCh"}],"publication_identifier":{"issn":["2664-1690"]},"month":"03","year":"2014","page":"18","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, 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.","lang":"eng"}],"related_material":{"record":[{"id":"2163","relation":"later_version","status":"public"}]},"has_accepted_license":"1","date_published":"2014-03-22T00:00:00Z","date_updated":"2023-02-23T10:30:58Z","day":"22","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"status":"public","doi":"10.15479/AT:IST-2014-176-v1-1","file_date_updated":"2020-07-14T12:46:49Z"},{"pubrep_id":"187","publisher":"IST Austria","oa":1,"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">10.15479/AT:IST-2014-187-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.","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, <i>Improved algorithms for reachability and shortest path on low tree-width graphs</i>. IST Austria, 2014.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2014). <i>Improved algorithms for reachability and shortest path on low tree-width graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">https://doi.org/10.15479/AT:IST-2014-187-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">https://doi.org/10.15479/AT:IST-2014-187-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-187-v1-1\">10.15479/AT:IST-2014-187-v1-1</a>."},"date_created":"2018-12-12T11:39:13Z","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:50Z","checksum":"c608e66030a4bf51d2d99b451f539b99","file_size":670031,"date_created":"2018-12-12T11:54:25Z","file_name":"IST-2014-187-v1+1_main_full_tech.pdf","file_id":"5548","creator":"system","relation":"main_file"}],"ddc":["000"],"type":"technical_report","oa_version":"Published Version","_id":"5419","alternative_title":["IST Austria Technical Report"],"publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"year":"2014","month":"04","page":"34","title":"Improved algorithms for reachability and shortest path on low tree-width graphs","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:02:03Z","day":"14","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"has_accepted_license":"1","date_published":"2014-04-14T00:00:00Z","doi":"10.15479/AT:IST-2014-187-v1-1","file_date_updated":"2020-07-14T12:46:50Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"status":"public"},{"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"}],"has_accepted_license":"1","date_published":"2014-04-14T00:00:00Z","date_updated":"2021-01-12T08:02:05Z","day":"14","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"status":"public","doi":"10.15479/AT:IST-2014-191-v1-1","file_date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:39:14Z","citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.","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, <i>The value 1 problem for concurrent mean-payoff games</i>. IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">10.15479/AT:IST-2014-191-v1-1</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">https://doi.org/10.15479/AT:IST-2014-191-v1-1</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). <i>The value 1 problem for concurrent mean-payoff games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">https://doi.org/10.15479/AT:IST-2014-191-v1-1</a>","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Value 1 Problem for Concurrent Mean-Payoff Games</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-191-v1-1\">10.15479/AT:IST-2014-191-v1-1</a>."},"oa_version":"Published Version","ddc":["000","005"],"file":[{"date_updated":"2020-07-14T12:46:50Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T11:53:58Z","checksum":"49e0fd3e62650346daf7dc04604f7a0a","file_size":584368,"file_name":"IST-2014-191-v1+1_main_full.pdf","relation":"main_file","file_id":"5520","creator":"system"}],"type":"technical_report","_id":"5420","publication_status":"published","alternative_title":["IST Austria Technical Report"],"pubrep_id":"191","publisher":"IST Austria","oa":1,"title":"The value 1 problem for concurrent mean-payoff games","department":[{"_id":"KrCh"}],"publication_identifier":{"issn":["2664-1690"]},"month":"04","year":"2014","page":"49"},{"publisher":"IST Austria","pubrep_id":"190","oa":1,"oa_version":"Published Version","ddc":["000","005"],"type":"technical_report","file":[{"relation":"main_file","file_id":"5538","creator":"system","file_name":"IST-2014-190-v2+2_main_full.pdf","date_created":"2018-12-12T11:54:16Z","file_size":443529,"checksum":"42f3d8b563286eb0d903832bd9a848d3","date_updated":"2020-07-14T12:46:50Z","access_level":"open_access","content_type":"application/pdf"},{"date_created":"2019-09-06T07:30:20Z","file_size":440911,"checksum":"0c9a2fd822309719634495a35957e34d","date_updated":"2020-07-14T12:46:50Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"6852","creator":"kschuh","file_name":"IST-2014-190-v1+1_main_full.pdf"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolution on Graphs</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">10.15479/AT:IST-2014-190-v2-2</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolution on graphs</i>. IST Austria, 2014.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2014). <i>The complexity of evolution on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">https://doi.org/10.15479/AT:IST-2014-190-v2-2</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolution on Graphs</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">https://doi.org/10.15479/AT:IST-2014-190-v2-2</a>.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolution on Graphs</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-190-v2-2\">10.15479/AT:IST-2014-190-v2-2</a>."},"date_created":"2018-12-12T11:39:14Z","alternative_title":["IST Austria Technical Report"],"publication_status":"published","_id":"5421","publication_identifier":{"issn":["2664-1690"]},"page":"27","month":"04","year":"2014","department":[{"_id":"KrCh"}],"title":"The complexity of evolution on graphs","day":"18","date_updated":"2023-02-23T12:26:33Z","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"5432"},{"relation":"later_version","status":"public","id":"5440"}]},"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 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."}],"date_published":"2014-04-18T00:00:00Z","doi":"10.15479/AT:IST-2014-190-v2-2","file_date_updated":"2020-07-14T12:46:50Z","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"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"}]},{"publisher":"IST Austria","pubrep_id":"300","oa":1,"ddc":["005"],"oa_version":"Published Version","type":"technical_report","file":[{"file_size":1270021,"checksum":"4b8fde4d9ef6653837f6803921d83032","date_created":"2018-12-12T11:53:53Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:50Z","creator":"system","file_id":"5514","relation":"main_file","file_name":"IST-2014-300-v1+1_main.pdf"}],"date_created":"2018-12-12T11:39:15Z","citation":{"ama":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">10.15479/AT:IST-2014-300-v1-1</a>","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.","ieee":"K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, <i>A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks</i>. IST Austria, 2014.","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.","mla":"Chatterjee, Krishnendu, et al. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">10.15479/AT:IST-2014-300-v1-1</a>.","apa":"Chatterjee, K., Kössler, A., Pavlogiannis, A., &#38; Schmid, U. (2014). <i>A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">https://doi.org/10.15479/AT:IST-2014-300-v1-1</a>","chicago":"Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">https://doi.org/10.15479/AT:IST-2014-300-v1-1</a>."},"alternative_title":["IST Austria Technical Report"],"publication_status":"published","_id":"5423","publication_identifier":{"issn":["2664-1690"]},"page":"14","year":"2014","month":"07","department":[{"_id":"KrCh"}],"title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","day":"29","date_updated":"2023-02-23T10:11:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1714"}]},"has_accepted_license":"1","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. "}],"date_published":"2014-07-29T00:00:00Z","doi":"10.15479/AT:IST-2014-300-v1-1","file_date_updated":"2020-07-14T12:46:50Z","status":"public","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Alexander","last_name":"Kössler","full_name":"Kössler, Alexander"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"first_name":"Ulrich","last_name":"Schmid","full_name":"Schmid, Ulrich"}]},{"doi":"10.15479/AT:IST-2014-305-v1-1","file_date_updated":"2020-07-14T12:46:51Z","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Raghav","last_name":"Gupta","full_name":"Gupta, Raghav"},{"first_name":"Ayush","last_name":"Kanodia","full_name":"Kanodia, Ayush"}],"day":"09","date_updated":"2023-02-23T12:25:52Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","related_material":{"record":[{"id":"1732","status":"public","relation":"later_version"},{"status":"public","relation":"later_version","id":"5426"}]},"abstract":[{"lang":"eng","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."}],"date_published":"2014-09-09T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"page":"12","month":"09","year":"2014","department":[{"_id":"KrCh"}],"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","publisher":"IST Austria","pubrep_id":"305","oa":1,"oa_version":"Published Version","ddc":["005"],"type":"technical_report","file":[{"checksum":"35009d5fad01198341e6c1a3353481b7","file_size":655774,"date_created":"2018-12-12T11:53:51Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:51Z","creator":"system","file_id":"5512","relation":"main_file","file_name":"IST-2014-305-v1+1_main.pdf"}],"date_created":"2018-12-12T11:39:15Z","citation":{"ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-305-v1-1\">10.15479/AT:IST-2014-305-v1-1</a>","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, <i>Qualitative analysis of POMDPs with temporal logic specifications for robotics applications</i>. IST Austria, 2014.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-305-v1-1\">10.15479/AT:IST-2014-305-v1-1</a>.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2014). <i>Qualitative analysis of POMDPs with temporal logic specifications for robotics applications</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-305-v1-1\">https://doi.org/10.15479/AT:IST-2014-305-v1-1</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-305-v1-1\">https://doi.org/10.15479/AT:IST-2014-305-v1-1</a>."},"publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5424"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"1732"},{"id":"5424","status":"public","relation":"earlier_version"}]},"has_accepted_license":"1","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"}],"date_published":"2014-09-29T00:00:00Z","day":"29","date_updated":"2023-02-23T12:25:47Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Gupta","full_name":"Gupta, Raghav","first_name":"Raghav"},{"full_name":"Kanodia, Ayush","last_name":"Kanodia","first_name":"Ayush"}],"doi":"10.15479/AT:IST-2014-305-v2-1","file_date_updated":"2020-07-14T12:46:51Z","oa_version":"Published Version","ddc":["005"],"type":"technical_report","file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:51Z","checksum":"730c0a8e97cf2712a884b2cc423f3919","file_size":656019,"date_created":"2018-12-12T11:54:15Z","file_name":"IST-2014-305-v2+1_main2.pdf","creator":"system","file_id":"5537","relation":"main_file"}],"date_created":"2018-12-12T11:39:16Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-305-v2-1\">10.15479/AT:IST-2014-305-v2-1</a>.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-305-v2-1\">https://doi.org/10.15479/AT:IST-2014-305-v2-1</a>.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2014). <i>Qualitative analysis of POMDPs with temporal logic specifications for robotics applications</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-305-v2-1\">https://doi.org/10.15479/AT:IST-2014-305-v2-1</a>","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, <i>Qualitative analysis of POMDPs with temporal logic specifications for robotics applications</i>. 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.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. <i>Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-305-v2-1\">10.15479/AT:IST-2014-305-v2-1</a>"},"publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5426","publisher":"IST Austria","pubrep_id":"311","oa":1,"department":[{"_id":"KrCh"}],"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","publication_identifier":{"issn":["2664-1690"]},"page":"10","month":"09","year":"2014"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T08:02:09Z","day":"05","date_published":"2014-11-05T00:00:00Z","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"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:52Z","doi":"10.15479/AT:IST-2014-314-v1-1","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"}],"status":"public","oa":1,"pubrep_id":"314","publisher":"IST Austria","_id":"5427","publication_status":"published","alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:16Z","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.","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, <i>Optimal tree-decomposition balancing and reachability on low treewidth graphs</i>. IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-314-v1-1\">10.15479/AT:IST-2014-314-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-314-v1-1\">https://doi.org/10.15479/AT:IST-2014-314-v1-1</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2014). <i>Optimal tree-decomposition balancing and reachability on low treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-314-v1-1\">https://doi.org/10.15479/AT:IST-2014-314-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-314-v1-1\">10.15479/AT:IST-2014-314-v1-1</a>."},"type":"technical_report","oa_version":"Published Version","ddc":["000"],"file":[{"file_name":"IST-2014-314-v1+1_long.pdf","creator":"system","file_id":"5471","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:52Z","file_size":405561,"checksum":"9d3b90bf4fff74664f182f2d95ef727a","date_created":"2018-12-12T11:53:10Z"}],"year":"2014","month":"11","page":"24","publication_identifier":{"issn":["2664-1690"]},"title":"Optimal tree-decomposition balancing and reachability on low treewidth graphs","department":[{"_id":"KrCh"}]},{"date_published":"2014-12-05T00:00:00Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1066"}]},"has_accepted_license":"1","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."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"05","date_updated":"2023-09-20T12:07:48Z","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"file_date_updated":"2020-07-14T12:46:52Z","doi":"10.15479/AT:IST-2014-315-v1-1","publication_status":"published","alternative_title":["IST Austria Technical Report"],"_id":"5428","oa_version":"Published Version","ddc":["004"],"type":"technical_report","file":[{"file_id":"5521","creator":"system","relation":"main_file","file_name":"IST-2014-315-v1+1_report.pdf","checksum":"b1d573bc04365625ff9974880c0aa807","file_size":531046,"date_created":"2018-12-12T11:53:59Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:52Z"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. <i>Quantitative Fair Simulation Games</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-315-v1-1\">10.15479/AT:IST-2014-315-v1-1</a>","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, <i>Quantitative fair simulation games</i>. IST Austria, 2014.","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.","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., &#38; Velner, Y. (2014). <i>Quantitative fair simulation games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-315-v1-1\">https://doi.org/10.15479/AT:IST-2014-315-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. <i>Quantitative Fair Simulation Games</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-315-v1-1\">https://doi.org/10.15479/AT:IST-2014-315-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Fair Simulation Games</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-315-v1-1\">10.15479/AT:IST-2014-315-v1-1</a>."},"date_created":"2018-12-12T11:39:16Z","oa":1,"publisher":"IST Austria","pubrep_id":"315","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Quantitative fair simulation games","page":"26","year":"2014","month":"12","publication_identifier":{"issn":["2664-1690"]}},{"quality_controlled":"1","citation":{"ama":"Smutny M, Behrndt M, Campinho P, Ruprecht V, Heisenberg C-PJ. UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In: Nelson C, ed. <i>Tissue Morphogenesis</i>. Vol 1189. Methods in Molecular Biology. New York, NY: Springer; 2014:219-235. doi:<a href=\"https://doi.org/10.1007/978-1-4939-1164-6_15\">10.1007/978-1-4939-1164-6_15</a>","ieee":"M. Smutny, M. Behrndt, P. Campinho, V. Ruprecht, and C.-P. J. Heisenberg, “UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo,” in <i>Tissue Morphogenesis</i>, vol. 1189, C. Nelson, Ed. New York, NY: Springer, 2014, pp. 219–235.","short":"M. Smutny, M. Behrndt, P. Campinho, V. Ruprecht, C.-P.J. Heisenberg, in:, C. Nelson (Ed.), Tissue Morphogenesis, Springer, New York, NY, 2014, pp. 219–235.","ista":"Smutny M, Behrndt M, Campinho P, Ruprecht V, Heisenberg C-PJ. 2014.UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In: Tissue Morphogenesis. vol. 1189, 219–235.","mla":"Smutny, Michael, et al. “UV Laser Ablation to Measure Cell and Tissue-Generated Forces in the Zebrafish Embryo in Vivo and Ex Vivo.” <i>Tissue Morphogenesis</i>, edited by Celeste Nelson, vol. 1189, Springer, 2014, pp. 219–35, doi:<a href=\"https://doi.org/10.1007/978-1-4939-1164-6_15\">10.1007/978-1-4939-1164-6_15</a>.","apa":"Smutny, M., Behrndt, M., Campinho, P., Ruprecht, V., &#38; Heisenberg, C.-P. J. (2014). UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo. In C. Nelson (Ed.), <i>Tissue Morphogenesis</i> (Vol. 1189, pp. 219–235). New York, NY: Springer. <a href=\"https://doi.org/10.1007/978-1-4939-1164-6_15\">https://doi.org/10.1007/978-1-4939-1164-6_15</a>","chicago":"Smutny, Michael, Martin Behrndt, Pedro Campinho, Verena Ruprecht, and Carl-Philipp J Heisenberg. “UV Laser Ablation to Measure Cell and Tissue-Generated Forces in the Zebrafish Embryo in Vivo and Ex Vivo.” In <i>Tissue Morphogenesis</i>, edited by Celeste Nelson, 1189:219–35. Methods in Molecular Biology. New York, NY: Springer, 2014. <a href=\"https://doi.org/10.1007/978-1-4939-1164-6_15\">https://doi.org/10.1007/978-1-4939-1164-6_15</a>."},"date_created":"2019-03-26T08:55:59Z","page":"219-235","title":"UV laser ablation to measure cell and tissue-generated forces in the zebrafish embryo in vivo and ex vivo","place":"New York, NY","pmid":1,"volume":1189,"day":"22","publication":"Tissue Morphogenesis","date_published":"2014-08-22T00:00:00Z","editor":[{"first_name":"Celeste","full_name":"Nelson, Celeste","last_name":"Nelson"}],"intvolume":"      1189","doi":"10.1007/978-1-4939-1164-6_15","article_processing_charge":"No","publisher":"Springer","_id":"6178","external_id":{"pmid":["25245697"]},"publication_status":"published","oa_version":"None","type":"book_chapter","month":"08","year":"2014","publication_identifier":{"eissn":["1940-6029"],"issn":["1064-3745"],"isbn":["9781493911639","9781493911646"]},"department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","series_title":"Methods in Molecular Biology","date_updated":"2023-09-05T14:12:00Z","abstract":[{"text":"Mechanically coupled cells can generate forces driving cell and tissue morphogenesis during development. Visualization and measuring of these forces is of major importance to better understand the complexity of the biomechanic processes that shape cells and tissues. Here, we describe how UV laser ablation can be utilized to quantitatively assess mechanical tension in different tissues of the developing zebrafish and in cultures of primary germ layer progenitor cells ex vivo.","lang":"eng"}],"author":[{"id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","orcid":"0000-0002-5920-9090","full_name":"Smutny, Michael","last_name":"Smutny"},{"last_name":"Behrndt","full_name":"Behrndt, Martin","first_name":"Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","first_name":"Pedro","orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro","last_name":"Campinho"},{"last_name":"Ruprecht","full_name":"Ruprecht, Verena","orcid":"0000-0003-4088-8633","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","first_name":"Verena"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"status":"public"},{"title":"Random matrices, log-gases and Hölder regularity","publist_id":"5670","page":"214 - 236","conference":{"location":"Seoul, Korea","end_date":"2014-08-21","name":"ICM: International Congress of Mathematicians","start_date":"2014-08-13"},"quality_controlled":"1","date_created":"2018-12-11T11:52:25Z","citation":{"mla":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” <i>Proceedings of the International Congress of Mathematicians</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 214–36.","apa":"Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In <i>Proceedings of the International Congress of Mathematicians</i> (Vol. 3, pp. 214–236). Seoul, Korea: International Congress of Mathematicians.","chicago":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In <i>Proceedings of the International Congress of Mathematicians</i>, 3:214–36. International Congress of Mathematicians, 2014.","ama":"Erdös L. Random matrices, log-gases and Hölder regularity. In: <i>Proceedings of the International Congress of Mathematicians</i>. Vol 3. International Congress of Mathematicians; 2014:214-236.","ista":"Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings of the International Congress of Mathematicians. ICM: International Congress of Mathematicians vol. 3, 214–236.","short":"L. Erdös, in:, Proceedings of the International Congress of Mathematicians, International Congress of Mathematicians, 2014, pp. 214–236.","ieee":"L. Erdös, “Random matrices, log-gases and Hölder regularity,” in <i>Proceedings of the International Congress of Mathematicians</i>, Seoul, Korea, 2014, vol. 3, pp. 214–236."},"oa":1,"article_processing_charge":"No","ec_funded":1,"date_published":"2014-08-01T00:00:00Z","intvolume":"         3","volume":3,"publication":"Proceedings of the International Congress of Mathematicians","day":"01","acknowledgement":"The author is partially supported by SFB-TR 12 Grant of the German Research Council.","department":[{"_id":"LaEr"}],"month":"08","year":"2014","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"_id":"1507","publication_status":"published","oa_version":"Submitted Version","type":"conference","publisher":"International Congress of Mathematicians","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László"}],"status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the symmetry class of the matrix and otherwise are independent of the details of the distribution. We present the recent solution to this half-century old conjecture. We explain how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also show related results for log-gases that represent a universal model for strongly correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss the extensions of these universality results to more realistic physical systems such as random band matrices."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.5752"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-17T11:12:55Z"},{"publisher":"World Scientific Publishing","oa":1,"type":"conference","oa_version":"Preprint","citation":{"ama":"Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid fermionic gases. In: <i>Proceedings of the QMath12 Conference</i>. World Scientific Publishing; 2014:127-137. doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>","ieee":"G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid fermionic gases,” in <i>Proceedings of the QMath12 Conference</i>, Berlin, Germany, 2014, pp. 127–137.","short":"G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–137.","ista":"Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results in Quantum Physics, 127–137.","apa":"Bräunlich, G., Hainzl, C., &#38; Seiringer, R. (2014). On the BCS gap equation for superfluid fermionic gases. In <i>Proceedings of the QMath12 Conference</i> (pp. 127–137). Berlin, Germany: World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>","chicago":"Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS Gap Equation for Superfluid Fermionic Gases.” In <i>Proceedings of the QMath12 Conference</i>, 127–37. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>.","mla":"Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic Gases.” <i>Proceedings of the QMath12 Conference</i>, World Scientific Publishing, 2014, pp. 127–37, doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>."},"date_created":"2018-12-11T11:52:28Z","arxiv":1,"external_id":{"arxiv":["1403.2563"]},"quality_controlled":"1","publication_status":"published","_id":"1516","conference":{"end_date":"2013-09-13","location":"Berlin, Germany","name":"QMath: Mathematical Results in Quantum Physics","start_date":"2013-09-10"},"publist_id":"5661","page":"127 - 137","month":"01","year":"2014","department":[{"_id":"RoSe"}],"title":"On the BCS gap equation for superfluid fermionic gases","publication":"Proceedings of the QMath12 Conference","day":"01","date_updated":"2021-01-12T06:51:19Z","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1403.2563","open_access":"1"}],"abstract":[{"lang":"eng","text":"We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero.\r\n"}],"date_published":"2014-01-01T00:00:00Z","doi":"10.1142/9789814618144_0007","status":"public","author":[{"last_name":"Bräunlich","full_name":"Bräunlich, Gerhard","first_name":"Gerhard"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No"},{"status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"},{"last_name":"Raskin","full_name":"Raskin, Michael","first_name":"Michael"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.4473"}],"abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2022-09-09T11:50:58Z","article_type":"original","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"08","year":"2014","external_id":{"arxiv":["1307.4473"]},"publication_status":"published","issue":"C","_id":"1375","oa_version":"Preprint","type":"journal_article","publisher":"Elsevier","ec_funded":1,"article_processing_charge":"No","doi":"10.1016/j.tcs.2014.06.031","date_published":"2014-08-28T00:00:00Z","intvolume":"       547","publication":"Theoretical Computer Science","day":"28","volume":547,"title":"Approximating the minimum cycle mean","page":"104 - 116","publist_id":"5836","arxiv":1,"quality_controlled":"1","date_created":"2018-12-11T11:51:40Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., &#38; Raskin, M. (2014). Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. 2014;547(C):104-116. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","ista":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” <i>Theoretical Computer Science</i>, vol. 547, no. C. Elsevier, pp. 104–116, 2014."},"oa":1},{"day":"01","acknowledgement":"Supported by the Vienna Science and Technology Fund (WWTF) through grant PROSEED.","volume":8318,"date_published":"2014-01-01T00:00:00Z","intvolume":"      8318","has_accepted_license":"1","file_date_updated":"2020-07-14T12:44:48Z","doi":"10.1007/978-3-642-54013-4_10","ec_funded":1,"oa":1,"quality_controlled":"1","conference":{"start_date":"2014-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2014-01-21","location":"San Diego, USA"},"citation":{"chicago":"Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>.","apa":"Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &#38; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>","mla":"Dragoi, Cezara, et al. <i>A Logic-Based Framework for Verifying Consensus Algorithms</i>. Vol. 8318, Springer, 2014, pp. 161–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>.","short":"C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181.","ieee":"C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.","ista":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.","ama":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>"},"date_created":"2018-12-11T11:51:45Z","page":"161 - 181","publist_id":"5817","title":"A logic-based framework for verifying consensus algorithms","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:50:22Z","scopus_import":1,"abstract":[{"lang":"eng","text":"Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption)."}],"status":"public","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Helmut","full_name":"Veith, Helmut","last_name":"Veith"},{"full_name":"Widder, Josef","last_name":"Widder","first_name":"Josef"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey"}],"publisher":"Springer","pubrep_id":"179","publication_status":"published","alternative_title":["LNCS"],"_id":"1392","ddc":["000","005"],"type":"conference","file":[{"file_name":"IST-2014-179-v1+1_vmcai14.pdf","file_id":"4859","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:44:48Z","checksum":"bffa33d39be77df0da39defe97eabf84","file_size":444138,"date_created":"2018-12-12T10:11:06Z"}],"oa_version":"Submitted Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"year":"2014","month":"01","department":[{"_id":"ToHe"}]}]