Predictability of Event Occurrences in Timed Systems. Cassez, F. & Grastien, A. In Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings, volume 8053, of Lecture Notes in Computer Science, pages 62–76, 2013. Springer.
Predictability of Event Occurrences in Timed Systems [pdf]Paper  Predictability of Event Occurrences in Timed Systems [pdf]Slides  Predictability of Event Occurrences in Timed Systems [link]Link  doi  abstract   bibtex   1 download  
We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.

Downloads: 1