2013/06/04 by Franck Cassez, Cassez, Franck, Alban Grastien +1 · 2 citations
Computer Science · #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Optimization and Control (math.OC) #Petri Nets in System Modeling #Real-Time Systems Scheduling #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1306.0662
openalex publication_date 2013/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
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.