@InProceedings{finkel_et_al:LIPIcs.CONCUR.2019.12,
author = {Finkel, Alain and Praveen, M.},
title = {{Verification of Flat FIFO Systems}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.12},
URN = {urn:nbn:de:0030-drops-109147},
doi = {10.4230/LIPIcs.CONCUR.2019.12},
annote = {Keywords: Infinite state systems, FIFO, counters, flat systems, reachability, termination, complexity}
}