{"id":"https://openalex.org/W2597548739","doi":"https://doi.org/10.2168/lmcs-4(4:6)2008","title":"Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations","display_name":"Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations","publication_year":2008,"publication_date":"2008-11-11","ids":{"openalex":"https://openalex.org/W2597548739","doi":"https://doi.org/10.2168/lmcs-4(4:6)2008","mag":"2597548739"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(4:6)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:6)2008","pdf_url":"https://lmcs.episciences.org/989/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/989/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lijun Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lijun Zhang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Holger Hermanns","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Hermanns","raw_affiliation_strings":["Department of Computer Science, Saarland University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Friedrich Eisenbrand","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Friedrich Eisenbrand","raw_affiliation_strings":["Department of Mathematics, EPFL, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"David N. Jansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David N. Jansen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1163,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.9401133,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 4, Issue 4","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.7365000247955322,"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.7365000247955322,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.04769999906420708,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.0340999998152256,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.8845999836921692},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.7537999749183655},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6873999834060669},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.6344000101089478},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.6085000038146973},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.555400013923645},{"id":"https://openalex.org/keywords/probabilistic-relevance-model","display_name":"Probabilistic relevance model","score":0.532800018787384},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4966000020503998},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.43630000948905945}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8845999836921692},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.7537999749183655},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6873999834060669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.651199996471405},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.6344000101089478},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.6085000038146973},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.555400013923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5526000261306763},{"id":"https://openalex.org/C143017306","wikidata":"https://www.wikidata.org/wiki/Q3318133","display_name":"Probabilistic relevance model","level":4,"score":0.532800018787384},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4966000020503998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47760000824928284},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4178999960422516},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C149189445","wikidata":"https://www.wikidata.org/wiki/Q5283894","display_name":"Divergence-from-randomness model","level":3,"score":0.38940000534057617},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3580000102519989},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.304500013589859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2922999858856201},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.2921999990940094},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.2856000065803528},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.25220000743865967}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-4(4:6)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:6)2008","pdf_url":"https://lmcs.episciences.org/989/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0808.3651","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0808.3651","pdf_url":"https://arxiv.org/pdf/0808.3651","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:9bc06ae2b7cc4802b730854c90bdcc0f","is_oa":true,"landing_page_url":"https://doaj.org/article/9bc06ae2b7cc4802b730854c90bdcc0f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(4:6)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:6)2008","pdf_url":"https://lmcs.episciences.org/989/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1230235592","display_name":null,"funder_award_id":"SFB/TR 14 AVACS","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3582310573","display_name":null,"funder_award_id":"AVACS","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4064624828","display_name":null,"funder_award_id":"SFB/TR","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5949215475","display_name":null,"funder_award_id":"SFB/TR 14","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6024419964","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2597548739.pdf","grobid_xml":"https://content.openalex.org/works/W2597548739.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W75740688","https://openalex.org/W138290785","https://openalex.org/W139143222","https://openalex.org/W259536784","https://openalex.org/W276224435","https://openalex.org/W1489359924","https://openalex.org/W1505443661","https://openalex.org/W1514324734","https://openalex.org/W1547562281","https://openalex.org/W1556729131","https://openalex.org/W1704074244","https://openalex.org/W1762983356","https://openalex.org/W1836142986","https://openalex.org/W1850900101","https://openalex.org/W1963619740","https://openalex.org/W2006889545","https://openalex.org/W2013469283","https://openalex.org/W2070403229","https://openalex.org/W2072651477","https://openalex.org/W2076680677","https://openalex.org/W2098817244","https://openalex.org/W2119065122","https://openalex.org/W2119567691","https://openalex.org/W2125500714","https://openalex.org/W2141881497","https://openalex.org/W2152342144","https://openalex.org/W2162844904","https://openalex.org/W2171849316","https://openalex.org/W6608100910","https://openalex.org/W6646781758","https://openalex.org/W6648470232","https://openalex.org/W6661554064","https://openalex.org/W6664753575","https://openalex.org/W6670812614","https://openalex.org/W6680618409","https://openalex.org/W6683577229","https://openalex.org/W6992951189"],"related_works":[],"abstract_inverted_index":{"Strong":[0],"and":[1,14,30,36,150],"weak":[2,31],"simulation":[3,13,17,32,39,115],"relations":[4,18],"have":[5,19],"been":[6,20],"proposed":[7,21],"for":[8,22,28,37,111,135,147],"Markov":[9,34,76],"chains,":[10,35],"while":[11],"strong":[12,15,29,38,113,149,151],"probabilistic":[16,23,41,86,114,118,136,152],"automata.":[24],"However,":[25],"decision":[26],"algorithms":[27,68,134],"over":[33,40],"automata":[42,137],"are":[43],"not":[44],"efficient,":[45],"which":[46,120],"makes":[47],"it":[48],"as":[49,57,59],"yet":[50],"unclear":[51],"whether":[52,71,84],"they":[53],"can":[54],"be":[55],"used":[56],"effectively":[58],"their":[60,139],"non-probabilistic":[61],"counterparts.":[62],"This":[63],"paper":[64],"presents":[65],"drastically":[66],"improved":[67],"to":[69,102,127,138],"decide":[70],"some":[72],"(discrete-":[73],"or":[74,79,83],"continuous-time)":[75],"chain":[77],"strongly":[78,88],"weakly":[80],"simulates":[81,89],"another,":[82],"a":[85,108,125],"automaton":[87],"another.":[90],"The":[91],"key":[92],"innovation":[93],"is":[94],"the":[95,133,144],"use":[96],"of":[97],"parametric":[98],"maximum":[99],"flow":[100],"techniques":[101],"amortize":[103],"computations.":[104],"We":[105],"also":[106],"present":[107],"novel":[109],"algorithm":[110],"deciding":[112],"preorders":[116],"on":[117],"automata,":[119],"has":[121],"polynomial":[122],"complexity":[123,146],"via":[124],"reduction":[126],"an":[128],"LP":[129],"problem.":[130],"When":[131],"extending":[132],"continuous-time":[140],"counterpart,":[141],"we":[142],"retain":[143],"same":[145],"both":[148],"simulations.":[153]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2017-04-07T00:00:00"}