{"id":"https://openalex.org/W1984799101","doi":"https://doi.org/10.1145/2528935","title":"Verification of linear duration properties over continuous-time markov chains","display_name":"Verification of linear duration properties over continuous-time markov chains","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1984799101","doi":"https://doi.org/10.1145/2528935","mag":"1984799101"},"language":"en","primary_location":{"id":"doi:10.1145/2528935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2528935","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030747944","display_name":"Taolue Chen","orcid":"https://orcid.org/0000-0002-5993-1665"},"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":"Taolue Chen","raw_affiliation_strings":["University of Oxford, UK","University of Oxford, UK,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK,","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048006521","display_name":"Marco Diciolla","orcid":null},"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":"Marco Diciolla","raw_affiliation_strings":["University of Oxford, UK","University of Oxford, UK,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK,","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","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":false,"raw_author_name":"Marta Kwiatkowska","raw_affiliation_strings":["University of Oxford, UK","University of Oxford, UK,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK,","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041563113","display_name":"Alexandru Mereacre","orcid":"https://orcid.org/0000-0002-5376-2194"},"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":"Alexandru Mereacre","raw_affiliation_strings":["University of Oxford, UK","University of Oxford, UK,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, UK,","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030747944"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.4896,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81912063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reachability","display_name":"Reachability","score":0.8175345063209534},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.5933761596679688},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5796859860420227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5278401374816895},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47798794507980347},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47378063201904297},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46996328234672546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44551989436149597},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4304087162017822},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4296553432941437},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.41617900133132935},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4156433343887329},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.39645785093307495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36173373460769653},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09453344345092773}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8175345063209534},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.5933761596679688},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5796859860420227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5278401374816895},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47798794507980347},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47378063201904297},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46996328234672546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44551989436149597},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4304087162017822},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4296553432941437},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.41617900133132935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4156433343887329},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39645785093307495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36173373460769653},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09453344345092773},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2528935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2528935","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.1090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.1090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tocl.acm.org/accepted/chen_verification.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.728.4119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.728.4119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eis.mdx.ac.uk/staffpages/taoluechen/pub-papers/tocl.pdf","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:2d13c187-b34a-4879-9580-de0be504b0e2","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:2d13c187-b34a-4879-9580-de0be504b0e2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Conference"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:7dcd9a3e-bd9f-4cab-bef1-c134ea60c6d9","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:7dcd9a3e-bd9f-4cab-bef1-c134ea60c6d9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320334902","display_name":"Oxford Martin School, University of Oxford","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W77257248","https://openalex.org/W112536719","https://openalex.org/W125598877","https://openalex.org/W267488415","https://openalex.org/W1493119321","https://openalex.org/W1498432697","https://openalex.org/W1499946514","https://openalex.org/W1510603033","https://openalex.org/W1516256348","https://openalex.org/W1542234847","https://openalex.org/W1569998753","https://openalex.org/W1592235141","https://openalex.org/W1596739056","https://openalex.org/W1600541802","https://openalex.org/W1785398866","https://openalex.org/W1862398452","https://openalex.org/W1972203711","https://openalex.org/W1979561589","https://openalex.org/W1981463037","https://openalex.org/W1995713768","https://openalex.org/W1999122486","https://openalex.org/W2006095419","https://openalex.org/W2033666012","https://openalex.org/W2041226400","https://openalex.org/W2043896870","https://openalex.org/W2049229863","https://openalex.org/W2058943977","https://openalex.org/W2071103858","https://openalex.org/W2103767382","https://openalex.org/W2103836778","https://openalex.org/W2106600417","https://openalex.org/W2116930279","https://openalex.org/W2120944178","https://openalex.org/W2122393219","https://openalex.org/W2129037613","https://openalex.org/W2141881497","https://openalex.org/W2143706916","https://openalex.org/W2149453229","https://openalex.org/W2153677792","https://openalex.org/W2154602821","https://openalex.org/W2157155770","https://openalex.org/W2158776910","https://openalex.org/W2160106881","https://openalex.org/W2163500089","https://openalex.org/W2167467151","https://openalex.org/W2168677536","https://openalex.org/W2561675875","https://openalex.org/W2610857016","https://openalex.org/W3022909171","https://openalex.org/W3101346374","https://openalex.org/W3103183526","https://openalex.org/W4255216160","https://openalex.org/W4285719527","https://openalex.org/W6655892977","https://openalex.org/W6662743244","https://openalex.org/W6814503024"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"Stochastic":[0],"modelling":[1],"and":[2,12,18,28,99,119,173,184],"algorithmic":[3],"verification":[4],"techniques":[5],"have":[6],"been":[7],"proved":[8],"useful":[9],"in":[10,16,45,81],"analysing":[11],"detecting":[13],"unusual":[14],"trends":[15],"performance":[17],"energy":[19],"usage":[20],"of":[21,54,71,78,92,109,112,123,143,146,150,182,187,189,194],"systems":[22,193],"such":[23],"as":[24,69],"power":[25],"management":[26],"controllers":[27],"wireless":[29],"sensor":[30],"devices.":[31],"Many":[32],"important":[33],"properties":[34,67],"are":[35],"dependent":[36],"on":[37],"the":[38,42,52,75,107,120,141,144,151,185,203],"cumulated":[39],"time":[40,79,117],"that":[41,65,83,134,153],"device":[43],"spends":[44],"certain":[46],"states,":[47,114],"possibly":[48],"intermittently.":[49],"We":[50,88,158],"study":[51],"problem":[53],"verifying":[55],"continuous-time":[56],"Markov":[57],"Chains":[58],"(CTMCs)":[59],"against":[60],"Linear":[61],"Duration":[62,96,101],"Properties":[63,97,102],"(LDP),":[64],"is,":[66],"stated":[68],"conjunctions":[70],"linear":[72,195],"constraints":[73],"over":[74,127],"total":[76],"duration":[77,125],"spent":[80],"states":[82],"satisfy":[84,154],"a":[85,110,116,124,155,167],"given":[86,156,168],"property.":[87],"identify":[89],"two":[90],"classes":[91],"LDP":[93],"properties,":[94],"Eventuality":[95],"(EDP)":[98],"Invariance":[100],"(IDP),":[103],"respectively":[104],"referring":[105],"to":[106,139,161,166,201],"reachability":[108],"set":[111,145],"goal":[113],"within":[115],"bound;":[118],"continuous":[121],"satisfaction":[122],"property":[126],"an":[128,180],"execution":[129],"path.":[130],"The":[131,176],"central":[132],"question":[133],"we":[135],"address":[136],"is":[137],"how":[138],"compute":[140],"probability":[142],"infinite":[147],"timed":[148],"paths":[149],"CTMC":[152],"LDP.":[157],"present":[159],"algorithms":[160,177],"approximate":[162],"these":[163],"probabilities":[164],"up":[165],"precision,":[169],"stating":[170],"their":[171],"complexity":[172],"error":[174],"bounds.":[175],"mainly":[178],"employ":[179],"adaptation":[181],"uniformisation":[183],"computation":[186],"volumes":[188],"multidimensional":[190],"integrals":[191],"under":[192],"constraints,":[196],"together":[197],"with":[198],"different":[199],"mechanisms":[200],"bound":[202],"errors.":[204]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}