{"id":"https://openalex.org/W2965562740","doi":"https://doi.org/10.1109/lics.2019.8785672","title":"Long-run Satisfaction of Path Properties","display_name":"Long-run Satisfaction of Path Properties","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2965562740","doi":"https://doi.org/10.1109/lics.2019.8785672","mag":"2965562740"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785672","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","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/A5091344667","display_name":"Christel Baier","orcid":"https://orcid.org/0000-0002-5321-9343"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christel Baier","raw_affiliation_strings":["Technische Universit\u00e4t, Dresden, Germany","TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Allemagne)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Allemagne)","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019307337","display_name":"Nathalie Bertrand","orcid":"https://orcid.org/0000-0002-9957-5394"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathalie Bertrand","raw_affiliation_strings":["Inria, Univ Rennes, France","SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Univ Rennes, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I56067802"]},{"raw_affiliation_string":"SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035546736","display_name":"Jakob Piribauer","orcid":"https://orcid.org/0000-0003-4829-0476"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jakob Piribauer","raw_affiliation_strings":["Technische Universit\u00e4t, Dresden, Germany","TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Allemagne)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"TU Dresden - Technische Universit\u00e4t Dresden = Dresden University of Technology (TU Dresden 01062 Dresden - Allemagne)","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059019724","display_name":"Ocan Sankur","orcid":"https://orcid.org/0000-0001-8146-4429"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ocan Sankur","raw_affiliation_strings":["Inria, Univ Rennes, France","SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, Univ Rennes, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I56067802"]},{"raw_affiliation_string":"SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3853,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6377644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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.9997000098228455,"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.9997000098228455,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9993000030517578,"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/reachability","display_name":"Reachability","score":0.8275853395462036},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6241123080253601},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5380911231040955},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5239719748497009},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4999363422393799},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4913271963596344},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.47412753105163574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4574429988861084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43548229336738586},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.411310613155365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3813316226005554},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.33722251653671265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27240148186683655},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.22759488224983215}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8275853395462036},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6241123080253601},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5380911231040955},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5239719748497009},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4999363422393799},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4913271963596344},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.47412753105163574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4574429988861084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43548229336738586},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.411310613155365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3813316226005554},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.33722251653671265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27240148186683655},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.22759488224983215},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2019.8785672","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02349456v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02349456","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-31, ⟨10.1109/LICS.2019.8785672⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W29365316","https://openalex.org/W43626140","https://openalex.org/W1498432697","https://openalex.org/W1621538476","https://openalex.org/W1815912087","https://openalex.org/W1957911494","https://openalex.org/W1968159080","https://openalex.org/W1972203711","https://openalex.org/W2009831508","https://openalex.org/W2019851160","https://openalex.org/W2019873882","https://openalex.org/W2020293036","https://openalex.org/W2025063471","https://openalex.org/W2032189196","https://openalex.org/W2036772106","https://openalex.org/W2039529128","https://openalex.org/W2047485015","https://openalex.org/W2077520193","https://openalex.org/W2081287319","https://openalex.org/W2106305745","https://openalex.org/W2119567691","https://openalex.org/W2120702165","https://openalex.org/W2121431238","https://openalex.org/W2122393219","https://openalex.org/W2177646325","https://openalex.org/W2185277641","https://openalex.org/W2278842702","https://openalex.org/W2296659684","https://openalex.org/W2399995641","https://openalex.org/W2762030425","https://openalex.org/W2912423395","https://openalex.org/W2913545290","https://openalex.org/W2962984263","https://openalex.org/W2965562740","https://openalex.org/W3104158310","https://openalex.org/W3145235675","https://openalex.org/W4239243912","https://openalex.org/W4250417675","https://openalex.org/W4298023569","https://openalex.org/W6638296870","https://openalex.org/W6641298166","https://openalex.org/W6766223955","https://openalex.org/W7029993674"],"related_works":["https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W1970063378","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W1968954131","https://openalex.org/W2082636129","https://openalex.org/W2982557863","https://openalex.org/W2925112333"],"abstract_inverted_index":{"The":[0,60],"paper":[1],"introduces":[2],"the":[3,31,37,52,101,117,141,147,150],"concepts":[4],"of":[5,8,35,40,149],"long-run":[6,20,74,106,143],"frequency":[7],"path":[9],"properties":[10,130],"for":[11,22,108,124,128],"paths":[12,47],"in":[13,24,83,100,113,116,121],"Kripke":[14,125],"structures,":[15],"and":[16,51,69,76,120,145],"their":[17],"generalization":[18],"to":[19,89,139],"probabilities":[21,75,107],"schedulers":[23,80,94],"Markov":[25],"decision":[26,54],"processes.":[27],"We":[28],"then":[29],"study":[30],"natural":[32],"optimization":[33],"problem":[34,55],"computing":[36],"optimal":[38,73,78,105,142],"values":[39],"these":[41],"measures,":[42],"when":[43,56],"ranging":[44],"over":[45],"all":[46,49],"or":[48],"schedulers,":[50],"corresponding":[53,77],"given":[57],"a":[58],"threshold.":[59],"main":[61],"results":[62],"are":[63,81,95,111],"as":[64],"follows.":[65],"For":[66],"(repeated)":[67],"reachability":[68,91,110],"other":[70],"simple":[71],"properties,":[72,92],"memoryless":[79,93],"computable":[82,112],"polynomial":[84,122],"time.":[85],"When":[86],"it":[87],"comes":[88],"constrained":[90,109],"no":[96],"longer":[97],"sufficient,":[98],"even":[99],"non-probabilistic":[102],"setting.":[103],"Nevertheless,":[104],"pseudo-polynomial":[114],"time":[115,123],"probabilistic":[118],"setting":[119],"structures.":[126],"Finally":[127],"co-safety":[129],"expressed":[131],"by":[132],"NFA,":[133],"we":[134],"give":[135],"an":[136],"exponential-time":[137],"algorithm":[138],"compute":[140],"frequency,":[144],"prove":[146],"PSPACE-completeness":[148],"threshold":[151],"problem.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}