Bounded Reachability Problems Are Decidable in FIFO Machines

Benedikt Bollig, Alain Finkel, Amrita Suresh. Bounded Reachability Problems Are Decidable in FIFO Machines. In Igor Konnov 0001, Laura Kovács, editors, 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference). Volume 171 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.