@inproceedings{bollig_et_al:LIPIcs:2020:12861,
Address = {Dagstuhl, Germany},
Annote = {Keywords: FIFO machines, reachability, underapproximation, counter machines},
Author = {Bollig, Benedikt and Finkel, Alain and Suresh, Amrita},
BookTitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
Editor = {Konnov, Igor and Kov{\'a}cs, Laura},
File = {Bounded Reachability Problems Are Decidable in FIFO Machines - LIPIcs-CONCUR-2020-49 - a - c.pdf},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
Pages = {49:1--49:17},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Bounded Reachability Problems Are Decidable in FIFO Machines}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12861},
Volume = {171},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12861},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.49},
date-added = {2020-09-04 15:23:23 +0200},
date-modified = {2020-09-04 15:23:23 +0200},
urn = {urn:nbn:de:0030-drops-128615},
doi = {10.4230/LIPIcs.CONCUR.2020.49}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A