{"file":[{"creator":"system","file_id":"5597","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T13:02:31Z","checksum":"b8bcb43c0893023cda66c1b69c16ac62","access_level":"open_access","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","relation":"main_file","file_size":49557109,"content_type":"application/zip"}],"publist_id":"5564","oa_version":"Published Version","title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"date_published":"2015-08-13T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","publisher":"Institute of Science and Technology Austria","year":"2015","ec_funded":1,"tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"day":"13","date_updated":"2024-02-21T13:52:07Z","contributor":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"}],"type":"research_data","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication."}],"_id":"5549","doi":"10.15479/AT:ISTA:28","author":[{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","last_name":"Fellner","full_name":"Fellner, Andreas","first_name":"Andreas"}],"related_material":{"record":[{"status":"public","id":"1603","relation":"popular_science"}]},"citation":{"mla":"Fellner, Andreas. <i>Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Institute of Science and Technology Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>","short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>"},"datarep_id":"28","month":"08","date_created":"2018-12-12T12:31:29Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"oa":1,"file_date_updated":"2020-07-14T12:47:00Z","status":"public","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}]}