License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2021.37
URN: urn:nbn:de:0030-drops-134712
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13471/
Go to the corresponding LIPIcs Volume Portal

Schnoebelen, Philippe

On Flat Lossy Channel Machines

pdf-format:
LIPIcs-CSL-2021-37.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{schnoebelen:LIPIcs:2021:13471,
  author =	{Philippe Schnoebelen},
  title =	{{On Flat Lossy Channel Machines}},
  booktitle =	{29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
  pages =	{37:1--37:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-175-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{183},
  editor =	{Christel Baier and Jean Goubault-Larrecq},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/13471},
  URN =		{urn:nbn:de:0030-drops-134712},
  doi =		{10.4230/LIPIcs.CSL.2021.37},
  annote =	{Keywords: Infinite state systems, Automated verification, Flat systems, Lossy channels}
}

Keywords: Infinite state systems, Automated verification, Flat systems, Lossy channels
Collection: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Issue Date: 2021
Date of publication: 13.01.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI