[{"language":[{"iso":"eng"}],"intvolume":"         5","month":"08","department":[{"_id":"CaUh"}],"status":"public","publication":"Journal of Privacy and Confidentiality ","date_updated":"2021-01-12T06:54:41Z","publist_id":"5067","publisher":"Carnegie Mellon University","author":[{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline"},{"full_name":"Slavkovic, Aleksandra","last_name":"Slavkovic","first_name":"Aleksandra"},{"full_name":"Fienberg, Stephen","last_name":"Fienberg","first_name":"Stephen"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2013-08-01T00:00:00Z","type":"journal_article","oa":1,"volume":5,"year":"2013","citation":{"ama":"Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. 2013;5(1):137-166. doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>","ista":"Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 5(1), 137–166.","ieee":"C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing for genome-wide association studies,” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.","chicago":"Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University, 2013. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>.","short":"C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality  5 (2013) 137–166.","apa":"Uhler, C., Slavkovic, A., &#38; Fienberg, S. (2013). Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>","mla":"Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1, Carnegie Mellon University, 2013, pp. 137–66, doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>."},"abstract":[{"text":"Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression.","lang":"eng"}],"issue":"1","_id":"2009","date_created":"2018-12-11T11:55:11Z","main_file_link":[{"url":"http://repository.cmu.edu/jpc/vol5/iss1/6","open_access":"1"}],"doi":"10.29012/jpc.v5i1.629","page":"137 - 166","day":"01","quality_controlled":"1","publication_status":"published","title":"Privacy-preserving data sharing for genome-wide association studies","article_processing_charge":"No","oa_version":"Published Version"},{"oa":1,"volume":41,"author":[{"orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","first_name":"Caroline","last_name":"Uhler"},{"first_name":"Garvesh","last_name":"Raskutti","full_name":"Raskutti, Garvesh"},{"full_name":"Bühlmann, Peter","first_name":"Peter","last_name":"Bühlmann"},{"full_name":"Yu, Bin","first_name":"Bin","last_name":"Yu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaUh"}],"publication":"The Annals of Statistics","date_updated":"2021-01-12T06:54:42Z","arxiv":1,"intvolume":"        41","publication_status":"published","title":"Geometry of the faithfulness assumption in causal inference","oa_version":"Published Version","doi":"10.1214/12-AOS1080","main_file_link":[{"url":"www.doi.org/10.1214/12-AOS1080","open_access":"1"}],"scopus_import":1,"_id":"2010","date_created":"2018-12-11T11:55:11Z","year":"2013","citation":{"mla":"Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>, vol. 41, no. 2, Institute of Mathematical Statistics, 2013, pp. 436–63, doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>.","chicago":"Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>. Institute of Mathematical Statistics, 2013. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>.","apa":"Uhler, C., Raskutti, G., Bühlmann, P., &#38; Yu, B. (2013). Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>","short":"C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013) 436–463.","ama":"Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. 2013;41(2):436-463. doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>","ista":"Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 41(2), 436–463.","ieee":"C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness assumption in causal inference,” <i>The Annals of Statistics</i>, vol. 41, no. 2. Institute of Mathematical Statistics, pp. 436–463, 2013."},"abstract":[{"text":"Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case.","lang":"eng"}],"date_published":"2013-04-01T00:00:00Z","external_id":{"arxiv":["1207.0547"]},"type":"journal_article","publisher":"Institute of Mathematical Statistics","month":"04","status":"public","publist_id":"5066","language":[{"iso":"eng"}],"quality_controlled":"1","page":"436 - 463","day":"01","issue":"2"},{"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël","last_name":"Fijalkow"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"Leibniz International Proceedings in Informatics","volume":23,"oa":1,"intvolume":"        23","department":[{"_id":"KrCh"}],"ec_funded":1,"date_updated":"2021-01-12T06:50:14Z","publication":"22nd EACSL Annual Conference on Computer Science Logic","scopus_import":1,"doi":"10.4230/LIPIcs.CSL.2013.181","title":"Infinite-state games with finitary conditions","publication_status":"published","oa_version":"Published Version","file_date_updated":"2020-07-14T12:44:47Z","citation":{"mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” <i>22nd EACSL Annual Conference on Computer Science Logic</i>, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>.","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.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In <i>22nd EACSL Annual Conference on Computer Science Logic</i> (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In <i>22nd EACSL Annual Conference on Computer Science Logic</i>, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: <i>22nd EACSL Annual Conference on Computer Science Logic</i>. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>","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.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in <i>22nd EACSL Annual Conference on Computer Science Logic</i>, Torino, Italy, 2013, vol. 23, pp. 181–196."},"year":"2013","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"}],"conference":{"end_date":"2013-09-05","location":"Torino, Italy","name":"CSL: Computer Science Logic","start_date":"203-09-02"},"file":[{"file_id":"5023","creator":"system","content_type":"application/pdf","checksum":"b7091a3866db573c0db5ec486952255e","access_level":"open_access","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","date_created":"2018-12-12T10:13:38Z","file_size":547296,"date_updated":"2020-07-14T12:44:47Z","relation":"main_file"}],"date_created":"2018-12-11T11:51:39Z","_id":"1374","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_published":"2013-09-01T00:00:00Z","ddc":["000"],"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"month":"09","publist_id":"5837","status":"public","page":"181 - 196","day":"01","quality_controlled":"1","pubrep_id":"624","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"has_accepted_license":"1"},{"related_material":{"record":[{"id":"5406","relation":"earlier_version","status":"public"}]},"date_published":"2013-12-11T00:00:00Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas"}],"status":"public","publication":"13th International Conference on Formal Methods in Computer-Aided Design","date_updated":"2023-02-23T12:24:53Z","ec_funded":1,"publist_id":"5835","month":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"oa_version":"None","title":"Distributed synthesis for LTL fragments","quality_controlled":"1","publication_status":"published","day":"11","page":"18 - 25","doi":"10.1109/FMCAD.2013.6679386","_id":"1376","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:51:40Z","conference":{"end_date":"2013-10-23","location":"Portland, OR, United States","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20"},"abstract":[{"lang":"eng","text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition."}],"year":"2013","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>"}},{"abstract":[{"lang":"eng","text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results."}],"citation":{"mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>","ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>"},"year":"2013","date_created":"2018-12-11T11:51:43Z","_id":"1385","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Portland, OR, United States","end_date":"2013-10-23","start_date":"2013-10-20"},"acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","doi":"10.1109/FMCAD.2013.6679394","main_file_link":[{"url":"http://arxiv.org/abs/1308.4767","open_access":"1"}],"oa_version":"Preprint","publication_status":"published","title":"Synthesizing multiple boolean functions using interpolation on a single proof","arxiv":1,"ec_funded":1,"date_updated":"2021-01-12T06:50:19Z","publication":"2013 Formal Methods in Computer-Aided Design","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hofferek, Georg","first_name":"Georg","last_name":"Hofferek"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"first_name":"Bettina","last_name":"Könighofer","full_name":"Könighofer, Bettina"},{"full_name":"Jiang, Jie","last_name":"Jiang","first_name":"Jie"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"oa":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"}],"day":"11","page":"77 - 84","quality_controlled":"1","language":[{"iso":"eng"}],"publist_id":"5825","status":"public","month":"12","publisher":"IEEE","type":"conference","date_published":"2013-12-11T00:00:00Z","external_id":{"arxiv":["1308.4767"]}},{"_id":"1387","file":[{"checksum":"98bc02e3793072e279ec8d364b381ff3","content_type":"application/pdf","creator":"dernst","file_id":"7857","date_updated":"2020-07-14T12:44:48Z","file_size":276982,"date_created":"2020-05-15T11:05:50Z","relation":"main_file","access_level":"open_access","file_name":"2013_ICALP_Boker.pdf"}],"date_created":"2018-12-11T11:51:44Z","conference":{"start_date":"2013-07-08","location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12"},"abstract":[{"text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.","lang":"eng"}],"year":"2013","citation":{"mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>"},"file_date_updated":"2020-07-14T12:44:48Z","article_processing_charge":"No","oa_version":"Submitted Version","publication_status":"published","title":"Nondeterminism in the presence of a diverse or unknown future","acknowledgement":"and ERC Grant QUALITY.","doi":"10.1007/978-3-642-39212-2_11","scopus_import":1,"date_updated":"2020-08-11T10:09:09Z","ec_funded":1,"department":[{"_id":"ToHe"}],"intvolume":"      7966","oa":1,"volume":7966,"series_title":"Lecture Notes in Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kuperberg, Denis","first_name":"Denis","last_name":"Kuperberg"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Skrzypczak, Michał","first_name":"Michał","last_name":"Skrzypczak"}],"has_accepted_license":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"issue":"PART 2","quality_controlled":"1","day":"01","page":"89 - 100","status":"public","publist_id":"5823","month":"07","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"ddc":["000"],"date_published":"2013-07-01T00:00:00Z","type":"conference","publisher":"Springer"},{"has_accepted_license":"1","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"}],"day":"05","page":"134","publist_id":"5802","status":"public","month":"09","alternative_title":["ISTA Thesis"],"ddc":["000"],"language":[{"iso":"eng"}],"type":"dissertation","date_published":"2013-09-05T00:00:00Z","publisher":"Institute of Science and Technology Austria","date_created":"2018-12-11T11:51:50Z","file":[{"file_id":"9176","creator":"dernst","content_type":"application/pdf","checksum":"ed2d7b52933d134e8dc69d569baa284e","success":1,"access_level":"open_access","file_name":"2013_Zufferey_thesis_final.pdf","relation":"main_file","date_updated":"2021-02-22T11:28:36Z","file_size":1514906,"date_created":"2021-02-22T11:28:36Z"},{"checksum":"cecc4c4b14225bee973d32e3dba91a55","content_type":"application/pdf","creator":"cchlebak","file_id":"10298","relation":"main_file","date_created":"2021-11-16T14:42:52Z","date_updated":"2021-11-17T13:47:58Z","file_size":1378313,"file_name":"2013_Zufferey_thesis_final_pdfa.pdf","access_level":"closed"}],"_id":"1405","abstract":[{"lang":"eng","text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point."}],"supervisor":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"citation":{"apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>"},"year":"2013","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2021-11-17T13:47:58Z","title":"Analysis of dynamic message passing programs","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","doi":"10.15479/at:ista:1405","main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"ec_funded":1,"date_updated":"2023-09-07T11:36:37Z","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"degree_awarded":"PhD","oa":1,"related_material":{"record":[{"id":"2847","status":"public","relation":"part_of_dissertation"},{"id":"3251","status":"public","relation":"part_of_dissertation"},{"id":"4361","relation":"part_of_dissertation","status":"public"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey"}]},{"month":"10","department":[{"_id":"CaHe"}],"status":"public","publist_id":"5801","date_updated":"2023-09-07T11:36:07Z","language":[{"iso":"eng"}],"degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"date_published":"2013-10-01T00:00:00Z","type":"dissertation","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"publisher":"Institute of Science and Technology Austria","author":[{"first_name":"Pedro","last_name":"Campinho","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"1406","date_created":"2018-12-11T11:51:50Z","year":"2013","citation":{"mla":"Campinho, Pedro. <i>Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading</i>. Institute of Science and Technology Austria, 2013.","chicago":"Campinho, Pedro. “Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading.” Institute of Science and Technology Austria, 2013.","apa":"Campinho, P. (2013). <i>Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading</i>. Institute of Science and Technology Austria.","short":"P. Campinho, Mechanics of Zebrafish Epiboly: Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading, Institute of Science and Technology Austria, 2013.","ama":"Campinho P. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. 2013.","ieee":"P. Campinho, “Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading,” Institute of Science and Technology Austria, 2013.","ista":"Campinho P. 2013. Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading. Institute of Science and Technology Austria."},"supervisor":[{"first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"abstract":[{"lang":"eng","text":"Epithelial spreading is a critical part of various developmental and wound repair processes. Here we use zebrafish epiboly as a model system to study the cellular and molecular mechanisms underlying the spreading of epithelial sheets. During zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the embryo to eventually cover the entire yolk cell by the end of gastrulation. The EVL leading edge is anchored through tight junctions to the yolk syncytial layer (YSL), where directly adjacent to the EVL margin a contractile actomyosin ring is formed that is thought to drive EVL epiboly. The prevalent view in the field was that the contractile ring exerts a pulling force on the EVL margin, which pulls the EVL towards the vegetal pole. However, how this force is generated and how it affects EVL morphology still remains elusive. Moreover, the cellular mechanisms mediating the increase in EVL surface area, while maintaining tissue integrity and function are still unclear. Here we show that the YSL actomyosin ring pulls on the EVL margin by two distinct force-generating mechanisms. One mechanism is based on contraction of the ring around its circumference, as previously proposed. The second mechanism is based on actomyosin retrogade flows, generating force through resistance against the substrate. The latter can function at any epiboly stage even in situations where the contraction-based mechanism is unproductive. Additionally, we demonstrate that during epiboly the EVL is subjected to anisotropic tension, which guides the orientation of EVL cell division along the main axis (animal-vegetal) of tension. The influence of tension in cell division orientation involves cell elongation and requires myosin-2 activity for proper spindle alignment. Strikingly, we reveal that tension-oriented cell divisions release anisotropic tension within the EVL and that in the absence of such divisions, EVL cells undergo ectopic fusions. We conclude that forces applied to the EVL by the action of the YSL actomyosin ring generate a tension anisotropy in the EVL that orients cell divisions, which in turn limit tissue tension increase thereby facilitating tissue spreading."}],"title":"Mechanics of zebrafish epiboly: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading","publication_status":"published","oa_version":"None","article_processing_charge":"No","page":"123","publication_identifier":{"issn":["2663-337X"]},"day":"01"},{"title":"TTP: Tool for Tumor Progression","publication_status":"published","file_date_updated":"2020-07-14T12:46:44Z","oa_version":"Published Version","doi":"10.15479/AT:IST-2013-104-v1-1","page":"17","day":"11","publication_identifier":{"issn":["2664-1690"]},"_id":"5399","date_created":"2018-12-12T11:39:07Z","has_accepted_license":"1","file":[{"content_type":"application/pdf","file_id":"5542","creator":"system","checksum":"2cc8c6e157eca1271128db80bb3dec80","file_name":"IST-2013-104-v1+1_tumortool.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:44Z","date_created":"2018-12-12T11:54:20Z","file_size":1471954,"relation":"main_file"}],"year":"2013","citation":{"mla":"Reiter, Johannes, et al. <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">10.15479/AT:IST-2013-104-v1-1</a>.","apa":"Reiter, J., Bozic, I., Chatterjee, K., &#38; Nowak, M. (2013). <i>TTP: Tool for Tumor Progression</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">https://doi.org/10.15479/AT:IST-2013-104-v1-1</a>","chicago":"Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak. <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">https://doi.org/10.15479/AT:IST-2013-104-v1-1</a>.","short":"J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.","ama":"Reiter J, Bozic I, Chatterjee K, Nowak M. <i>TTP: Tool for Tumor Progression</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-104-v1-1\">10.15479/AT:IST-2013-104-v1-1</a>","ieee":"J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, <i>TTP: Tool for Tumor Progression</i>. IST Austria, 2013.","ista":"Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p."},"pubrep_id":"104","abstract":[{"lang":"eng","text":"In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics."}],"date_published":"2013-01-11T00:00:00Z","type":"technical_report","oa":1,"related_material":{"record":[{"id":"2000","relation":"later_version","status":"public"}]},"publisher":"IST Austria","author":[{"first_name":"Johannes","last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"full_name":"Bozic, Ivana","last_name":"Bozic","first_name":"Ivana"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","department":[{"_id":"KrCh"}],"status":"public","date_updated":"2023-02-23T10:23:57Z","language":[{"iso":"eng"}],"ddc":["000"],"alternative_title":["IST Austria Technical Report"]},{"month":"02","department":[{"_id":"KrCh"}],"status":"public","date_updated":"2023-02-23T10:36:45Z","language":[{"iso":"eng"}],"ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"date_published":"2013-02-20T00:00:00Z","type":"technical_report","related_material":{"record":[{"id":"1477","relation":"later_version","status":"public"},{"id":"2295","status":"public","relation":"later_version"}]},"oa":1,"publisher":"IST Austria","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"},{"first_name":"Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","full_name":"Tracol, Mathieu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5400","date_created":"2018-12-12T11:39:07Z","file":[{"access_level":"open_access","file_name":"IST-2013-109-v1+1_What_is_Decidable_about_Partially_Observable_Markov_Decision_Processes_with_ω-Regular_Objectives.pdf","relation":"main_file","date_created":"2018-12-12T11:53:06Z","file_size":483407,"date_updated":"2020-07-14T12:46:44Z","content_type":"application/pdf","file_id":"5467","creator":"system","checksum":"cbba40210788a1b22c6cf06433b5ed6f"}],"has_accepted_license":"1","year":"2013","citation":{"apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2013). <i>What is decidable about partially observable Markov decision processes with ω-regular objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">https://doi.org/10.15479/AT:IST-2013-109-v1-1</a>","short":"K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">https://doi.org/10.15479/AT:IST-2013-109-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">10.15479/AT:IST-2013-109-v1-1</a>.","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, <i>What is decidable about partially observable Markov decision processes with ω-regular objectives</i>. IST Austria, 2013.","ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.","ama":"Chatterjee K, Chmelik M, Tracol M. <i>What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-109-v1-1\">10.15479/AT:IST-2013-109-v1-1</a>"},"pubrep_id":"109","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages extends regular languages to infinite strings and provides a robust specification language to express all properties used in verification, and parity objectives are canonical forms to express ω-regular conditions. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satis- fied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite- memory strategies. We establish asymptotically optimal (exponential) memory bounds and EXPTIME- completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives.","lang":"eng"}],"title":"What is decidable about partially observable Markov decision processes with ω-regular objectives","publication_status":"published","file_date_updated":"2020-07-14T12:46:44Z","oa_version":"Published Version","doi":"10.15479/AT:IST-2013-109-v1-1","page":"41","publication_identifier":{"issn":["2664-1690"]},"day":"20"},{"publication_identifier":{"issn":["2664-1690"]},"day":"12","page":"16","doi":"10.15479/AT:IST-2013-123-v1-1","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:45Z","publication_status":"published","title":"How free is your linearizable concurrent data structure?","abstract":[{"text":"Linearizability requires that the outcome of calls by competing threads to a concurrent data structure is the same as some sequential execution where each thread has exclusive access to the data structure. In an ordered data structure, such as a queue or a stack, linearizability is ensured by requiring threads commit in the order dictated by the sequential semantics of the data structure; e.g., in a concurrent queue implementation a dequeue can only remove the oldest element. \r\nIn this paper, we investigate the impact of this strict ordering, by comparing what linearizability allows to what existing implementations do. We first give an operational definition for linearizability which allows us to build the most general linearizable implementation as a transition system for any given sequential specification. We then use this operational definition to categorize linearizable implementations based on whether they are bound or free. In a bound implementation, whenever all threads observe the same logical state, the updates to the logical state and the temporal order of commits coincide. All existing queue implementations we know of are bound. We then proceed to present, to the best of our knowledge, the first ever free queue implementation. Our experiments show that free implementations have the potential for better performance by suffering less from contention.","lang":"eng"}],"pubrep_id":"123","citation":{"ama":"Henzinger TA, Sezgin A. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>","ieee":"T. A. Henzinger and A. Sezgin, <i>How free is your linearizable concurrent data structure?</i> IST Austria, 2013.","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","chicago":"Henzinger, Thomas A, and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","apa":"Henzinger, T. A., &#38; Sezgin, A. (2013). <i>How free is your linearizable concurrent data structure?</i> IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">https://doi.org/10.15479/AT:IST-2013-123-v1-1</a>","mla":"Henzinger, Thomas A., and Ali Sezgin. <i>How Free Is Your Linearizable Concurrent Data Structure?</i> IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-123-v1-1\">10.15479/AT:IST-2013-123-v1-1</a>."},"year":"2013","has_accepted_license":"1","date_created":"2018-12-12T11:39:07Z","file":[{"content_type":"application/pdf","creator":"system","file_id":"5480","checksum":"ce580605ae9756a8c99d7b403ebb8eed","access_level":"open_access","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:45Z","file_size":249790,"date_created":"2018-12-12T11:53:19Z"}],"_id":"5402","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}],"publisher":"IST Austria","oa":1,"type":"technical_report","date_published":"2013-06-12T00:00:00Z","alternative_title":["IST Austria Technical Report"],"ddc":["000","004"],"language":[{"iso":"eng"}],"date_updated":"2020-07-14T23:04:47Z","status":"public","department":[{"_id":"ToHe"}],"month":"06"},{"_id":"5403","date_created":"2018-12-12T11:39:08Z","file":[{"access_level":"open_access","file_name":"IST-2013-126-v1+1_soda_full.pdf","relation":"main_file","file_size":434523,"date_created":"2018-12-12T11:53:49Z","date_updated":"2020-07-14T12:46:45Z","file_id":"5510","creator":"system","content_type":"application/pdf","checksum":"063868c665beec37bf28160e2a695746"}],"has_accepted_license":"1","year":"2013","citation":{"ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>Qualitative analysis of concurrent mean-payoff games</i>. IST Austria, 2013.","ista":"Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.","ama":"Chatterjee K, Ibsen-Jensen R. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">10.15479/AT:IST-2013-126-v1-1</a>","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">10.15479/AT:IST-2013-126-v1-1</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2013). <i>Qualitative analysis of concurrent mean-payoff games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">https://doi.org/10.15479/AT:IST-2013-126-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>Qualitative Analysis of Concurrent Mean-Payoff Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-126-v1-1\">https://doi.org/10.15479/AT:IST-2013-126-v1-1</a>."},"pubrep_id":"126","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 every 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 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 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 mean-payoff games) that is not known to be in polynomial time.","lang":"eng"}],"title":"Qualitative analysis of concurrent mean-payoff games","publication_status":"published","file_date_updated":"2020-07-14T12:46:45Z","oa_version":"Published Version","page":"33","doi":"10.15479/AT:IST-2013-126-v1-1","day":"03","publication_identifier":{"issn":["2664-1690"]},"month":"07","department":[{"_id":"KrCh"}],"status":"public","date_updated":"2023-02-23T12:22:53Z","language":[{"iso":"eng"}],"ddc":["000","005"],"alternative_title":["IST Austria Technical Report"],"date_published":"2013-07-03T00:00:00Z","type":"technical_report","related_material":{"record":[{"relation":"later_version","status":"public","id":"524"}]},"oa":1,"publisher":"IST Austria","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"03","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-127-v1-1","page":"29","file_date_updated":"2020-07-14T12:46:45Z","oa_version":"Published Version","publication_status":"published","title":"The complexity of ergodic games","abstract":[{"text":"We study finite-state two-player (zero-sum) concurrent mean-payoff games played on a 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 lie in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP and coNP is the long-standing best known bound). We show that the exact value can be expressed in the existential theory of the reals, and also establish square-root sum hardness for a related class of games.","lang":"eng"}],"pubrep_id":"127","year":"2013","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">10.15479/AT:IST-2013-127-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2013). <i>The complexity of ergodic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">https://doi.org/10.15479/AT:IST-2013-127-v1-1</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">https://doi.org/10.15479/AT:IST-2013-127-v1-1</a>.","ista":"Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.","ieee":"K. Chatterjee and R. Ibsen-Jensen, <i>The complexity of ergodic games</i>. IST Austria, 2013.","ama":"Chatterjee K, Ibsen-Jensen R. <i>The Complexity of Ergodic Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-127-v1-1\">10.15479/AT:IST-2013-127-v1-1</a>"},"_id":"5404","date_created":"2018-12-12T11:39:08Z","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:46:45Z","file_size":517275,"date_created":"2018-12-12T11:53:35Z","relation":"main_file","file_name":"IST-2013-127-v1+1_ergodic.pdf","access_level":"open_access","checksum":"79ee5e677a82611ce06e0360c69d494a","creator":"system","file_id":"5496","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"}],"oa":1,"related_material":{"record":[{"id":"2162","relation":"later_version","status":"public"}]},"date_published":"2013-07-03T00:00:00Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"ddc":["000","005"],"status":"public","date_updated":"2023-02-23T10:30:55Z","month":"07","department":[{"_id":"KrCh"}]},{"doi":"10.15479/AT:IST-2013-128-v1-1","page":"22","day":"08","publication_identifier":{"issn":["2664-1690"]},"title":"Perfect-information stochastic mean-payoff parity games","publication_status":"published","file_date_updated":"2020-07-14T12:46:45Z","oa_version":"Published Version","year":"2013","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">10.15479/AT:IST-2013-128-v1-1</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">https://doi.org/10.15479/AT:IST-2013-128-v1-1</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2013). <i>Perfect-information stochastic mean-payoff parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">https://doi.org/10.15479/AT:IST-2013-128-v1-1</a>","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-128-v1-1\">10.15479/AT:IST-2013-128-v1-1</a>","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, <i>Perfect-information stochastic mean-payoff parity games</i>. IST Austria, 2013.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p."},"pubrep_id":"128","abstract":[{"text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2-1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic) with only parity objectives, or with only mean-payoff objectives. We present an algorithm running\r\nin time O(d · n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the objective\r\ncan be ensured with probability 1, where n is the number of states of the game, d the number of priorities\r\nof the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems\r\nwith both functional requirement (given as a qualitative objective) and performance requirement (given\r\nas a quantitative objective).","lang":"eng"}],"_id":"5405","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:45Z","file_size":387467,"date_created":"2018-12-12T11:53:54Z","access_level":"open_access","file_name":"IST-2013-128-v1+1_full_stoch_mpp.pdf","checksum":"ede787a10e74e4f7db302fab8f12f3ca","file_id":"5516","creator":"system","content_type":"application/pdf"}],"date_created":"2018-12-12T11:39:09Z","has_accepted_license":"1","publisher":"IST Austria","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"first_name":"Youssouf","last_name":"Oualhadj","full_name":"Oualhadj, Youssouf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2013-07-08T00:00:00Z","type":"technical_report","related_material":{"record":[{"id":"2212","relation":"later_version","status":"public"}]},"oa":1,"language":[{"iso":"eng"}],"ddc":["000","005","510"],"alternative_title":["IST Austria Technical Report"],"month":"07","department":[{"_id":"KrCh"}],"status":"public","date_updated":"2023-02-23T10:33:08Z"},{"year":"2013","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). <i>Distributed synthesis for LTL Fragments</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, <i>Distributed synthesis for LTL Fragments</i>. IST Austria, 2013."},"abstract":[{"text":"We consider the distributed synthesis problem fortemporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTLand our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3)Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.","lang":"eng"}],"pubrep_id":"130","_id":"5406","has_accepted_license":"1","date_created":"2018-12-12T11:39:09Z","file":[{"file_id":"5540","creator":"system","content_type":"application/pdf","checksum":"855513ebaf6f72228800c5fdb522f93c","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","access_level":"open_access","file_size":467895,"date_created":"2018-12-12T11:54:18Z","date_updated":"2020-07-14T12:46:45Z","relation":"main_file"}],"page":"11","doi":"10.15479/AT:IST-2013-130-v1-1","day":"08","publication_identifier":{"issn":["2664-1690"]},"title":"Distributed synthesis for LTL Fragments","publication_status":"published","file_date_updated":"2020-07-14T12:46:45Z","oa_version":"Published Version","language":[{"iso":"eng"}],"ddc":["005"],"alternative_title":["IST Austria Technical Report"],"month":"07","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","date_updated":"2023-02-21T17:01:26Z","publisher":"IST Austria","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"},{"first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2013-07-08T00:00:00Z","type":"technical_report","oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"1376"}]}},{"alternative_title":["IST Austria Technical Report"],"ddc":["000","005"],"language":[{"iso":"eng"}],"date_updated":"2023-02-23T10:33:11Z","status":"public","department":[{"_id":"KrCh"}],"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Sumit","last_name":"Nain","full_name":"Nain, Sumit"},{"first_name":"Moshe","last_name":"Vardi","full_name":"Vardi, Moshe"}],"publisher":"IST Austria","oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"2213"}]},"type":"technical_report","date_published":"2013-09-12T00:00:00Z","pubrep_id":"141","abstract":[{"lang":"eng","text":"We consider two-player partial-observation stochastic games where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are omega-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). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, they were shown to be decidable in 2EXPTIME under finite-memory  strategies. We improve the complexity and show that the qualitative analysis problems for partial-observation stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis. "}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>.","short":"K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.","apa":"Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2013). <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">https://doi.org/10.15479/AT:IST-2013-141-v1-1</a>.","ieee":"K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, <i>The complexity of partial-observation stochastic parity games with finite-memory strategies</i>. IST Austria, 2013.","ista":"Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.","ama":"Chatterjee K, Doyen L, Nain S, Vardi M. <i>The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-141-v1-1\">10.15479/AT:IST-2013-141-v1-1</a>"},"year":"2013","has_accepted_license":"1","date_created":"2018-12-12T11:39:10Z","file":[{"date_created":"2018-12-12T11:53:16Z","relation":"main_file","file_size":300481,"date_updated":"2020-07-14T12:46:46Z","access_level":"open_access","file_name":"IST-2013-141-v1+1_main-tech-rpt.pdf","checksum":"226bc791124f8d3138379778ce834e86","creator":"system","file_id":"5477","content_type":"application/pdf"}],"_id":"5408","day":"12","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-141-v1-1","page":"17","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:46Z","title":"The complexity of partial-observation stochastic parity games with finite-memory strategies","publication_status":"published"},{"type":"technical_report","date_published":"2013-10-30T00:00:00Z","oa":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"2216"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"month":"10","date_updated":"2023-02-23T10:33:18Z","status":"public","ddc":["000"],"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"title":"Edit distance for timed automata","publication_status":"published","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:46Z","page":"12","doi":"10.15479/AT:IST-2013-144-v1-1","publication_identifier":{"issn":["2664-1690"]},"day":"30","file":[{"content_type":"application/pdf","file_id":"5469","creator":"system","checksum":"0f7633081ba8299c543322f0ad08571f","access_level":"open_access","file_name":"IST-2013-144-v1+1_main.pdf","file_size":336377,"relation":"main_file","date_updated":"2020-07-14T12:46:46Z","date_created":"2018-12-12T11:53:08Z"}],"date_created":"2018-12-12T11:39:10Z","has_accepted_license":"1","_id":"5409","citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Majumdar R. <i>Edit Distance for Timed Automata</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">10.15479/AT:IST-2013-144-v1-1</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, <i>Edit distance for timed automata</i>. IST Austria, 2013.","ista":"Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Majumdar, R. (2013). <i>Edit distance for timed automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">https://doi.org/10.15479/AT:IST-2013-144-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. <i>Edit Distance for Timed Automata</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">https://doi.org/10.15479/AT:IST-2013-144-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Timed Automata</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-144-v1-1\">10.15479/AT:IST-2013-144-v1-1</a>."},"year":"2013","abstract":[{"text":"The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory, parsing, and speech recognition. \r\nIn 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 timestamps. 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 delta away from the parameter, for delta>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 we show analogous decidability results for rectangular automata.","lang":"eng"}],"pubrep_id":"144"},{"abstract":[{"lang":"eng","text":"Board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in development of mathematical and logical skills, but also in 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. \r\nOur approach 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. Also, the presence of such states for standard game variants like Tic-Tac-Toe on board size 4x4 opens up new games to be played that have not been played for ages since the default start state is heavily biased. "}],"pubrep_id":"146","citation":{"apa":"Ahmed, U., Chatterjee, K., &#38; Gulwani, S. (2013). <i>Automatic generation of alternative starting positions for traditional board games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">https://doi.org/10.15479/AT:IST-2013-146-v1-1</a>","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">https://doi.org/10.15479/AT:IST-2013-146-v1-1</a>.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.","mla":"Ahmed, Umair, et al. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">10.15479/AT:IST-2013-146-v1-1</a>.","ama":"Ahmed U, Chatterjee K, Gulwani S. <i>Automatic Generation of Alternative Starting Positions for Traditional Board Games</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-146-v1-1\">10.15479/AT:IST-2013-146-v1-1</a>","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, <i>Automatic generation of alternative starting positions for traditional board games</i>. IST Austria, 2013.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p."},"year":"2013","has_accepted_license":"1","date_created":"2018-12-12T11:39:10Z","file":[{"checksum":"409f3aaaf1184e4057b89cbb449dac80","creator":"system","file_id":"5528","content_type":"application/pdf","date_created":"2018-12-12T11:54:06Z","file_size":818189,"relation":"main_file","date_updated":"2020-07-14T12:46:46Z","access_level":"open_access","file_name":"IST-2013-146-v1+1_main.pdf"}],"_id":"5410","publication_identifier":{"issn":["2664-1690"]},"day":"03","doi":"10.15479/AT:IST-2013-146-v1-1","page":"13","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:46Z","publication_status":"published","title":"Automatic generation of alternative starting positions for traditional board games","alternative_title":["IST Austria Technical Report"],"ddc":["000","005"],"language":[{"iso":"eng"}],"date_updated":"2023-02-23T10:00:50Z","status":"public","department":[{"_id":"KrCh"}],"month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ahmed, Umair","last_name":"Ahmed","first_name":"Umair"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Gulwani","first_name":"Sumit","full_name":"Gulwani, Sumit"}],"publisher":"IST Austria","related_material":{"record":[{"id":"1481","status":"public","relation":"later_version"}]},"oa":1,"type":"technical_report","date_published":"2013-12-03T00:00:00Z"},{"file_date_updated":"2020-07-14T12:47:10Z","article_processing_charge":"No","oa_version":"None","publication_status":"published","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642397981","9783642397998"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-642-39799-8_11","scopus_import":"1","_id":"5747","file":[{"file_name":"2013_CAV_Dragoi.pdf","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-18T13:13:33Z","file_size":236480,"creator":"dernst","file_id":"5748","content_type":"application/pdf","checksum":"a901cc6b71db08b61c0d4c0cbacc6287"}],"date_created":"2018-12-18T13:10:21Z","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"Saint Petersburg, Russia","name":"CAV 2013"},"year":"2013","place":"Berlin, Heidelberg","citation":{"mla":"Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” <i>Computer Aided Verification</i>, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>.","chicago":"Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In <i>Computer Aided Verification</i>, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>.","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.","apa":"Dragoi, C., Gupta, A., &#38; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In <i>Computer Aided Verification</i> (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>","ama":"Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: <i>Computer Aided Verification</i>. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>","ista":"Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.","ieee":"C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in <i>Computer Aided Verification</i>, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190."},"oa":1,"volume":8044,"series_title":"CAV","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","first_name":"Cezara","last_name":"Dragoi"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","last_name":"Gupta"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"publication":"Computer Aided Verification","ec_funded":1,"date_updated":"2023-09-05T14:16:07Z","department":[{"_id":"ToHe"}],"intvolume":"      8044","quality_controlled":"1","page":"174-190","project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"has_accepted_license":"1","pubrep_id":"195","date_published":"2013-01-01T00:00:00Z","type":"book_chapter","publisher":"Springer Berlin Heidelberg","status":"public","language":[{"iso":"eng"}],"ddc":["005"]},{"type":"technical_report","date_published":"2013-06-13T00:00:00Z","oa":1,"author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"month":"06","date_updated":"2020-07-14T23:06:19Z","status":"public","ddc":["000","005"],"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"publication_status":"published","title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:30Z","doi":"10.15479/AT:IST-2013-124-v1-1","page":"23","publication_identifier":{"issn":["2664-1690"]},"day":"13","file":[{"file_name":"2013_TechRep_Henzinger.pdf","access_level":"open_access","date_created":"2019-05-13T14:11:39Z","date_updated":"2020-07-14T12:47:30Z","file_size":549684,"relation":"main_file","content_type":"application/pdf","file_id":"6441","creator":"dernst","checksum":"a219ba4eada6cd62befed52262ee15d4"}],"has_accepted_license":"1","date_created":"2019-05-13T14:13:27Z","_id":"6440","citation":{"ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria, 2013.","ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","ama":"Henzinger TA, Payer H, Sezgin A. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>","chicago":"Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>.","short":"T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.","apa":"Henzinger, T. A., Payer, H., &#38; Sezgin, A. (2013). <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>","mla":"Henzinger, Thomas A., et al. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>."},"year":"2013","pubrep_id":"124","abstract":[{"text":"In order to guarantee that each method of a data structure updates the logical state exactly once, al-most all non-blocking implementations employ Compare-And-Swap (CAS) based synchronization. For FIFO  queue  implementations  this  translates  into  concurrent  enqueue  or  dequeue  methods competing among themselves to update the same variable, the tail or the head, respectively, leading to high contention and poor scalability. Recent non-blocking queue implementations try to alleviate high contentionby increasing the number of contention points, all the while using CAS-based synchronization. Furthermore, obtaining a wait-free implementation with competition is achieved by additional synchronization which leads to further degradation of performance.In this paper we formalize the notion of competitiveness of a synchronizing statement which can beused as a measure for the scalability of concurrent implementations.  We present a new queue implementation, the Speculative Pairing (SP) queue, which, as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead of CAS. We prove that the SP queue is linearizable and lock-free.We also show that replacing CAS with FAI leads to wait-freedom for dequeue methods without an adverse effect on performance.  In fact, our experiments suggest that the SP queue can perform and scale better than the state-of-the-art queue implementations.","lang":"eng"}]}]