A Predictability Algorithm for Distributed Discrete Event Systems
2015
Predictability is considered as a crucial system property that determines with certainty the future occurrence of a fault based on a sequence of observations on system model. There are very few works done on the predictability problem for discrete event systems, which is however extremely important for developing critical complex systems. In this paper, we propose a formal sufficient and necessary condition for this property before presenting a new algorithm based on it, which is extendible from a centralized framework to a distributed one. Both are formally presented, as well as experimental results that show the efficiency of our approach.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
22
References
6
Citations
NaN
KQI