_:n1e2ec0bebb3d498aaf870de757e836aaxb0
<http://schema.org/description>
"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."
<http://api.deepai.org/publication/bounded-reachability-problems-are-decidable-in-fifo-machines>