We call this class of FIFO machines input-bounded. the reachability problem, the deadlock problem, is shown decidable for input-letter-bounded FIFO systems in [23] by reducing to reachability for VASS, but the extension to general input-bounded machines was left open.
May 14, 2021 · Abstract:The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
Jan 20, 2022 · The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
Jan 20, 2022 · Abstract. The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
Aug 16, 2020 · Abstract. The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
Aug 26, 2020 · The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
Bounded Reachability Problems are Decidable in FIFO Machines · B. Bollig, A. Finkel, Amrita Suresh · Published in Log. Methods Comput. Sci. 14 May 2021 · Computer ...
Aug 16, 2020 · The Input-Bounded Rational Reachability Problem is decidable. Amrita Suresh. Bounded Reachability Problems in FIFO Machines. 8 / 18. Page 42 ...
Abstract. The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known.
BOUNDED REACHABILITY PROBLEMS ARE. DECIDABLE IN FIFO MACHINES. Benedikt Bollig, Alain Finkel, Amrita Suresh. Page 2. Testing the reachability of a configuration ...