[{"month":"02","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa_version":"Published Version","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"date_created":"2018-12-12T11:39:11Z","related_material":{"record":[{"status":"public","id":"2063","relation":"later_version"},{"relation":"earlier_version","status":"public","id":"5412"},{"relation":"later_version","id":"5414","status":"public"}]},"doi":"10.15479/AT:IST-2014-153-v2-2","date_published":"2014-02-06T00:00:00Z","page":"33","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T11:54:17Z","file_name":"IST-2014-153-v2+2_main.pdf","date_updated":"2020-07-14T12:46:47Z","file_size":606049,"creator":"system","checksum":"ce4967a184d84863eec76c66cbac1614","file_id":"5539","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"day":"06","publication_status":"published","year":"2014","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"164","status":"public","type":"technical_report","_id":"5413","title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2.","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v2-2","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014."},"date_updated":"2023-02-23T12:25:18Z"},{"pubrep_id":"165","status":"public","type":"technical_report","_id":"5414","file_date_updated":"2020-07-14T12:46:48Z","title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:25:15Z","citation":{"chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.","mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1.","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v3-1","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014."},"month":"02","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. \r\nWe have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"date_created":"2018-12-12T11:39:12Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"2063"},{"relation":"earlier_version","status":"public","id":"5412"},{"status":"public","id":"5413","relation":"earlier_version"}]},"date_published":"2014-02-07T00:00:00Z","doi":"10.15479/AT:IST-2014-153-v3-1","page":"33","language":[{"iso":"eng"}],"file":[{"file_id":"5464","checksum":"87b93fe9af71fc5c94b0eb6151537e11","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T11:53:03Z","file_name":"IST-2014-153-v3+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:48Z","file_size":606227}],"day":"07","publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"mla":"Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.","ieee":"K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.","short":"K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.","ama":"Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1","apa":"Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1","chicago":"Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.","ista":"Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p."},"date_updated":"2023-02-23T12:25:18Z","title":"CEGAR for qualitative analysis of probabilistic systems","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:47Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"}],"_id":"5412","status":"public","pubrep_id":"153","type":"technical_report","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5500","checksum":"4d6cda4bebed970926403ad6ad8c745f","file_size":423322,"date_updated":"2020-07-14T12:46:47Z","creator":"system","file_name":"IST-2014-153-v1+1_main.pdf","date_created":"2018-12-12T11:53:39Z"}],"day":"29","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","doi":"10.15479/AT:IST-2014-153-v1-1","related_material":{"record":[{"id":"2063","status":"public","relation":"later_version"},{"status":"public","id":"5413","relation":"later_version"},{"id":"5414","status":"public","relation":"later_version"}]},"date_published":"2014-01-29T00:00:00Z","date_created":"2018-12-12T11:39:11Z","page":"31","oa_version":"Published Version","abstract":[{"text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability.\r\nWe introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.\r\nWe present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. ","lang":"eng"}],"month":"01","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1},{"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:25:29Z","status":"public","type":"conference","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2014-07-08","location":"Copenhagen, Denmark","end_date":"2014-07-11"},"_id":"2163","related_material":{"record":[{"id":"5418","status":"public","relation":"earlier_version"}]},"volume":8573,"issue":"Part 2","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"01","intvolume":" 8573","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1404.5453"}],"oa_version":"Preprint","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games.","lang":"eng"}],"title":"Games with a weak adversary","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"publist_id":"4821","external_id":{"arxiv":["1404.5453"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.","short":"K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.","apa":"Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10","ama":"Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in Computer Science. Vol 8573. Springer; 2014:110-121. doi:10.1007/978-3-662-43951-7_10","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10."},"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-662-43951-7_10","date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:56:04Z","page":"110 - 121","day":"01","publication":"Lecture Notes in Computer Science","year":"2014","publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"This research was partly supported by European project Cassting (FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n"},{"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"04","abstract":[{"lang":"eng","text":"We consider the reachability and shortest path problems on low tree-width graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize W. We use O to hide polynomial factors of the inverse of the Ackermann function. Our main contributions are three fold:\r\n1. For reachability, we present an algorithm that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space, and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries. Note that for constant t our algorithm uses O(n·logn) time for preprocessing; and O(n/W) time for single-source queries, which is faster than depth first search/breath first search (after the preprocessing).\r\n2. We present an algorithm for shortest path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus query time trade-off algorithm for shortest path that, given any constant >0, requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair queries.\r\nOur algorithms improve all existing results, and use very simple data structures."}],"oa_version":"Published Version","page":"34","doi":"10.15479/AT:IST-2014-187-v1-1","date_published":"2014-04-14T00:00:00Z","date_created":"2018-12-12T11:39:13Z","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","file":[{"creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":670031,"date_created":"2018-12-12T11:54:25Z","file_name":"IST-2014-187-v1+1_main_full_tech.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c608e66030a4bf51d2d99b451f539b99","file_id":"5548"}],"day":"14","language":[{"iso":"eng"}],"type":"technical_report","status":"public","pubrep_id":"187","_id":"5419","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"title":"Improved algorithms for reachability and shortest path on low tree-width graphs","file_date_updated":"2020-07-14T12:46:50Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:02:03Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-187-v1-1","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"]},{"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5416"}]},"ec_funded":1,"abstract":[{"text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem.","lang":"eng"}],"oa_version":"None","scopus_import":1,"month":"04","date_updated":"2023-02-23T12:25:23Z","department":[{"_id":"ToHe"}],"_id":"2217","type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2014-04-15","end_date":"2014-04-17","location":"Berlin, Germany"},"status":"public","year":"2014","day":"01","publication":"Proceedings of the 17th international conference on Hybrid systems: computation and control","page":"213 - 222","date_published":"2014-04-01T00:00:00Z","doi":"10.1145/2562059.2562130","date_created":"2018-12-11T11:56:23Z","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 Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171","quality_controlled":"1","publisher":"Springer","citation":{"ieee":"T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.","short":"T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.","apa":"Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562130","ama":"Henzinger TA, Otop J. Model measuring for hybrid systems. In: Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control. Springer; 2014:213-222. doi:10.1145/2562059.2562130","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, 213–22. Springer, 2014. https://doi.org/10.1145/2562059.2562130."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"publist_id":"4751","article_processing_charge":"No","title":"Model measuring for hybrid systems","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}]},{"_id":"5417","type":"technical_report","status":"public","pubrep_id":"175","citation":{"chicago":"Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1.","ista":"Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.","mla":"Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.","ama":"Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria; 2014. doi:10.15479/AT:IST-2014-172-v1-1","apa":"Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring. IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1","short":"T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.","ieee":"T. A. Henzinger and J. Otop, From model checking to model measuring. IST Austria, 2014."},"date_updated":"2023-02-23T10:38:10Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"title":"From model checking to model measuring","file_date_updated":"2020-07-14T12:46:49Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M'within distance ρ from M satisfy (or violate)φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata.\r\nThe model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification.\r\nWe show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved.\r\nWe use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. \r\nWe give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications."}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"02","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","file":[{"file_name":"IST-2014-172-v1+1_report.pdf","date_created":"2018-12-12T11:53:20Z","file_size":383052,"date_updated":"2020-07-14T12:46:49Z","creator":"system","file_id":"5481","checksum":"fcc3eab903cfcd3778b338d2d0d44d18","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"day":"19","language":[{"iso":"eng"}],"page":"14","doi":"10.15479/AT:IST-2014-172-v1-1","date_published":"2014-02-19T00:00:00Z","related_material":{"record":[{"status":"public","id":"2327","relation":"later_version"}]},"date_created":"2018-12-12T11:39:13Z"},{"oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"02","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."}],"oa_version":"Published Version","page":"22","date_created":"2018-12-12T11:39:12Z","related_material":{"record":[{"relation":"later_version","id":"2217","status":"public"}]},"date_published":"2014-02-19T00:00:00Z","doi":"10.15479/AT:IST-2014-171-v1-1","publication_status":"published","year":"2014","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"19","file":[{"date_updated":"2020-07-14T12:46:49Z","file_size":712077,"creator":"system","date_created":"2018-12-12T11:53:32Z","file_name":"IST-2014-171-v1+1_report.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"445456d22371e4e49aad2b9a0c13bf80","file_id":"5492"}],"type":"technical_report","pubrep_id":"171","status":"public","_id":"5416","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Model measuring for hybrid systems","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:49Z","date_updated":"2023-02-23T10:33:21Z","citation":{"chicago":"Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-171-v1-1.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","mla":"Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.","ieee":"T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST Austria, 2014.","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","apa":"Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-171-v1-1","ama":"Henzinger TA, Otop J. Model Measuring for Hybrid Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-171-v1-1"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"citation":{"ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.","ieee":"K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","ama":"Chatterjee K, Doyen L. Games with a Weak Adversary. IST Austria; 2014. doi:10.15479/AT:IST-2014-176-v1-1","apa":"Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1."},"date_updated":"2023-02-23T10:30:58Z","department":[{"_id":"KrCh"}],"title":"Games with a weak adversary","file_date_updated":"2020-07-14T12:46:49Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"_id":"5418","status":"public","pubrep_id":"176","type":"technical_report","file":[{"file_size":328253,"date_updated":"2020-07-14T12:46:49Z","creator":"system","file_name":"IST-2014-176-v1+1_icalp_14.pdf","date_created":"2018-12-12T11:53:07Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"1d6958aa60050e1c3e932c6e5f34c39f","file_id":"5468"}],"day":"22","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","year":"2014","publication_status":"published","related_material":{"record":[{"status":"public","id":"2163","relation":"later_version"}]},"doi":"10.15479/AT:IST-2014-176-v1-1","date_published":"2014-03-22T00:00:00Z","date_created":"2018-12-12T11:39:13Z","page":"18","oa_version":"Published Version","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."}],"month":"03","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1},{"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)."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"04","publication_status":"published","year":"2014","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"14","file":[{"date_created":"2018-12-12T11:53:58Z","file_name":"IST-2014-191-v1+1_main_full.pdf","creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":584368,"checksum":"49e0fd3e62650346daf7dc04604f7a0a","file_id":"5520","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"page":"49","date_created":"2018-12-12T11:39:14Z","doi":"10.15479/AT:IST-2014-191-v1-1","date_published":"2014-04-14T00:00:00Z","_id":"5420","type":"technical_report","pubrep_id":"191","status":"public","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.","short":"K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.","ieee":"K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.","ama":"Chatterjee K, Ibsen-Jensen R. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-191-v1-1","apa":"Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p."},"date_updated":"2021-01-12T08:02:05Z","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"}],"file_date_updated":"2020-07-14T12:46:50Z","department":[{"_id":"KrCh"}],"title":"The value 1 problem for concurrent mean-payoff games"},{"publisher":"none","oa":1,"oa_version":"None","abstract":[{"text":"Notes from the Third Plenary for the Research Data Alliance in Dublin, Ireland on March 26 to 28, 2014 with focus on starting an institutional research data repository.","lang":"eng"}],"date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-12T11:39:14Z","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5501","checksum":"3954896648ce8afa8f7c4425e71cff08","file_size":648585,"date_updated":"2020-07-14T12:46:50Z","creator":"system","file_name":"IST-2014-254-v1+1_Dublin_Day_3.pdf","date_created":"2018-12-12T11:53:40Z"},{"file_name":"IST-2014-254-v1+2_Dublin_Day_1.pdf","date_created":"2018-12-12T11:53:41Z","file_size":221339,"date_updated":"2020-07-14T12:46:50Z","creator":"system","checksum":"9a0d42b0b832dfe7e4b22fb6816bcbba","file_id":"5502","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"date_updated":"2020-07-14T12:46:50Z","file_size":187778,"creator":"system","date_created":"2018-12-12T11:53:42Z","file_name":"IST-2014-254-v1+3_Dublin_Day_2.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"498b8d629fb1bd17bff1dc43700a93e6","file_id":"5503"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2014","status":"public","pubrep_id":"254","type":"report","_id":"5422","department":[{"_id":"E-Lib"}],"title":"Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland","file_date_updated":"2020-07-14T12:46:50Z","author":[{"first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","last_name":"Porsche","full_name":"Porsche, Jana"}],"ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:04:56Z","citation":{"chicago":"Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland. none, 2014.","ista":"Porsche J. 2014. Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland, none,p.","mla":"Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland. none, 2014.","apa":"Porsche, J. (2014). Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland. none.","ama":"Porsche J. Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland. none; 2014.","ieee":"J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland. none, 2014.","short":"J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland, none, 2014."}},{"citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.","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. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v1-1.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria; 2014. doi:10.15479/AT:IST-2014-305-v1-1"},"date_updated":"2023-02-23T12:25:52Z","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"last_name":"Gupta","full_name":"Gupta, Raghav","first_name":"Raghav"},{"full_name":"Kanodia, Ayush","last_name":"Kanodia","first_name":"Ayush"}],"file_date_updated":"2020-07-14T12:46:51Z","title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","department":[{"_id":"KrCh"}],"_id":"5424","type":"technical_report","pubrep_id":"305","status":"public","year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"09","file":[{"date_updated":"2020-07-14T12:46:51Z","file_size":655774,"creator":"system","date_created":"2018-12-12T11:53:51Z","file_name":"IST-2014-305-v1+1_main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5512","checksum":"35009d5fad01198341e6c1a3353481b7"}],"page":"12","date_created":"2018-12-12T11:39:15Z","doi":"10.15479/AT:IST-2014-305-v1-1","date_published":"2014-09-09T00:00:00Z","related_material":{"record":[{"status":"public","id":"1732","relation":"later_version"},{"status":"public","id":"5426","relation":"later_version"}]},"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.","lang":"eng"}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"09"},{"date_created":"2018-12-12T11:39:16Z","doi":"10.15479/AT:IST-2014-305-v2-1","related_material":{"record":[{"relation":"later_version","id":"1732","status":"public"},{"relation":"earlier_version","id":"5424","status":"public"}]},"date_published":"2014-09-29T00:00:00Z","page":"10","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T11:54:15Z","file_name":"IST-2014-305-v2+1_main2.pdf","date_updated":"2020-07-14T12:46:51Z","file_size":656019,"creator":"system","checksum":"730c0a8e97cf2712a884b2cc423f3919","file_id":"5537","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"day":"29","year":"2014","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"09","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty."}],"title":"Qualitative analysis of POMDPs with temporal logic specifications for robotics applications","file_date_updated":"2020-07-14T12:46:51Z","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Raghav","full_name":"Gupta, Raghav","last_name":"Gupta"},{"last_name":"Kanodia","full_name":"Kanodia, Ayush","first_name":"Ayush"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"date_updated":"2023-02-23T12:25:47Z","citation":{"ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria; 2014. doi:10.15479/AT:IST-2014-305-v2-1","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v2-1."},"pubrep_id":"311","status":"public","type":"technical_report","_id":"5426"},{"_id":"5423","type":"technical_report","status":"public","pubrep_id":"300","citation":{"chicago":"Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1.","ista":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.","mla":"Chatterjee, Krishnendu, et al. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014, doi:10.15479/AT:IST-2014-300-v1-1.","apa":"Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1","ama":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria; 2014. doi:10.15479/AT:IST-2014-300-v1-1","ieee":"K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.","short":"K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014."},"date_updated":"2023-02-23T10:11:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kössler, Alexander","last_name":"Kössler","first_name":"Alexander"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"}],"file_date_updated":"2020-07-14T12:46:50Z","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm- deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including D(over), that have been proposed in the past, for various tasksets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are tasksets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application. "}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"07","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","year":"2014","day":"29","file":[{"checksum":"4b8fde4d9ef6653837f6803921d83032","file_id":"5514","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T11:53:53Z","file_name":"IST-2014-300-v1+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:50Z","file_size":1270021}],"language":[{"iso":"eng"}],"page":"14","doi":"10.15479/AT:IST-2014-300-v1-1","related_material":{"record":[{"relation":"later_version","id":"1714","status":"public"}]},"date_published":"2014-07-29T00:00:00Z","date_created":"2018-12-12T11:39:15Z"},{"language":[{"iso":"eng"}],"day":"05","file":[{"date_created":"2018-12-12T11:53:10Z","file_name":"IST-2014-314-v1+1_long.pdf","creator":"system","date_updated":"2020-07-14T12:46:52Z","file_size":405561,"file_id":"5471","checksum":"9d3b90bf4fff74664f182f2d95ef727a","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:16Z","doi":"10.15479/AT:IST-2014-314-v1-1","date_published":"2014-11-05T00:00:00Z","page":"24","oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"month":"11","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.","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. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-314-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1","mla":"Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1."},"date_updated":"2021-01-12T08:02:09Z","department":[{"_id":"KrCh"}],"title":"Optimal tree-decomposition balancing and reachability on low treewidth graphs","file_date_updated":"2020-07-14T12:46:52Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"_id":"5427","pubrep_id":"314","status":"public","type":"technical_report"},{"pubrep_id":"307","status":"public","type":"technical_report","_id":"5425","file_date_updated":"2020-07-14T12:46:51Z","title":"Optimal cost almost-sure reachability in POMDPs","author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"full_name":"Anonymous, 3","last_name":"Anonymous","first_name":"3"},{"full_name":"Anonymous, 4","last_name":"Anonymous","first_name":"4"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria, 2014.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2014. Optimal cost almost-sure reachability in POMDPs, IST Austria, 22p.","mla":"Anonymous, 1, et al. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria, 2014.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria; 2014.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2014). Optimal cost almost-sure reachability in POMDPs. IST Austria.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Optimal cost almost-sure reachability in POMDPs. IST Austria, 2014.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014."},"date_updated":"2023-02-23T10:02:57Z","month":"09","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":" We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest."}],"date_created":"2018-12-12T11:39:15Z","date_published":"2014-09-09T00:00:00Z","related_material":{"record":[{"status":"public","id":"1529","relation":"later_version"}]},"page":"22","language":[{"iso":"eng"}],"file":[{"file_size":2725429,"date_updated":"2020-07-14T12:46:51Z","creator":"system","file_name":"IST-2014-307-v1+1_main.pdf","date_created":"2018-12-12T11:53:17Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5478","checksum":"b9668a70d53c550b3cd64f0c77451c3d"},{"date_created":"2019-04-16T14:16:12Z","file_name":"IST-2014-307-v1+2_authors.txt","creator":"dernst","date_updated":"2020-07-14T12:46:51Z","file_size":117,"file_id":"6322","checksum":"808ada1dddecc48ca041526fcc6a9efd","access_level":"closed","relation":"main_file","content_type":"text/plain"}],"day":"09","year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]}},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2014","day":"19","file":[{"creator":"system","date_updated":"2020-07-14T12:46:48Z","file_size":573457,"date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5497","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7"}],"language":[{"iso":"eng"}],"page":"27","related_material":{"record":[{"id":"1656","status":"public","relation":"later_version"},{"id":"467","status":"public","relation":"later_version"},{"id":"5436","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2014-170-v1-1","date_published":"2014-02-19T00:00:00Z","date_created":"2018-12-12T11:39:12Z","abstract":[{"lang":"eng","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. "}],"oa_version":"Published Version","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"month":"02","date_updated":"2023-02-23T12:26:19Z","citation":{"mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2014. doi:10.15479/AT:IST-2014-170-v1-1","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p."},"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Nested weighted automata","file_date_updated":"2020-07-14T12:46:48Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"5415","type":"technical_report","status":"public","pubrep_id":"170"},{"_id":"5421","pubrep_id":"190","status":"public","type":"technical_report","ddc":["000","005"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:26:33Z","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolution on Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-190-v2-2","mla":"Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2."},"title":"The complexity of evolution on graphs","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:50Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom 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."}],"month":"04","oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","language":[{"iso":"eng"}],"day":"18","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"42f3d8b563286eb0d903832bd9a848d3","file_id":"5538","file_size":443529,"date_updated":"2020-07-14T12:46:50Z","creator":"system","file_name":"IST-2014-190-v2+2_main_full.pdf","date_created":"2018-12-12T11:54:16Z"},{"file_id":"6852","checksum":"0c9a2fd822309719634495a35957e34d","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-09-06T07:30:20Z","file_name":"IST-2014-190-v1+1_main_full.pdf","date_updated":"2020-07-14T12:46:50Z","file_size":440911,"creator":"kschuh"}],"year":"2014","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:14Z","related_material":{"record":[{"status":"public","id":"5432","relation":"later_version"},{"relation":"later_version","id":"5440","status":"public"}]},"doi":"10.15479/AT:IST-2014-190-v2-2","date_published":"2014-04-18T00:00:00Z","page":"27"},{"abstract":[{"text":"We consider homogeneous Bose gas in a large cubic box with periodic boundary conditions, at zero temperature. We analyze its excitation spectrum in a certain kind of a mean-field infinite-volume limit. We prove that under appropriate conditions the excitation spectrum has the form predicted by the Bogoliubov approximation. Our result can be viewed as an extension of the result of Seiringer (Commun. Math. Phys.306:565–578, 2011) to large volumes.","lang":"eng"}],"oa_version":"Published Version","month":"01","intvolume":" 15","publication_identifier":{"issn":["1424-0637","1424-0661"]},"publication_status":"published","file":[{"checksum":"1f6c32c5d6ec90cdb0718c7f0103342e","file_id":"5814","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-01-10T09:04:45Z","file_name":"2014_Annales_Derezinski.pdf","date_updated":"2020-07-14T12:47:11Z","file_size":865230,"creator":"dernst"}],"language":[{"iso":"eng"}],"issue":"12","volume":15,"related_material":{"link":[{"url":"https://doi.org/10.1007/s00023-014-0390-9","relation":"erratum"}]},"_id":"5813","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2021-11-16T08:13:24Z","extern":"1","ddc":["530"],"file_date_updated":"2020-07-14T12:47:11Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"has_accepted_license":"1","year":"2014","day":"10","publication":"Annales Henri Poincaré","page":"2409-2439","date_published":"2014-01-10T00:00:00Z","doi":"10.1007/s00023-013-0302-4","date_created":"2019-01-10T09:02:58Z","citation":{"mla":"Dereziński, Jan, and Marcin M. Napiórkowski. “Excitation Spectrum of Interacting Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré, vol. 15, no. 12, Springer Nature, 2014, pp. 2409–39, doi:10.1007/s00023-013-0302-4.","ieee":"J. Dereziński and M. M. Napiórkowski, “Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit,” Annales Henri Poincaré, vol. 15, no. 12. Springer Nature, pp. 2409–2439, 2014.","short":"J. Dereziński, M.M. Napiórkowski, Annales Henri Poincaré 15 (2014) 2409–2439.","ama":"Dereziński J, Napiórkowski MM. Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 2014;15(12):2409-2439. doi:10.1007/s00023-013-0302-4","apa":"Dereziński, J., & Napiórkowski, M. M. (2014). Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. Springer Nature. https://doi.org/10.1007/s00023-013-0302-4","chicago":"Dereziński, Jan, and Marcin M Napiórkowski. “Excitation Spectrum of Interacting Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré. Springer Nature, 2014. https://doi.org/10.1007/s00023-013-0302-4.","ista":"Dereziński J, Napiórkowski MM. 2014. Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 15(12), 2409–2439."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Dereziński, Jan","last_name":"Dereziński","first_name":"Jan"},{"last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume limit"},{"series_title":"Lecture Notes in Computer Science","_id":"5810","status":"public","conference":{"name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2014-09-12","location":"Siena, Italy","start_date":"2014-09-10"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2019-01-24T13:22:49Z","citation":{"mla":"Biswas, Ranita, and Partha Bhowmick. On Finding Spherical Geodesic Paths and Circles in ℤ3. Vol. 8668, Springer, 2014, pp. 396–409, doi:10.1007/978-3-319-09955-2_33.","apa":"Biswas, R., & Bhowmick, P. (2014). On Finding Spherical Geodesic Paths and Circles in ℤ3. Presented at the DGCI: International Conference on Discrete Geometry for Computer Imagery, Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-319-09955-2_33","ama":"Biswas R, Bhowmick P. On Finding Spherical Geodesic Paths and Circles in ℤ3. 2014;8668:396-409. doi:10.1007/978-3-319-09955-2_33","short":"R. Biswas, P. Bhowmick, 8668 (2014) 396–409.","ieee":"R. Biswas and P. Bhowmick, “On Finding Spherical Geodesic Paths and Circles in ℤ3,” vol. 8668. Springer, Berlin, Heidelberg, pp. 396–409, 2014.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Finding Spherical Geodesic Paths and Circles in ℤ3.” Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-319-09955-2_33.","ista":"Biswas R, Bhowmick P. 2014. On Finding Spherical Geodesic Paths and Circles in ℤ3. 8668, 396–409."},"title":"On Finding Spherical Geodesic Paths and Circles in ℤ3","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"oa_version":"None","abstract":[{"text":"A discrete spherical geodesic path between two voxels s and t lying on a discrete sphere is a/the 1-connected shortest path from s to t, comprising voxels of the discrete sphere intersected by the real plane passing through s, t, and the center of the sphere. We show that the set of sphere voxels intersected by the aforesaid real plane always contains a 1-connected cycle passing through s and t, and each voxel in this set lies within an isothetic distance of 32 from the concerned plane. Hence, to compute the path, the algorithm starts from s, and iteratively computes each voxel p of the path from the predecessor of p. A novel number-theoretic property and the 48-symmetry of discrete sphere are used for searching the 1-connected voxels comprising the path. The algorithm is output-sensitive, having its time and space complexities both linear in the length of the path. It can be extended for constructing 1-connected discrete 3D circles of arbitrary orientations, specified by a few appropriate input parameters. Experimental results and related analysis demonstrate its efficiency and versatility.","lang":"eng"}],"intvolume":" 8668","place":"Berlin, Heidelberg","quality_controlled":"1","publisher":"Springer","language":[{"iso":"eng"}],"year":"2014","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642387081","9783642387098"]},"date_created":"2019-01-08T20:45:32Z","date_published":"2014-01-01T00:00:00Z","volume":8668,"doi":"10.1007/978-3-319-09955-2_33","page":"396-409"}]