A predictability algorithm for distributed discrete event systems

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Ye, L., Dague, P., & Nouioua, F. (2015). A predictability algorithm for distributed discrete event systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9407, pp. 201–216). Springer Verlag. https://doi.org/10.1007/978-3-319-25423-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free