{"id":"https://openalex.org/W4289443290","doi":"https://doi.org/10.1145/3531130.3533343","title":"Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods","display_name":"Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods","publication_year":2022,"publication_date":"2022-08-02","ids":{"openalex":"https://openalex.org/W4289443290","doi":"https://doi.org/10.1145/3531130.3533343"},"language":"en","primary_location":{"id":"doi:10.1145/3531130.3533343","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3533343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03644039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103030366","display_name":"R. Govind","orcid":"https://orcid.org/0000-0002-1634-5893"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R. Govind","raw_affiliation_strings":["Dept. of Computer Science and Engineering, IIT Bombay, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011012804","display_name":"Fr\u00e9d\u00e9ric Herbreteau","orcid":"https://orcid.org/0000-0002-1029-2356"},"institutions":[{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Herbreteau","raw_affiliation_strings":["Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France"],"affiliations":[{"raw_affiliation_string":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France","institution_ids":["https://openalex.org/I4210160189","https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107375011","display_name":"Srivathsan","orcid":null},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Srivathsan","raw_affiliation_strings":["Chennai Mathematical Institute, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France"],"affiliations":[{"raw_affiliation_string":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR5800, F-33400 Talence, France, France","institution_ids":["https://openalex.org/I4210160189","https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103030366"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":2.1122,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88779406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"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.9991000294685364,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/computer-science","display_name":"Computer science","score":0.7816039323806763},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7293394804000854},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.6950856447219849},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6912374496459961},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6545972228050232},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6391412615776062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5780506730079651},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5221017599105835},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5179747343063354},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.47406238317489624},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4639444351196289},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4403538703918457},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.43108803033828735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29750820994377136},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22822168469429016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1467132866382599}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7816039323806763},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7293394804000854},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.6950856447219849},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6912374496459961},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6545972228050232},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6391412615776062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5780506730079651},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5221017599105835},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5179747343063354},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.47406238317489624},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4639444351196289},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4403538703918457},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.43108803033828735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29750820994377136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22822168469429016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1467132866382599},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3531130.3533343","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3533343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03644039v2","is_oa":true,"landing_page_url":"https://hal.science/hal-03644039","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, Aug 2022, Haifa, Israel","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03644039v2","is_oa":true,"landing_page_url":"https://hal.science/hal-03644039","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, Aug 2022, Haifa, Israel","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7246439838","display_name":null,"funder_award_id":"ANR-18-CE40-0015","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W107799027","https://openalex.org/W1495026145","https://openalex.org/W1506579115","https://openalex.org/W1528441743","https://openalex.org/W1560730347","https://openalex.org/W1569674057","https://openalex.org/W1571054242","https://openalex.org/W1874996599","https://openalex.org/W1934074768","https://openalex.org/W1990161286","https://openalex.org/W1999288406","https://openalex.org/W2008078972","https://openalex.org/W2016300863","https://openalex.org/W2024875714","https://openalex.org/W2036670017","https://openalex.org/W2062787735","https://openalex.org/W2065675749","https://openalex.org/W2093681800","https://openalex.org/W2093709900","https://openalex.org/W2101508170","https://openalex.org/W2118938189","https://openalex.org/W2129335898","https://openalex.org/W2147297760","https://openalex.org/W2167722250","https://openalex.org/W2169870841","https://openalex.org/W2747419197","https://openalex.org/W2884909450","https://openalex.org/W2962719417","https://openalex.org/W3092162653","https://openalex.org/W3195050943","https://openalex.org/W4205148915","https://openalex.org/W4243889443"],"related_works":["https://openalex.org/W3049732643","https://openalex.org/W4290017224","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736"],"abstract_inverted_index":{"A":[0,45],"timed":[1,8,30,103],"network":[2,121],"is":[3,33,53,59,77,92,122,145],"a":[4,16,36,111,114,120,123],"parallel":[5],"composition":[6],"of":[7,50,113,119,132],"automata":[9],"synchronizing":[10],"on":[11,35],"common":[12],"actions.":[13],"We":[14],"develop":[15],"methodology":[17],"that":[18,99,125,143],"allows":[19],"to":[20,71,136,147],"use":[21,148],"partial-order":[22,151],"methods":[23,152],"when":[24],"solving":[25],"the":[26,129,154],"reachability":[27],"problem":[28],"for":[29,63,80,96,101],"networks.":[31,82,104],"It":[32,83],"based":[34,48],"local-time":[37,51,67,97],"semantics":[38],"proposed":[39],"by":[40],"[Bengtsson":[41],"et":[42],"al.":[43],"1998].":[44],"new":[46],"simulation":[47],"abstraction":[49,73,76,95],"zones":[52,68,98],"proposed.":[54],"The":[55,75,117],"main":[56],"technical":[57],"contribution":[58],"an":[60],"efficient":[61],"algorithm":[62],"testing":[64],"subsumption":[65,149],"between":[66],"with":[69],"respect":[70],"this":[72,107],"operator.":[74],"not":[78],"finite":[79,94],"all":[81],"turns":[84],"out":[85],"that,":[86],"under":[87],"relatively":[88],"mild":[89],"conditions,":[90],"there":[91],"no":[93],"works":[100],"arbitrary":[102],"To":[105],"circumvent":[106],"problem,":[108],"we":[109,141],"introduce":[110],"notion":[112],"bounded-spread":[115,139],"network.":[116],"spread":[118],"parameter":[124],"says":[126],"how":[127],"far":[128],"local":[130],"times":[131],"individual":[133],"processes":[134],"need":[135],"diverge.":[137],"For":[138],"networks,":[140],"show":[142],"it":[144],"possible":[146],"and":[150],"at":[153],"same":[155],"time.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}