TL;DR
This paper proves that key decision problems for flat lossy channel machines are NP-complete, using advanced analysis and compressed word techniques to handle exponential path lengths.
Contribution
It establishes NP-completeness for reachability, repeated reachability, nontermination, and unboundedness in flat lossy channel machines, with tight bounds and novel analysis methods.
Findings
NP-completeness of key problems for flat lossy channel machines
Efficient reasoning with exponential-length paths using compressed words
Lower bounds apply even to acyclic or single-path machines
Abstract
We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine analysis of iterations of lossy channel actions and uses compressed word techniques for efficiently reasoning with paths of exponential lengths. The lower bounds already apply to acyclic or single-path machines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.