On flat lossy channel machines
Logic in Computer Science
2020-07-13 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.2007.05269,
title = {On flat lossy channel machines},
author = {Philippe Schnoebelen},
journal= {arXiv preprint arXiv:2007.05269},
year = {2020}
}
Comments
Submitted for publication