{"id":"https://openalex.org/W3045484572","doi":"https://doi.org/10.46298/lmcs-18(1:19)2022","title":"Bounded Reachability Problems are Decidable in FIFO Machines","display_name":"Bounded Reachability Problems are Decidable in FIFO Machines","publication_year":2022,"publication_date":"2022-01-20","ids":{"openalex":"https://openalex.org/W3045484572","doi":"https://doi.org/10.46298/lmcs-18(1:19)2022","mag":"3045484572"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-18(1:19)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:19)2022","pdf_url":"https://lmcs.episciences.org/8992/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/8992/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082538918","display_name":"Benedikt Bollig","orcid":"https://orcid.org/0000-0003-0985-6115"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"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/I4387154672","display_name":"Laboratoire M\u00e9thodes Formelles","ror":"https://ror.org/00gdtta79","country_code":null,"type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387154672"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benedikt Bollig","raw_affiliation_strings":["Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)"],"affiliations":[{"raw_affiliation_string":"Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I4387154672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051788925","display_name":"Alain Finkel","orcid":"https://orcid.org/0000-0003-0702-3232"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"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/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]},{"id":"https://openalex.org/I4387154672","display_name":"Laboratoire M\u00e9thodes Formelles","ror":"https://ror.org/00gdtta79","country_code":null,"type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387154672"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alain Finkel","raw_affiliation_strings":["Institut Universitaire de France","Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)"],"affiliations":[{"raw_affiliation_string":"Institut Universitaire de France","institution_ids":["https://openalex.org/I185839726"]},{"raw_affiliation_string":"Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I4387154672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035382429","display_name":"Amrita Suresh","orcid":"https://orcid.org/0000-0001-6819-9093"},"institutions":[{"id":"https://openalex.org/I4387154672","display_name":"Laboratoire M\u00e9thodes Formelles","ror":"https://ror.org/00gdtta79","country_code":null,"type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387154672"]},{"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/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Amrita Suresh","raw_affiliation_strings":["Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)"],"affiliations":[{"raw_affiliation_string":"Universit Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I4387154672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082538918"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4387154672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.00844514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"Volume 18, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9979000091552734,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9979000091552734,"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/decidability","display_name":"Decidability","score":0.8963969349861145},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8312238454818726},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7724046111106873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7531524300575256},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6909610033035278},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.573066234588623},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5320953130722046},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44855791330337524},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4188283085823059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40453365445137024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3910563886165619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2979949712753296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2519928812980652},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1812783181667328}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8963969349861145},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8312238454818726},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7724046111106873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7531524300575256},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6909610033035278},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.573066234588623},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5320953130722046},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44855791330337524},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4188283085823059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40453365445137024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3910563886165619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2979949712753296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2519928812980652},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1812783181667328},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/lmcs-18(1:19)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:19)2022","pdf_url":"https://lmcs.episciences.org/8992/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:2105.06723","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06723","pdf_url":"https://arxiv.org/pdf/2105.06723","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:HAL:hal-03875999v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03875999","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2022, Volume 18, Issue 1, ⟨10.46298/lmcs-18(1:19)2022⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:1bfc05fd87a94888b0c008e5ca7b3b44","is_oa":true,"landing_page_url":"https://doaj.org/article/1bfc05fd87a94888b0c008e5ca7b3b44","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-18(1:19)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:19)2022","pdf_url":"https://lmcs.episciences.org/8992/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":[{"display_name":"Peace, Justice and strong institutions","score":0.7900000214576721,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3045484572.pdf","grobid_xml":"https://content.openalex.org/works/W3045484572.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W131795912","https://openalex.org/W1481307904","https://openalex.org/W1505482284","https://openalex.org/W1547921645","https://openalex.org/W1592689879","https://openalex.org/W1823865466","https://openalex.org/W1842117537","https://openalex.org/W1967174286","https://openalex.org/W1980330971","https://openalex.org/W1990154918","https://openalex.org/W2001426769","https://openalex.org/W2006337571","https://openalex.org/W2011495892","https://openalex.org/W2025970201","https://openalex.org/W2031276295","https://openalex.org/W2040008220","https://openalex.org/W2053229198","https://openalex.org/W2067782667","https://openalex.org/W2071229757","https://openalex.org/W2073466252","https://openalex.org/W2089107726","https://openalex.org/W2118675136","https://openalex.org/W2142270469","https://openalex.org/W2164003033","https://openalex.org/W2165546792","https://openalex.org/W2400063359","https://openalex.org/W2491070407","https://openalex.org/W2503469005","https://openalex.org/W2788350744","https://openalex.org/W2797596189","https://openalex.org/W2900179285","https://openalex.org/W2970619640","https://openalex.org/W3001971291","https://openalex.org/W3034629057","https://openalex.org/W3104578959","https://openalex.org/W3110083871","https://openalex.org/W3118222663","https://openalex.org/W4255701988"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1999231617","https://openalex.org/W2529513861","https://openalex.org/W4361186044","https://openalex.org/W2388344305","https://openalex.org/W2099490078","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037","https://openalex.org/W1571571632"],"abstract_inverted_index":{"The":[0],"undecidability":[1],"of":[2,38,81,97,126],"basic":[3],"decision":[4],"problems":[5,99],"for":[6,24,94],"general":[7,26,119],"FIFO":[8,89,120],"machines":[9,82,121],"such":[10],"as":[11],"reachability":[12],"and":[13,91],"unboundedness":[14],"is":[15,77],"well-known.":[16],"In":[17],"this":[18,55],"paper,":[19],"we":[20],"provide":[21],"an":[22],"underapproximation":[23],"the":[25,36,66,111,124],"model":[27,56],"by":[28,53,70],"considering":[29],"only":[30],"runs":[31],"that":[32,65],"are":[33],"input-bounded":[34,127],"(i.e.":[35],"sequence":[37],"messages":[39],"sent":[40],"through":[41],"a":[42,47,58,115],"particular":[43],"channel":[44],"belongs":[45],"to":[46,57,103,113,117],"given":[48],"bounded":[49],"language).":[50],"We":[51],"prove,":[52],"reducing":[54],"counter":[59],"machine":[60],"with":[61],"restricted":[62],"zero":[63],"tests,":[64],"rational-reachability":[67],"problem":[68],"(and":[69],"extension,":[71],"control-state":[72],"reachability,":[73],"unboundedness,":[74],"deadlock,":[75],"etc.)":[76],"decidable.":[78,105],"This":[79],"class":[80],"subsumes":[83],"input-letter-bounded":[84],"machines,":[85,87,93],"flat":[86],"linear":[88],"nets,":[90],"monogeneous":[92],"which":[95],"some":[96],"these":[98],"were":[100],"already":[101],"shown":[102],"be":[104],"These":[106],"theoretical":[107],"results":[108],"can":[109],"form":[110],"foundations":[112],"build":[114],"tool":[116],"verify":[118],"based":[122],"on":[123],"analysis":[125],"machines.":[128]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}