Verification of Embedded Reactive Fiffo Systems

Abstract : 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.
Document type :
Conference papers
Sergio Rajsbaum. LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. Springer, 2286, pp.400-414, 2002, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00477233
Contributor : Frédéric Herbreteau <>
Submitted on : Wednesday, April 28, 2010 - 3:13:16 PM
Last modification on : Thursday, February 9, 2017 - 3:33:41 PM
Document(s) archivé(s) le : Tuesday, September 28, 2010 - 1:21:33 PM

File

HCFRS-LATIN2002.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00477233, version 1

Citation

Frédéric Herbreteau, Franck Cassez, Alain Finkel, Roux Olivier, Grégoire Sutre. Verification of Embedded Reactive Fiffo Systems. Sergio Rajsbaum. LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. Springer, 2286, pp.400-414, 2002, Lecture Notes in Computer Science. <hal-00477233>

Share

Metrics

Record views

334

Document downloads

96