{"id":"https://openalex.org/W2584868546","doi":null,"title":"Computing Minimum and Maximum Reachability Times in Probabilistic Systems","display_name":"Computing Minimum and Maximum Reachability Times in Probabilistic Systems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2584868546","mag":"2584868546"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.8697","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cad.eecs.berkeley.edu/~dealfaro/papers/99/concur_ssp_99.ps","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5050777140","display_name":"Luca de Alfaro","orcid":"https://orcid.org/0000-0003-3856-4576","observed_orcids":["https://orcid.org/0000-0003-3856-4576"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"de Alfaro, Luca","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5050777140"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34182293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9897000193595886,"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.9897000193595886,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.003800000064074993,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/markov-decision-process","display_name":"Markov decision process","score":0.9399999976158142},{"id":"https://openalex.org/keywords/stochastic-shortest-path-problem","display_name":"stochastic shortest path problem","score":0.8949999809265137},{"id":"https://openalex.org/keywords/nondeterministic-choice","display_name":"nondeterministic choice","score":0.734000027179718},{"id":"https://openalex.org/keywords/reliability-analysis","display_name":"reliability analysis","score":0.8450000286102295},{"id":"https://openalex.org/keywords/performance-evaluation","display_name":"performance evaluation","score":0.9520000219345093}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7553691864013672},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7087745070457458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.699652373790741},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6536577939987183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6390088796615601},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5625417232513428},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5324987173080444},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4633169174194336},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.42504578828811646},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41333770751953125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3250751495361328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2579925060272217},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10381117463111877},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.8697","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cad.eecs.berkeley.edu/~dealfaro/papers/99/concur_ssp_99.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.77.7586","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.7586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.soe.ucsc.edu/~luca/papers/99/concur_ssp_99.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.4334","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.4334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.soe.ucsc.edu/~luca/papers/99/concur_ssp_99.pdf","raw_type":"text"},{"id":"pmh:ADA461508","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA461508","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2081287319","https://openalex.org/W7017959136","https://openalex.org/W7058351480","https://openalex.org/W2013011361","https://openalex.org/W7097753767","https://openalex.org/W1796714106","https://openalex.org/W3201183876","https://openalex.org/W2798650598","https://openalex.org/W2321212028","https://openalex.org/W1990453721"],"abstract_inverted_index":{"A":[0],"Markov":[1,9,21,118],"decision":[2,22,119],"process":[3,23],"is":[4],"a":[5,8,20,31,49,195],"generalization":[6],"of":[7,33,48,65,84,138,170,177,182,187,193,201],"chain":[10],"in":[11,42,70,174],"which":[12,71],"both":[13],"probabilistic":[14,127],"and":[15,30,180,198],"nondeterministic":[16],"choice":[17],"coexist.":[18],"Given":[19],"with":[24,27,108],"costs":[25,73],"associated":[26],"the":[28,36,44,56,63,72,91,94,100,106,153,160,167,175,178,185,188,199,202,210],"transitions":[29],"set":[32],"target":[34,107,196],"states,":[35],"stochastic":[37,66],"shortest":[38,67],"path":[39,68],"problem":[40],"consists":[41],"computing":[43],"minimum":[45,189,203],"expected":[46,101,206],"cost":[47,102],"control":[50],"strategy":[51],"that":[52,93,96,121,158],"guarantees":[53],"to":[54,105,151,166,208],"reach":[55,209],"target.":[57],"In":[58],"this":[59],"paper,":[60],"we":[61],"consider":[62],"classes":[64,83,137],"problems":[69,85,139,155,157,173],"are":[74,147],"all":[75,78],"non-negative,":[76],"or":[77,98],"non-positive.":[79],"Previously,":[80],"these":[81,135],"two":[82,136,171],"could":[86],"be":[87],"solved":[88],"only":[89],"under":[90],"assumption":[92,112],"policies":[95],"minimize":[97],"maximize":[99],"also":[103],"lead":[104,165],"probability":[109,192],"1.":[110],"This":[111],"does":[113],"not":[114],"necessarily":[115],"hold":[116],"for":[117,125,133],"processes":[120],"arise":[122],"as":[123],"model":[124],"distributed":[126],"systems.":[128],"We":[129],"present":[130],"efficient":[131,168],"methods":[132,146,164],"solving":[134],"without":[140],"relying":[141],"on":[142,149],"additional":[143],"assumptions.":[144,162],"The":[145,163],"based":[148],"algorithms":[150],"transform":[152],"original":[154],"into":[156],"satisfy":[159],"required":[161],"solution":[169],"basic":[172],"analysis":[176],"reliability":[179],"performance":[181],"partially-specified":[183],"systems:":[184],"computation":[186,200],"(or":[190,204],"maximum)":[191,205],"reaching":[194],"set,":[197],"time":[207],"set.":[211],"1":[212]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}