[{"language":[{"iso":"eng"}],"_id":"1395","degree_awarded":"PhD","citation":{"mla":"Konrad, Matthias. <i>Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus</i>. Institute of Science and Technology Austria, 2014.","ista":"Konrad M. 2014. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology Austria.","chicago":"Konrad, Matthias. “Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus.” Institute of Science and Technology Austria, 2014.","ieee":"M. Konrad, “Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus,” Institute of Science and Technology Austria, 2014.","ama":"Konrad M. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. 2014.","short":"M. Konrad, Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus, Institute of Science and Technology Austria, 2014.","apa":"Konrad, M. (2014). <i>Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus</i>. Institute of Science and Technology Austria."},"date_created":"2018-12-11T11:51:46Z","title":"Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus","publist_id":"5814","year":"2014","article_processing_charge":"No","date_updated":"2023-09-07T11:38:56Z","department":[{"_id":"SyCr"}],"page":"131","supervisor":[{"last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia M","full_name":"Cremer, Sylvia M"}],"status":"public","date_published":"2014-02-01T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"In this thesis I studied various individual and social immune defences employed by the invasive garden ant Lasius neglectus mostly against entomopathogenic fungi.  The first two chapters of this thesis address the phenomenon of 'social immunisation'. Social immunisation, that is the immunological protection of group members due to social contact to a pathogen-exposed nestmate, has been described in various social insect species against different types of pathogens. However, in the case of entomopathogenic fungi it has, so far, only been demonstrated that social immunisation exists at all. Its underlying mechanisms r any other properties were, however, unknown. In the first chapter of this thesis I identified the mechanistic basis of social immunisation in L. neglectus against the entomopathogenous fungus Metarhizium. I could show that nestmates of a pathogen-exposed individual contract low-level infections due to social interactions. These low-level infections are, however, non-lethal and cause an active stimulation of the immune system, which protects the nestmates upon subsequent pathogen encounters. In the second chapter of this thesis I investigated the specificity and colony level effects of social immunisation. I demonstrated that the protection conferred by social immunisation is highly specific, protecting ants only against the same pathogen strain. In addition, depending on the respective context, social immunisation may even cause fitness costs. I further showed that social immunisation crucially affects sanitary behaviour and disease dynamics within ant groups. In the third chapter of this thesis I studied the effects of the ectosymbiotic fungus Laboulbenia formicarum on its host L. neglectus. Although Laboulbeniales are the largest order of insect-parasitic fungi, research concerning host fitness consequence is sparse. I showed that highly Laboulbenia-infected ants sustain fitness costs under resource limitation, however, gain fitness benefits when exposed to an entomopathogenus fungus. These effects are probably cause by a prophylactic upregulation of behavioural as well as physiological immune defences in highly infected ants.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","oa_version":"None","month":"02","publication_identifier":{"issn":["2663-337X"]},"author":[{"first_name":"Matthias","full_name":"Konrad, Matthias","last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published"},{"_id":"1402","language":[{"iso":"eng"}],"degree_awarded":"PhD","year":"2014","article_processing_charge":"No","date_updated":"2023-09-07T11:39:38Z","citation":{"apa":"Marhavá, P. (2014). <i>Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana</i>. Institute of Science and Technology Austria.","mla":"Marhavá, Petra. <i>Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana</i>. Institute of Science and Technology Austria, 2014.","ista":"Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria.","chicago":"Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014.","ama":"Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. 2014.","ieee":"P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014.","short":"P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014."},"date_created":"2018-12-11T11:51:49Z","title":"Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana","publist_id":"5805","supervisor":[{"orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","full_name":"Friml, Jiří"}],"date_published":"2014-12-01T00:00:00Z","status":"public","type":"dissertation","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"JiFr"}],"page":"90","month":"12","publication_identifier":{"issn":["2663-337X"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated into various lipid signaling molecules, designated polyphosphoinositides (PPIs). The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol is performed by a set of organelle-specific kinases and phosphatases, and the characteristic head groups make these molecules ideal for regulating biological processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2 play crucial roles in trafficking toward the lytic compartments, whereas the role in plants is not yet fully understood. Here we identified the role of a land plant-specific subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize to the tonoplast along with Ptdlns3P, the presumable product of their activity. in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates and bisphosphates were changed, with opposite effects on the morphology of storage and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover, multiple sac knockout mutants had an increased number of smaller storage and lytic vacuoles, whereas extralarge vacuoles were observed in the overexpression lines, correlating with various growth and developmental defects. The fragmented vacuolar phenotype of sac mutants could be mimicked by treating wild-type seedlings with Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology. Taken together, these results provide evidence that PPIs, together with their metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar morphology and function in plants."}],"day":"01","oa_version":"None","author":[{"last_name":"Marhavá","id":"44E59624-F248-11E8-B48F-1D18A9856A87","full_name":"Marhavá, Petra","first_name":"Petra"}],"publication_status":"published"},{"date_updated":"2023-10-17T12:16:58Z","year":"2014","date_created":"2018-12-11T11:51:49Z","title":"Forces driving epithelial spreading in zebrafish epiboly","citation":{"ama":"Behrndt M. Forces driving epithelial spreading in zebrafish epiboly. 2014.","ieee":"M. Behrndt, “Forces driving epithelial spreading in zebrafish epiboly,” IST Austria, 2014.","short":"M. Behrndt, Forces Driving Epithelial Spreading in Zebrafish Epiboly, IST Austria, 2014.","ista":"Behrndt M. 2014. Forces driving epithelial spreading in zebrafish epiboly. IST Austria.","mla":"Behrndt, Martin. <i>Forces Driving Epithelial Spreading in Zebrafish Epiboly</i>. IST Austria, 2014.","chicago":"Behrndt, Martin. “Forces Driving Epithelial Spreading in Zebrafish Epiboly.” IST Austria, 2014.","apa":"Behrndt, M. (2014). <i>Forces driving epithelial spreading in zebrafish epiboly</i>. IST Austria."},"publist_id":"5804","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"2282"},{"status":"public","relation":"part_of_dissertation","id":"2950"},{"id":"3373","relation":"part_of_dissertation","status":"public"}]},"language":[{"iso":"eng"}],"_id":"1403","acknowledged_ssus":[{"_id":"SSU"}],"author":[{"full_name":"Behrndt, Martin","first_name":"Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","month":"08","day":"01","oa_version":"None","abstract":[{"text":"A variety of developmental and disease related processes depend on epithelial cell sheet spreading. In order to gain insight into the biophysical mechanism(s) underlying the tissue morphogenesis we studied the spreading of an epithelium during the early development of the zebrafish embryo. In zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the yolk cell to completely engulf it at the end of gastrulation. Previous studies have proposed that an actomyosin ring forming within the yolk syncytial layer (YSL) acts as purse string that through constriction along its circumference pulls on the margin of the EVL. Direct biophysical evidence for this hypothesis has however been missing. The aim of the thesis was to understand how the actomyosin ring may generate pulling forces onto the EVL and what cellular mechanism(s) may facilitate the spreading of the epithelium. Using laser ablation to measure cortical tension within the actomyosin ring we found an anisotropic tension distribution, which was highest along the circumference of the ring. However the low degree of anisotropy was incompatible with the actomyosin ring functioning as a purse string only. Additionally, we observed retrograde cortical flow from vegetal parts of the ring into the EVL margin. Interpreting the experimental data using a theoretical distribution that models  the tissues as active viscous gels led us to proposen that the actomyosin ring has a twofold contribution to EVL epiboly. It not only acts as a purse string through constriction along its circumference, but in addition constriction along the width of the ring generates pulling forces through friction-resisted cortical flow. Moreover, when rendering the purse string mechanism unproductive EVL epiboly proceeded normally indicating that the flow-friction mechanism is sufficient to drive the process. Aiming to understand what cellular mechanism(s) may facilitate the spreading of the epithelium we found that tension-oriented EVL cell divisions limit tissue anisotropy by releasing tension along the division axis and promote epithelial spreading. Notably, EVL cells undergo ectopic cell fusion in conditions in which oriented-cell division is impaired or the epithelium is mechanically challenged. Taken together our study of EVL epiboly suggests a novel mechanism of force generation for actomyosin rings through friction-resisted cortical flow and highlights the importance of tension-oriented cell divisions in epithelial morphogenesis.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","alternative_title":["IST Austria Thesis"],"type":"dissertation","date_published":"2014-08-01T00:00:00Z","supervisor":[{"first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"status":"public","page":"91","department":[{"_id":"CaHe"}]},{"language":[{"iso":"eng"}],"_id":"1404","date_updated":"2021-01-12T06:50:30Z","acknowledgement":"This work was funded by the DFG and the ERC.","year":"2014","citation":{"chicago":"Stock, Miriam. “Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants.” IST Austria, 2014.","mla":"Stock, Miriam. <i>Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants</i>. IST Austria, 2014.","ista":"Stock M. 2014. Evolution of a fungal pathogen towards individual versus social immunity in ants. IST Austria.","ieee":"M. Stock, “Evolution of a fungal pathogen towards individual versus social immunity in ants,” IST Austria, 2014.","ama":"Stock M. Evolution of a fungal pathogen towards individual versus social immunity in ants. 2014.","short":"M. Stock, Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants, IST Austria, 2014.","apa":"Stock, M. (2014). <i>Evolution of a fungal pathogen towards individual versus social immunity in ants</i>. IST Austria."},"date_created":"2018-12-11T11:51:49Z","title":"Evolution of a fungal pathogen towards individual versus social immunity in ants","publist_id":"5803","publisher":"IST Austria","alternative_title":["IST Austria Thesis"],"status":"public","supervisor":[{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M","first_name":"Sylvia M"}],"type":"dissertation","date_published":"2014-04-01T00:00:00Z","page":"101","department":[{"_id":"SyCr"}],"month":"04","day":"01","oa_version":"None","abstract":[{"lang":"eng","text":"The co-evolution of hosts and pathogens is characterized by continuous adaptations of both parties. Pathogens of social insects need to adapt towards disease defences at two levels: 1) individual immunity of each colony member consisting of behavioural defence strategies as well as humoral and cellular immune responses and 2) social immunity that is collectively performed by all group members comprising behavioural, physiological and organisational defence strategies.\r\n\r\nTo disentangle the selection pressure on pathogens by the collective versus individual level of disease defence in social insects, we performed an evolution experiment using the Argentine Ant, Linepithema humile, as a host and a mixture of the general insect pathogenic fungus Metarhizium spp. (6 strains) as a pathogen. We allowed pathogen evolution over 10 serial host passages to two different evolution host treatments: (1) only individual host immunity in a single host treatment, and (2) simultaneously acting individual and social immunity in a social host treatment, in which an exposed ant was accompanied by two untreated nestmates.\r\n\r\nBefore starting the pathogen evolution experiment, the 6 Metarhizium spp. strains were characterised concerning conidiospore size killing rates in singly and socially reared ants, their competitiveness under coinfecting conditions and their influence on ant behaviour. We analysed how the ancestral atrain mixture changed in conidiospere size, killing rate and strain composition dependent on host treatment (single or social hosts) during 10 passages and found that killing rate and conidiospere size of the pathogen increased under both evolution regimes, but different depending on host treatment.\r\n\r\nTesting the evolved strain mixtures that evolved under either the single or social host treatment under both single and social current rearing conditions in a full factorial design experiment revealed that the additional collective defences in insect societies add new selection pressure for their coevolving pathogens that compromise their ability to adapt to its host at the group level. To our knowledge, this is the first study directly measuring the influence of social immunity on pathogen evolution."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","author":[{"first_name":"Miriam","full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock"}]},{"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","status":"public","date_published":"2014-01-28T00:00:00Z","type":"technical_report","department":[{"_id":"ToHe"}],"page":"20","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Krenn","first_name":"Willibald","full_name":"Krenn, Willibald"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"publication_status":"published","ddc":["000"],"publication_identifier":{"issn":["2664-1690"]},"month":"01","oa_version":"Published Version","day":"28","abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems."}],"file":[{"content_type":"application/pdf","access_level":"open_access","file_size":534732,"relation":"main_file","creator":"system","date_created":"2018-12-12T11:54:21Z","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2014-148-v2+1_main_tr.pdf","file_id":"5543","checksum":"0e03aba625cc334141a3148432aa5760"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:46Z","language":[{"iso":"eng"}],"_id":"5411","doi":"10.15479/AT:IST-2014-148-v2-1","oa":1,"pubrep_id":"152","date_updated":"2023-02-23T10:31:07Z","year":"2014","date_created":"2018-12-12T11:39:11Z","title":"Compositional specifications for IOCO testing","citation":{"ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.","mla":"Daca, Przemyslaw, et al. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, <i>Compositional specifications for IOCO testing</i>. IST Austria, 2014.","ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. <i>Compositional Specifications for IOCO Testing</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.","apa":"Daca, P., Henzinger, T. A., Krenn, W., &#38; Nickovic, D. (2014). <i>Compositional specifications for IOCO testing</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>"},"related_material":{"record":[{"status":"public","relation":"later_version","id":"2167"}]},"has_accepted_license":"1"},{"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"type":"technical_report","status":"public","date_published":"2014-01-29T00:00:00Z","department":[{"_id":"KrCh"}],"page":"31","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"}],"publication_status":"published","ddc":["000"],"month":"01","publication_identifier":{"issn":["2664-1690"]},"day":"29","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"4d6cda4bebed970926403ad6ad8c745f","file_id":"5500","file_name":"IST-2014-153-v1+1_main.pdf","date_created":"2018-12-12T11:53:39Z","date_updated":"2020-07-14T12:46:47Z","creator":"system","relation":"main_file","access_level":"open_access","file_size":423322,"content_type":"application/pdf"}],"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. "}],"file_date_updated":"2020-07-14T12:46:47Z","language":[{"iso":"eng"}],"_id":"5412","doi":"10.15479/AT:IST-2014-153-v1-1","oa":1,"date_updated":"2023-02-23T12:25:18Z","pubrep_id":"153","year":"2014","date_created":"2018-12-12T11:39:11Z","title":"CEGAR for qualitative analysis of probabilistic systems","citation":{"apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v1-1\">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>","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>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.","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>.","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>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014."},"has_accepted_license":"1","related_material":{"record":[{"id":"2063","relation":"later_version","status":"public"},{"id":"5413","relation":"later_version","status":"public"},{"status":"public","id":"5414","relation":"later_version"}]}},{"oa_version":"Published Version","day":"06","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"file":[{"creator":"system","content_type":"application/pdf","file_size":606049,"relation":"main_file","access_level":"open_access","file_id":"5539","checksum":"ce4967a184d84863eec76c66cbac1614","file_name":"IST-2014-153-v2+2_main.pdf","date_updated":"2020-07-14T12:46:47Z","date_created":"2018-12-12T11:54:17Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"month":"02","publication_identifier":{"issn":["2664-1690"]},"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"}],"publication_status":"published","department":[{"_id":"KrCh"}],"page":"33","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"status":"public","date_published":"2014-02-06T00:00:00Z","type":"technical_report","has_accepted_license":"1","related_material":{"record":[{"relation":"later_version","id":"2063","status":"public"},{"status":"public","relation":"earlier_version","id":"5412"},{"relation":"later_version","id":"5414","status":"public"}]},"title":"CEGAR for qualitative analysis of probabilistic systems","citation":{"apa":"Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative analysis of probabilistic systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>","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-v2-2\">10.15479/AT:IST-2014-153-v2-2</a>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","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>.","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-153-v2-2\">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p."},"date_created":"2018-12-12T11:39:11Z","pubrep_id":"164","date_updated":"2023-02-23T12:25:18Z","oa":1,"year":"2014","doi":"10.15479/AT:IST-2014-153-v2-2","file_date_updated":"2020-07-14T12:46:47Z","_id":"5413","language":[{"iso":"eng"}]},{"doi":"10.15479/AT:IST-2014-153-v3-1","file_date_updated":"2020-07-14T12:46:48Z","_id":"5414","language":[{"iso":"eng"}],"has_accepted_license":"1","related_material":{"record":[{"relation":"later_version","id":"2063","status":"public"},{"status":"public","relation":"earlier_version","id":"5412"},{"id":"5413","relation":"earlier_version","status":"public"}]},"citation":{"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-v3-1\">10.15479/AT:IST-2014-153-v3-1</a>","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-153-v3-1\">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>.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","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>"},"title":"CEGAR for qualitative analysis of probabilistic systems","date_created":"2018-12-12T11:39:12Z","date_updated":"2023-02-23T12:25:15Z","oa":1,"pubrep_id":"165","year":"2014","department":[{"_id":"KrCh"}],"page":"33","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"status":"public","type":"technical_report","date_published":"2014-02-07T00:00:00Z","day":"07","oa_version":"Published Version","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. "}],"file":[{"file_id":"5464","checksum":"87b93fe9af71fc5c94b0eb6151537e11","file_name":"IST-2014-153-v3+1_main.pdf","date_updated":"2020-07-14T12:46:48Z","date_created":"2018-12-12T11:53:03Z","creator":"system","access_level":"open_access","file_size":606227,"content_type":"application/pdf","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"month":"02","publication_identifier":{"issn":["2664-1690"]},"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"}],"publication_status":"published"},{"file_date_updated":"2020-07-14T12:46:48Z","_id":"5415","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2014-170-v1-1","title":"Nested weighted automata","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","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.","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>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","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>.","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>"},"date_created":"2018-12-12T11:39:12Z","pubrep_id":"170","oa":1,"date_updated":"2023-02-23T12:26:19Z","year":"2014","has_accepted_license":"1","related_material":{"record":[{"relation":"later_version","id":"1656","status":"public"},{"id":"467","relation":"later_version","status":"public"},{"relation":"later_version","id":"5436","status":"public"}]},"page":"27","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","status":"public","type":"technical_report","date_published":"2014-02-19T00:00:00Z","publication_status":"published","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"day":"19","oa_version":"Published Version","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"}],"file":[{"creator":"system","content_type":"application/pdf","relation":"main_file","file_size":573457,"access_level":"open_access","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","file_name":"IST-2014-170-v1+1_main.pdf","file_id":"5497","date_updated":"2020-07-14T12:46:48Z","date_created":"2018-12-12T11:53:36Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"month":"02","publication_identifier":{"issn":["2664-1690"]}},{"type":"technical_report","date_published":"2014-02-19T00:00:00Z","status":"public","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"ToHe"}],"page":"22","publication_identifier":{"issn":["2664-1690"]},"month":"02","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"file":[{"creator":"system","relation":"main_file","content_type":"application/pdf","file_size":712077,"access_level":"open_access","file_name":"IST-2014-171-v1+1_report.pdf","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_id":"5492","date_updated":"2020-07-14T12:46:49Z","date_created":"2018-12-12T11:53:32Z"}],"oa_version":"Published Version","day":"19","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"publication_status":"published","doi":"10.15479/AT:IST-2014-171-v1-1","language":[{"iso":"eng"}],"_id":"5416","file_date_updated":"2020-07-14T12:46:49Z","has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"2217"}]},"year":"2014","pubrep_id":"171","oa":1,"date_updated":"2023-02-23T10:33:21Z","date_created":"2018-12-12T11:39:12Z","title":"Model measuring for hybrid systems","citation":{"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>.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","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>","ieee":"T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST Austria, 2014.","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","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>"}},{"date_published":"2014-02-19T00:00:00Z","status":"public","type":"technical_report","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","page":"14","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publication_identifier":{"issn":["2664-1690"]},"month":"02","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":383052,"access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:49Z","date_created":"2018-12-12T11:53:20Z","file_id":"5481","checksum":"fcc3eab903cfcd3778b338d2d0d44d18","file_name":"IST-2014-172-v1+1_report.pdf"}],"oa_version":"Published Version","day":"19","language":[{"iso":"eng"}],"_id":"5417","file_date_updated":"2020-07-14T12:46:49Z","doi":"10.15479/AT:IST-2014-172-v1-1","year":"2014","oa":1,"date_updated":"2023-02-23T10:38:10Z","pubrep_id":"175","title":"From model checking to model measuring","date_created":"2018-12-12T11:39:13Z","citation":{"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>","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.","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>","ieee":"T. A. Henzinger and J. Otop, <i>From model checking to model measuring</i>. IST Austria, 2014.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.","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>.","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>."},"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"2327"}]}},{"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"status":"public","date_published":"2014-03-22T00:00:00Z","type":"technical_report","department":[{"_id":"KrCh"}],"page":"18","ddc":["000","005"],"publication_identifier":{"issn":["2664-1690"]},"month":"03","oa_version":"Published Version","day":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. Our results have tight connections with partial-observation stochastic games for which we derive new complexity results."}],"file":[{"date_updated":"2020-07-14T12:46:49Z","date_created":"2018-12-12T11:53:07Z","file_id":"5468","checksum":"1d6958aa60050e1c3e932c6e5f34c39f","file_name":"IST-2014-176-v1+1_icalp_14.pdf","relation":"main_file","file_size":328253,"content_type":"application/pdf","access_level":"open_access","creator":"system"}],"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"doi":"10.15479/AT:IST-2014-176-v1-1","file_date_updated":"2020-07-14T12:46:49Z","_id":"5418","language":[{"iso":"eng"}],"has_accepted_license":"1","related_material":{"record":[{"id":"2163","relation":"later_version","status":"public"}]},"oa":1,"pubrep_id":"176","date_updated":"2023-02-23T10:30:58Z","year":"2014","citation":{"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>.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","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>.","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>","ieee":"K. Chatterjee and L. Doyen, <i>Games with a weak adversary</i>. IST Austria, 2014.","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>"},"date_created":"2018-12-12T11:39:13Z","title":"Games with a weak adversary"},{"oa_version":"Published Version","day":"14","file":[{"file_id":"5548","checksum":"c608e66030a4bf51d2d99b451f539b99","file_name":"IST-2014-187-v1+1_main_full_tech.pdf","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:54:25Z","creator":"system","access_level":"open_access","file_size":670031,"content_type":"application/pdf","relation":"main_file"}],"abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"month":"04","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"page":"34","department":[{"_id":"KrCh"}],"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","status":"public","type":"technical_report","date_published":"2014-04-14T00:00:00Z","has_accepted_license":"1","title":"Improved algorithms for reachability and shortest path on low tree-width graphs","citation":{"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>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <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>.","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>","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.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, 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>"},"date_created":"2018-12-12T11:39:13Z","pubrep_id":"187","date_updated":"2021-01-12T08:02:03Z","oa":1,"year":"2014","doi":"10.15479/AT:IST-2014-187-v1-1","file_date_updated":"2020-07-14T12:46:50Z","language":[{"iso":"eng"}],"_id":"5419"},{"page":"49","department":[{"_id":"KrCh"}],"date_published":"2014-04-14T00:00:00Z","type":"technical_report","status":"public","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":584368,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:53:58Z","date_updated":"2020-07-14T12:46:50Z","checksum":"49e0fd3e62650346daf7dc04604f7a0a","file_name":"IST-2014-191-v1+1_main_full.pdf","file_id":"5520"}],"abstract":[{"lang":"eng","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)."}],"day":"14","oa_version":"Published Version","month":"04","publication_identifier":{"issn":["2664-1690"]},"ddc":["000","005"],"_id":"5420","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:50Z","doi":"10.15479/AT:IST-2014-191-v1-1","date_created":"2018-12-12T11:39:14Z","title":"The value 1 problem for concurrent mean-payoff games","citation":{"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>","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>","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>.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <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>."},"year":"2014","date_updated":"2021-01-12T08:02:05Z","oa":1,"pubrep_id":"191","has_accepted_license":"1"},{"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"day":"18","oa_version":"Published Version","file":[{"creator":"system","file_size":443529,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2014-190-v2+2_main_full.pdf","checksum":"42f3d8b563286eb0d903832bd9a848d3","file_id":"5538","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:54:16Z"},{"date_created":"2019-09-06T07:30:20Z","date_updated":"2020-07-14T12:46:50Z","file_name":"IST-2014-190-v1+1_main_full.pdf","file_id":"6852","checksum":"0c9a2fd822309719634495a35957e34d","file_size":440911,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"kschuh"}],"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."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"publication_identifier":{"issn":["2664-1690"]},"month":"04","department":[{"_id":"KrCh"}],"page":"27","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"status":"public","type":"technical_report","date_published":"2014-04-18T00:00:00Z","date_created":"2018-12-12T11:39:14Z","title":"The complexity of evolution on graphs","citation":{"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>","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.","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>.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p."},"pubrep_id":"190","date_updated":"2023-02-23T12:26:33Z","oa":1,"year":"2014","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"5432","relation":"later_version"},{"id":"5440","relation":"later_version","status":"public"}]},"file_date_updated":"2020-07-14T12:46:50Z","_id":"5421","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2014-190-v2-2"},{"file_date_updated":"2020-07-14T12:46:50Z","language":[{"iso":"eng"}],"_id":"5423","doi":"10.15479/AT:IST-2014-300-v1-1","pubrep_id":"300","date_updated":"2023-02-23T10:11:15Z","oa":1,"year":"2014","date_created":"2018-12-12T11:39:15Z","citation":{"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>","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>.","ista":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.","chicago":"Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. <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>.","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.","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."},"title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"1714","relation":"later_version"}]},"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"type":"technical_report","date_published":"2014-07-29T00:00:00Z","status":"public","page":"14","department":[{"_id":"KrCh"}],"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Alexander","full_name":"Kössler, Alexander","last_name":"Kössler"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"},{"full_name":"Schmid, Ulrich","first_name":"Ulrich","last_name":"Schmid"}],"publication_status":"published","ddc":["005"],"publication_identifier":{"issn":["2664-1690"]},"month":"07","oa_version":"Published Version","day":"29","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. "}],"file":[{"checksum":"4b8fde4d9ef6653837f6803921d83032","file_name":"IST-2014-300-v1+1_main.pdf","file_id":"5514","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:53:53Z","creator":"system","relation":"main_file","file_size":1270021,"access_level":"open_access","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"12","department":[{"_id":"KrCh"}],"type":"technical_report","status":"public","date_published":"2014-09-09T00:00:00Z","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file":[{"date_created":"2018-12-12T11:53:51Z","date_updated":"2020-07-14T12:46:51Z","checksum":"35009d5fad01198341e6c1a3353481b7","file_name":"IST-2014-305-v1+1_main.pdf","file_id":"5512","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_size":655774,"creator":"system"}],"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"09","month":"09","publication_identifier":{"issn":["2664-1690"]},"ddc":["005"],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"last_name":"Gupta","full_name":"Gupta, Raghav","first_name":"Raghav"},{"full_name":"Kanodia, Ayush","first_name":"Ayush","last_name":"Kanodia"}],"publication_status":"published","doi":"10.15479/AT:IST-2014-305-v1-1","language":[{"iso":"eng"}],"_id":"5424","file_date_updated":"2020-07-14T12:46:51Z","has_accepted_license":"1","related_material":{"record":[{"relation":"later_version","id":"1732","status":"public"},{"relation":"later_version","id":"5426","status":"public"}]},"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","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>","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, 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>.","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>.","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>"},"date_created":"2018-12-12T11:39:15Z","year":"2014","oa":1,"date_updated":"2023-02-23T12:25:52Z","pubrep_id":"305"},{"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","date_published":"2014-09-29T00:00:00Z","status":"public","type":"technical_report","page":"10","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"full_name":"Gupta, Raghav","first_name":"Raghav","last_name":"Gupta"},{"first_name":"Ayush","full_name":"Kanodia, Ayush","last_name":"Kanodia"}],"publication_status":"published","ddc":["005"],"month":"09","publication_identifier":{"issn":["2664-1690"]},"day":"29","oa_version":"Published Version","file":[{"file_name":"IST-2014-305-v2+1_main2.pdf","file_id":"5537","checksum":"730c0a8e97cf2712a884b2cc423f3919","date_created":"2018-12-12T11:54:15Z","date_updated":"2020-07-14T12:46:51Z","creator":"system","file_size":656019,"access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:51Z","_id":"5426","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2014-305-v2-1","date_updated":"2023-02-23T12:25:47Z","pubrep_id":"311","oa":1,"year":"2014","date_created":"2018-12-12T11:39:16Z","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","citation":{"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>.","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>.","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>","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.","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>"},"related_material":{"record":[{"status":"public","relation":"later_version","id":"1732"},{"status":"public","relation":"earlier_version","id":"5424"}]},"has_accepted_license":"1"},{"department":[{"_id":"KrCh"}],"page":"24","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"type":"technical_report","date_published":"2014-11-05T00:00:00Z","status":"public","day":"05","oa_version":"Published Version","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":405561,"relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:53:10Z","file_name":"IST-2014-314-v1+1_long.pdf","checksum":"9d3b90bf4fff74664f182f2d95ef727a","file_id":"5471"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"ddc":["000"],"month":"11","publication_identifier":{"issn":["2664-1690"]},"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"}],"publication_status":"published","doi":"10.15479/AT:IST-2014-314-v1-1","file_date_updated":"2020-07-14T12:46:52Z","language":[{"iso":"eng"}],"_id":"5427","has_accepted_license":"1","date_created":"2018-12-12T11:39:16Z","title":"Optimal tree-decomposition balancing and reachability on low treewidth graphs","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, 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>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Optimal tree-decomposition balancing and reachability on low treewidth graphs</i>. IST Austria, 2014.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.","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>.","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>"},"pubrep_id":"314","date_updated":"2021-01-12T08:02:09Z","oa":1,"year":"2014"},{"has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"1066","relation":"later_version"}]},"title":"Quantitative fair simulation games","date_created":"2018-12-12T11:39:16Z","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, <i>Quantitative fair simulation games</i>. IST Austria, 2014.","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>","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.","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>.","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>.","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>"},"year":"2014","date_updated":"2023-09-20T12:07:48Z","pubrep_id":"315","oa":1,"doi":"10.15479/AT:IST-2014-315-v1-1","_id":"5428","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:52Z","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:52Z","date_created":"2018-12-12T11:53:59Z","file_id":"5521","checksum":"b1d573bc04365625ff9974880c0aa807","file_name":"IST-2014-315-v1+1_report.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":531046,"creator":"system"}],"oa_version":"Published Version","day":"05","publication_identifier":{"issn":["2664-1690"]},"month":"12","ddc":["004"],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"publication_status":"published","page":"26","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"technical_report","date_published":"2014-12-05T00:00:00Z","status":"public","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"]}]