Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Theoretical Computer Science
Fault Diagnosis for Timed Automata
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Fault Diagnosis with Static and Dynamic Observers
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Predictability of event occurrences in partially-observed discrete-event systems
Automatica (Journal of IFAC)
Dynamic Observers for the Synthesis of Opaque Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Fault diagnosis using timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Synthesis of opaque systems with static and dynamic masks
Formal Methods in System Design
Bounded Predictability for Faulty Discrete Event Systems
SCCC '11 Proceedings of the 2011 30th International Conference of the Chilean Computer Science Society
| Hi-index | 0.00 |
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.