Effective Recognizability and Model Checking of Reactive Fiffo Automata

@inproceedings{Sutre1998EffectiveRA,
  title={Effective Recognizability and Model Checking of Reactive Fiffo Automata},
  author={Gr{\'e}goire Sutre and Alain Finkel and Olivier F. Roux and Franck Cassez},
  booktitle={AMAST},
  year={1998}
}
Our work intends to verify reactive systems with event memorization speciied with the reactive language Electre. For this, we deene a particular behavioral model for Electre programs , Reactive Fiio Automata (RFAs), which is close to Fifo Automata. Intuitively, a RFA is the model of a reactive system which may store event occurrences that must not be immediately taken into account. We show that, contrarily to lossy systems where the reachability set is recognizable but not eeectively computable… CONTINUE READING