Verification of Embedded Reactive Fiffo Systems

Frédéric Herbreteau (1) , Franck Cassez (2) , Alain Finkel (3) , Roux Olivier (2) , Grégoire Sutre (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
3 LSV - Laboratoire Spécification et Vérification [Cachan]

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.

Keywords: Reactive Fiffo Systems; Well-Structured Systems; Decidability

Domains: Formal Languages and Automata Theory [cs.FL]

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⟩