{"article_processing_charge":"No","title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","date_created":"2018-12-11T11:44:51Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:53Z","intvolume":"     10982","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"day":"18","page":"178-197","publisher":"Springer","file":[{"access_level":"open_access","file_id":"5737","relation":"main_file","file_name":"2018_LNCS_Chatterjee.pdf","content_type":"application/pdf","date_created":"2018-12-18T08:52:38Z","file_size":675606,"date_updated":"2020-07-14T12:44:53Z","checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","creator":"dernst"}],"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publist_id":"7782","conference":{"start_date":"2018-07-14","end_date":"2018-07-17","location":"Oxford, United Kingdom","name":"CAV: Computer Aided Verification"},"date_published":"2018-07-18T00:00:00Z","oa_version":"Published Version","oa":1,"ec_funded":1,"abstract":[{"text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples.","lang":"eng"}],"department":[{"_id":"KrCh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-19T09:59:55Z","has_accepted_license":"1","external_id":{"isi":["000491469700013"]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"},{"last_name":"Oraee","first_name":"Simin","full_name":"Oraee, Simin"},{"full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X"}],"alternative_title":["LNCS"],"quality_controlled":"1","doi":"10.1007/978-3-319-96142-2_13","year":"2018","_id":"141","month":"07","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives</i>. Vol. 10982, Springer, 2018, pp. 178–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.","ieee":"K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>.","apa":"Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., &#38; Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>"},"ddc":["000"],"volume":10982,"scopus_import":"1","publication_status":"published","isi":1,"acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","status":"public","related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]}}