Bounded Reachability Problems are Decidable in FIFO Machines

Benedikt Bollig, Alain Finkel, Amrita Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. Logical Methods in Computer Science, 18(1), 2022. [doi]

@article{BolligFS22,
  title = {Bounded Reachability Problems are Decidable in FIFO Machines},
  author = {Benedikt Bollig and Alain Finkel and Amrita Suresh},
  year = {2022},
  doi = {10.46298/lmcs-18(1:19)2022},
  url = {https://doi.org/10.46298/lmcs-18(1:19)2022},
  researchr = {https://researchr.org/publication/BolligFS22},
  cites = {0},
  citedby = {0},
  journal = {Logical Methods in Computer Science},
  volume = {18},
  number = {1},
}