On flat lossy channel machines

07/10/2020
by   Philippe Schnoebelen, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset