@inbook{5806ee975ad24740aa49eca637cf7511,
title = "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.",
keywords = "Decidability, Embedded systems, Infinite-state systems, Reactive fiffo systems, Real-time systems, Verification",
author = "Fr{\'e}d{\'e}ric Herbreteau and Franck Cassez and Alain Finkel and Olivier Roux and Gr{\'e}goire Sutre",
year = "2002",
language = "English",
volume = "2286",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "400--414",
editor = "Sergio Rajsbaum",
booktitle = "LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings",
address = "United States",
note = "5th Latin American Symposium on Theoretical Informatics, LATIN 2002 ; Conference date: 03-04-2002 Through 06-04-2002",
}