Verification of Embedded Reactive Fiffo Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Verification of Embedded Reactive Fiffo Systems

Résumé

Reactive Fiffo Systems (RFS) are used to model reactive systems which are able to memorize the events that cannot be processed when they occur. In this paper we investigate the decidability of verification problems for Embedded RFS which are RFS running under some environmental constraints. We show that almost all the usual verification problems are undecidable for the class of Periodically Embedded RFS with two memorizing events, whereas they become decidable for Regularly Embedded RFS with a single memorizing event. We then focus on Embedded Lossy RFS and we show in particular that for Regularly Embedded Lossy RFS the set of predecessors Pred* is upward closed and effectively computable.
Fichier principal
Vignette du fichier
HCFRS-LATIN2002.pdf (266.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00477233 , version 1 (28-04-2010)

Identifiants

  • HAL Id : hal-00477233 , version 1

Citer

Frédéric Herbreteau, Franck Cassez, Alain Finkel, Roux Olivier, Grégoire Sutre. Verification of Embedded Reactive Fiffo Systems. LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. pp.400-414. ⟨hal-00477233⟩
268 Consultations
125 Téléchargements

Partager

Gmail Facebook X LinkedIn More