{"id":"https://openalex.org/W2104851058","doi":"https://doi.org/10.1109/dsn.2011.5958249","title":"Incremental quantitative verification for Markov decision processes","display_name":"Incremental quantitative verification for Markov decision processes","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2104851058","doi":"https://doi.org/10.1109/dsn.2011.5958249","mag":"2104851058"},"language":"en","primary_location":{"id":"doi:10.1109/dsn.2011.5958249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2011.5958249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00647057","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081710233","display_name":"Marta Kwiatkowska","orcid":"https://orcid.org/0000-0001-9022-7599"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marta Kwiatkowska","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, UK","Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036097359","display_name":"David Parker","orcid":"https://orcid.org/0000-0003-4137-8862"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David Parker","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, UK","Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059964100","display_name":"Hongyang Qu","orcid":"https://orcid.org/0000-0002-1643-8926"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hongyang Qu","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, UK","Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Parks Road, OX1 3QD, UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081710233"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":7.755,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.97922306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"359","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8263888359069824},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6751472353935242},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5432726740837097},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5230225920677185},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.502002477645874},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4876045286655426},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.4529227316379547},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45081740617752075},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4477967917919159},{"id":"https://openalex.org/keywords/runtime-verification","display_name":"Runtime verification","score":0.4386349022388458},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43202781677246094},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4299718141555786},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.39037710428237915},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.35168975591659546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.346546471118927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27780863642692566},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2697598934173584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09889295697212219}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8263888359069824},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6751472353935242},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5432726740837097},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5230225920677185},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.502002477645874},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4876045286655426},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4529227316379547},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45081740617752075},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4477967917919159},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.4386349022388458},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43202781677246094},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4299718141555786},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.39037710428237915},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.35168975591659546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.346546471118927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27780863642692566},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2697598934173584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09889295697212219},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/dsn.2011.5958249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2011.5958249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.5244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.5244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/64/70/57/PDF/pds11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.431.6255","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.6255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.prismmodelchecker.org/papers/pds11.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00647057v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00647057","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN-PDS'11), 2011, Hong Kong, China. pp.359--370","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00647057v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00647057","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN-PDS'11), 2011, Hong Kong, China. pp.359--370","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G700232126","display_name":null,"funder_award_id":"EP/F001096/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320321837","display_name":"Ministerio de Econom\u00eda y Competitividad","ror":"https://ror.org/034900433"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1480531236","https://openalex.org/W1516849933","https://openalex.org/W1538639190","https://openalex.org/W1553574558","https://openalex.org/W1862398452","https://openalex.org/W1972203711","https://openalex.org/W1999354872","https://openalex.org/W1999787317","https://openalex.org/W2005998857","https://openalex.org/W2020293036","https://openalex.org/W2020944181","https://openalex.org/W2023808162","https://openalex.org/W2028827800","https://openalex.org/W2057873236","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2084063516","https://openalex.org/W2111578598","https://openalex.org/W2111765806","https://openalex.org/W2118382442","https://openalex.org/W2119091865","https://openalex.org/W2119567691","https://openalex.org/W2135366134","https://openalex.org/W2154796631","https://openalex.org/W2155791623","https://openalex.org/W4230164823","https://openalex.org/W4233840023","https://openalex.org/W4242441073","https://openalex.org/W6628896633","https://openalex.org/W6630676637","https://openalex.org/W6636070549","https://openalex.org/W6638944184","https://openalex.org/W6655598657","https://openalex.org/W6665773200","https://openalex.org/W7001894244"],"related_works":["https://openalex.org/W2406499533","https://openalex.org/W2809618173","https://openalex.org/W2149716943","https://openalex.org/W3036403349","https://openalex.org/W2037121848","https://openalex.org/W4312733571","https://openalex.org/W2006962382","https://openalex.org/W4315606162","https://openalex.org/W2528097415","https://openalex.org/W113732979"],"abstract_inverted_index":{"Quantitative":[0],"verification":[1,49,62,90],"techniques":[2,46],"provide":[3],"an":[4],"effective":[5],"means":[6],"of":[7,17,50,68,110,116],"computing":[8],"performance":[9],"and":[10,92],"reliability":[11],"properties":[12],"for":[13,35,47],"a":[14,66,114],"wide":[15],"range":[16],"systems.":[18],"However,":[19],"the":[20,69,108,111],"computation":[21],"required":[22],"can":[23,84,95],"be":[24,31,85,96],"expensive,":[25],"particularly":[26],"if":[27],"it":[28,94],"has":[29],"to":[30,37,57,88,102],"performed":[32],"multiple":[33],"times,":[34],"example":[36],"determine":[38],"optimal":[39],"system":[40],"parameters.":[41],"We":[42,77,106],"present":[43],"efficient":[44],"incremental":[45],"quantitative":[48],"Markov":[51],"decision":[52],"processes,":[53],"which":[54],"are":[55],"able":[56],"re-use":[58],"results":[59],"from":[60],"previous":[61],"runs,":[63],"based":[64],"on":[65,113],"decomposition":[67],"model":[70],"into":[71],"its":[72],"strongly":[73],"connected":[74],"components":[75],"(SCCs).":[76],"also":[78],"show":[79],"how":[80,93],"this":[81],"SCC-based":[82],"approach":[83,112],"further":[86],"optimised":[87],"improve":[89],"speed":[91],"combined":[97],"with":[98],"symbolic":[99],"data":[100],"structures":[101],"offer":[103],"better":[104],"scalability.":[105],"illustrate":[107],"effectiveness":[109],"selection":[115],"large":[117],"case":[118],"studies.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-06T07:47:59.780226","created_date":"2025-10-10T00:00:00"}