2 Hits in 2.3 sec

Effective Recognizability and Model Checking of Reactive Fiffo Automata [chapter]

Gregoire Sutre, Alain Finkel, Olivier Roux, Franck Cassez
1998 Lecture Notes in Computer Science  
For this, we de ne a particular behavioral model for Electre programs, Reactive Fi o Automata (RFAs), which is close to Fifo Automata.  ...  Moreover, we also study the relationships between RFAs and Finite Automata and we prove that (3) from a trace language point of view, inclusions between RFAs and Finite Automata are undecidable and (4)  ...  Furthermore, this property holds for Reactive Fi o Automata and Restricted automata too. In this way, model checking of LTL is well-de ned for these transitions system.  ... 
doi:10.1007/3-540-49253-4_10 fatcat:ofbb5fwxfffwpkyg6blu5qxr5u

Page 5747 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
and model checking of reactive fiffo automata (106-123); Bettina Buth, Jan Peleska and Hui Shi, Combining methods for the livelock analysis of a fault- tolerant system (124-139); Bernhard Heinemann, Separating  ...  Maibaum, A logic for real- time systems specification, its algebraic semantics, and equational calculus (91-105); Gregoire Sutre, Alain Finkel, Olivier Roux and Franck Cassez, Effective recognizability  ...