Parallel Discrete Event Simulation in Star Networks with Application to Telecommunications
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Exploiting the Predictability of TCP's Steady-State Behavior to Speed Up Network Simulation
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
ACM Transactions on Computer Systems (TOCS)
On diagnosis and predictability of partially-observed discrete-event systems
On diagnosis and predictability of partially-observed discrete-event systems
Monitoring and fault diagnosis of hybrid systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
What topology tells us about diagnosability in partial order semantics
Discrete Event Dynamic Systems
Predictability of event occurrences in timed systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 22.14 |
This paper studies the problem of predicting occurrences of a significant event in a partially-observed discrete-event system. The predictability of occurrences of an event in a system is defined in the context of formal languages. The predictability of a language is a stronger condition than the diagnosability of the language. Two necessary and sufficient conditions for predictability of occurrences of an event in systems modeled by regular languages are presented. Both conditions can be algorithmically tested. The first condition employs diagnosers. The second condition employs verifiers and results in a polynomial-time (in the number of states) complexity test for verification of predictability. When predictability holds, diagnosers can be used online to predict the significant event.