{"id":"https://openalex.org/W2926242892","doi":"https://doi.org/10.1007/978-3-030-17465-1_11","title":"Optimal Time-Bounded Reachability Analysis for Concurrent Systems","display_name":"Optimal Time-Bounded Reachability Analysis for Concurrent Systems","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2926242892","doi":"https://doi.org/10.1007/978-3-030-17465-1_11","mag":"2926242892"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-17465-1_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17465-1_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/978-3-030-17465-1_11","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005462869","display_name":"Yuliya Butkova","orcid":"https://orcid.org/0000-0002-9678-1467"},"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":true,"raw_author_name":"Yuliya Butkova","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024171906","display_name":"Gereon Fox","orcid":"https://orcid.org/0009-0002-3471-7715"},"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":"Gereon Fox","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005462869"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.8779,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84217104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"191","last_page":"208"},"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/T11125","display_name":"Petri Nets in System Modeling","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.9991000294685364,"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.8455803990364075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7275996208190918},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6572881937026978},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6524602770805359},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6193170547485352},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5591120719909668},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.5160917639732361},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5149300694465637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4746808707714081},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46570688486099243},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3550744354724884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2851133346557617},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.2666296362876892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23921796679496765}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8455803990364075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7275996208190918},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6572881937026978},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6524602770805359},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6193170547485352},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5591120719909668},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5160917639732361},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5149300694465637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4746808707714081},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46570688486099243},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3550744354724884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2851133346557617},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2666296362876892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23921796679496765},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":2,"locations":[{"id":"doi:10.1007/978-3-030-17465-1_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17465-1_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:zenodo.org:5758787","is_oa":true,"landing_page_url":"https://zenodo.org/record/5758787","pdf_url":"https://zenodo.org/record/5758787","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-17465-1_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17465-1_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W78405526","https://openalex.org/W275084143","https://openalex.org/W1504080271","https://openalex.org/W1548777301","https://openalex.org/W1581031502","https://openalex.org/W1597655219","https://openalex.org/W1613270429","https://openalex.org/W1626822335","https://openalex.org/W1862398452","https://openalex.org/W1986755980","https://openalex.org/W1988500253","https://openalex.org/W1991629437","https://openalex.org/W2049229863","https://openalex.org/W2079636926","https://openalex.org/W2088823298","https://openalex.org/W2093878537","https://openalex.org/W2098432798","https://openalex.org/W2110411539","https://openalex.org/W2119567691","https://openalex.org/W2123610695","https://openalex.org/W2125739093","https://openalex.org/W2148167082","https://openalex.org/W2172279531","https://openalex.org/W2262106677","https://openalex.org/W2278165153","https://openalex.org/W2294647483","https://openalex.org/W2334782222","https://openalex.org/W2584921486","https://openalex.org/W2593267253","https://openalex.org/W2735021239","https://openalex.org/W2885972047","https://openalex.org/W2964256340","https://openalex.org/W3099417312"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W1554767603","https://openalex.org/W2130664212","https://openalex.org/W1565729639","https://openalex.org/W4382045631","https://openalex.org/W2032445854","https://openalex.org/W3087810330"],"abstract_inverted_index":{"Efficient":[0],"optimal":[1,52,105],"scheduling":[2],"for":[3,55,64,85],"concurrent":[4,66],"systems":[5],"on":[6,72,120],"a":[7,11,22,46],"finite":[8],"horizon":[9],"is":[10,70,91],"challenging":[12],"task":[13],"up":[14,123],"to":[15,34,48,81,96,124],"date:":[16],"Not":[17],"only":[18,98],"does":[19],"time":[20,39,77,101],"have":[21],"continuous":[23],"domain,":[24],"but":[25],"in":[26,99,107],"addition":[27],"there":[28],"are":[29],"exponentially":[30],"many":[31],"possible":[32],"decisions":[33],"choose":[35],"from":[36],"at":[37],"every":[38],"point.":[40],"In":[41,79],"this":[42],"paper":[43],"we":[44],"present":[45],"solution":[47],"the":[49,60,73,76,88,104,117],"problem":[50],"of":[51,59,75,127],"time-bounded":[53],"reachability":[54],"Markov":[56],"automata,":[57],"one":[58],"most":[61,82],"general":[62],"formalisms":[63],"modelling":[65],"systems.":[67],"Our":[68,112],"algorithm":[69,118],"based":[71],"discretisation":[74,89],"horizon.":[78],"contrast":[80],"existing":[83,121],"algorithms":[84],"similar":[86],"problems,":[87],"step":[90],"not":[92],"fixed.":[93],"We":[94],"attempt":[95],"discretise":[97],"those":[100],"points":[102],"when":[103],"scheduler":[106],"fact":[108],"changes":[109],"its":[110],"decision.":[111],"empirical":[113],"evaluation":[114],"demonstrates":[115],"that":[116],"improves":[119],"solutions":[122],"several":[125],"orders":[126],"magnitude.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}