Reliable Predictability of Failure Events for Decentralized Discrete-Event Systems

Abstract

This paper addresses the reliable predictability of decentralized discrete event systems (DESs) in face of possible unavailability of some local agents. The notion of k-reliable copredictability is formalized. Roughly speaking, a decentralized system distributed at $m$ local sites being k-reliably copredictable $(1\leq k\leq m)$ means that the prediction performance will not be degraded even when m- $k$ local agents are unavailable. In order to perform the reliable prediction, an automaton called reliable copredictor is constructed from the given decentralized system. Finally, a necessary and sufficient condition for the k-reliable copredictability of DESs based on the reliable copredictor is presented, and an approach for verifying the k-reliable copredictability of DESs is developed.