Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.49
URN: urn:nbn:de:0030-drops-128615
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12861/
Bollig, Benedikt ; Finkel, Alain ; Suresh, Amrita
Bounded Reachability Problems Are Decidable in FIFO Machines
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{bollig_et_al:LIPIcs:2020:12861,
author = {Benedikt Bollig and Alain Finkel and Amrita Suresh},
title = {{Bounded Reachability Problems Are Decidable in FIFO Machines}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {49:1--49:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Igor Konnov and Laura Kov{\'a}cs},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12861},
URN = {urn:nbn:de:0030-drops-128615},
doi = {10.4230/LIPIcs.CONCUR.2020.49},
annote = {Keywords: FIFO machines, reachability, underapproximation, counter machines}
}
| Keywords: | FIFO machines, reachability, underapproximation, counter machines | |
| Seminar: | 31st International Conference on Concurrency Theory (CONCUR 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 26.08.2020 |
