Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Bouyer, Patricia; Markey, Nicolas; Ouaknine, JoŽl; Schnoebelen, Philippe; Worrell, James License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-13390

; ; ; ;

On Termination for Faulty Channel Machines



A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper, we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously appear. Such devices have been previously introduced in the study of Metric Temporal Logic. We consider the termination problem: are all the computations of a given insertion channel machine finite? We show that this problem has non-elementary, yet primitive recursive complexity.

BibTeX - Entry

  author =	{Patricia Bouyer and Nicolas Markey and Jo{\"e}l Ouaknine and Philippe Schnoebelen and James Worrell},
  title =	{{On Termination for Faulty Channel Machines}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{121--132},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Susanne Albers and Pascal Weil},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-13390},
  doi =		{},
  annote =	{Keywords: Automated Verification, Computational Complexity}

Keywords: Automated Verification, Computational Complexity
Seminar: 25th International Symposium on Theoretical Aspects of Computer Science
Related Scholarly Article:
Issue date: 2008
Date of publication: 2008

DROPS-Home | Fulltext Search | Imprint Published by LZI