{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:04Z","timestamp":1753894384368,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The undecidability of basic decision problems for general FIFO machines such\nas reachability and unboundedness is well-known. In this paper, we provide an\nunderapproximation for the general model by considering only runs that are\ninput-bounded (i.e. the sequence of messages sent through a particular channel\nbelongs to a given bounded language). We prove, by reducing this model to a\ncounter machine with restricted zero tests, that the rational-reachability\nproblem (and by extension, control-state reachability, unboundedness, deadlock,\netc.) is decidable. This class of machines subsumes input-letter-bounded\nmachines, flat machines, linear FIFO nets, and monogeneous machines, for which\nsome of these problems were already shown to be decidable. These theoretical\nresults can form the foundations to build a tool to verify general FIFO\nmachines based on the analysis of input-bounded machines.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:19)2022","type":"journal-article","created":{"date-parts":[[2022,1,23]],"date-time":"2022-01-23T22:46:48Z","timestamp":1642978008000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounded Reachability Problems are Decidable in FIFO Machines"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"given":"Amrita","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2022,1,20]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8992\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8992\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:01Z","timestamp":1687292401000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:19)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2105.06723v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2105.06723v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2105.06723","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2105.06723","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"article-number":"7485"}}