On Termination for Faulty Channel Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

On Termination for Faulty Channel Machines

Résumé

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.
Fichier principal
Vignette du fichier
Bouyer.pdf (241.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00220515 , version 1 (28-01-2008)

Identifiants

Citer

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell. On Termination for Faulty Channel Machines. STACS 2008, Feb 2008, Bordeaux, France. pp.121-132. ⟨hal-00220515⟩
159 Consultations
126 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More