Bounded Reachability Problems are Decidable in FIFO Machines - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Bounded Reachability Problems are Decidable in FIFO Machines


The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are input-bounded (i.e. the sequence of messages sent through a particular channel belongs to a given bounded language). We prove, by reducing this model to a counter machine with restricted zero tests, that the rational-reachability problem (and by extension, control-state reachability, unboundedness, deadlock, etc.) is decidable. This class of machines subsumes input-letter-bounded machines, flat machines, linear FIFO nets, and monogeneous machines, for which some of these problems were already shown to be decidable. These theoretical results can form the foundations to build a tool to verify general FIFO machines based on the analysis of input-bounded machines.
Fichier principal
Vignette du fichier
concur-long-version.pdf (656.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02900813 , version 1 (16-08-2020)


  • HAL Id : hal-02900813 , version 1


Benedikt Bollig, Alain Finkel, Amrita Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. 31st International Conference on Concurrency Theory (CONCUR 2020), Sep 2020, Vienna, Austria. ⟨hal-02900813⟩
117 View
85 Download


Gmail Facebook X LinkedIn More