107 citations · 401 across the 20 of their papers we have counts for
1 paper · 1 filter
Philippe Schnoebelen
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 cont…