{"id":"https://openalex.org/W7155038826","doi":"https://doi.org/10.1109/synasc69064.2025.00011","title":"Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks","display_name":"Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks","publication_year":2025,"publication_date":"2025-09-22","ids":{"openalex":"https://openalex.org/W7155038826","doi":"https://doi.org/10.1109/synasc69064.2025.00011"},"language":null,"primary_location":{"id":"doi:10.1109/synasc69064.2025.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc69064.2025.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5134167823","display_name":"Jonas St\u00fcbbe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonas St\u00fcbbe","raw_affiliation_strings":["University of Münster,Münster,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Münster,Münster,Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040482467","display_name":"Anne Remke","orcid":"https://orcid.org/0000-0002-5912-4767"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anne Remke","raw_affiliation_strings":["University of Münster,Münster,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Münster,Münster,Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112172413","display_name":"E Abrah\u00e1m","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Erika \u00c1brah\u00e1m","raw_affiliation_strings":["RWTH Aachen University,Aachen,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University,Aachen,Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.77351738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8346999883651733,"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.8346999883651733,"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/T11567","display_name":"semigroups and automata theory","score":0.021400000900030136,"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/T12029","display_name":"DNA and Biological Computing","score":0.020500000566244125,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6811000108718872},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5432999730110168},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4316999912261963},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.313400000333786}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6811000108718872},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5432999730110168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48980000615119934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47909998893737793},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4171000123023987},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3357999920845032},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.313400000333786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30570000410079956},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29319998621940613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/synasc69064.2025.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc69064.2025.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.5915839076042175,"id":"https://metadata.un.org/sdg/13"}],"awards":[{"id":"https://openalex.org/G1886044275","display_name":"Erreichbarkeitsanalyse f\u00fcr stochastische hybride Systeme","funder_award_id":"471367371","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W143370938","https://openalex.org/W1508592466","https://openalex.org/W1516852392","https://openalex.org/W1522694098","https://openalex.org/W1980648830","https://openalex.org/W2004463571","https://openalex.org/W2046386580","https://openalex.org/W2074603479","https://openalex.org/W2077287580","https://openalex.org/W2080813827","https://openalex.org/W2087486424","https://openalex.org/W2123640521","https://openalex.org/W2141803002","https://openalex.org/W2153504150","https://openalex.org/W2195144676","https://openalex.org/W2528714477","https://openalex.org/W2604773389","https://openalex.org/W2900091779","https://openalex.org/W4382045631","https://openalex.org/W4383982168","https://openalex.org/W4386746408","https://openalex.org/W4390501107","https://openalex.org/W4402829059"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"optimizations":[3,21],"to":[4],"improve":[5],"the":[6,26,41,47,58],"scalability":[7],"of":[8,14,25,60],"reachability":[9,62,68],"analysis":[10],"on":[11],"a":[12],"subclass":[13],"hybrid":[15],"automata":[16],"extended":[17],"with":[18],"stochasticity.":[19],"The":[20],"target":[22],"different":[23],"components":[24],"analysis,":[27],"such":[28],"as":[29],"quantifier":[30],"elimination":[31],"for":[32,65],"state":[33],"set":[34],"projection,":[35],"and":[36,52],"automated":[37],"parameter":[38],"selection":[39],"during":[40],"numerical":[42],"integration.":[43],"Most":[44],"importantly,":[45],"whereas":[46],"original":[48],"method":[49],"combines":[50],"forward":[51],"backward":[53,61],"reachability,":[54],"we":[55],"show":[56],"that":[57],"usage":[59],"is":[63],"optional":[64],"computing":[66],"maximal":[67],"probabilities.":[69]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-04-22T00:00:00"}