Reachability, non-termination, unboundedness and related verification problems are NP-complete for flat FIFO machines, and reachability is NP-complete for flat lossy and flat front-lossy FIFO machines.
On flat lossy channel machines
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Verification of Flat FIFO Systems
Reachability, non-termination, unboundedness and related verification problems are NP-complete for flat FIFO machines, and reachability is NP-complete for flat lossy and flat front-lossy FIFO machines.