Observability of discrete-time linear systems with communication protocols and dropouts

We consider the problem of analyzing observability in discrete-time linear systems when the sensors, deployed in a distributed manner, may not communicate to an observer at once, and a protocol determines the communication pattern among different sensors. We use the formalism of automata to model the sequence of measurements determined by a protocol and show that the question of observability is decidable for the resulting system. We give upper bounds on the number of measurements required for deciding observability. In addition, we consider the effects of dropouts, which may occur in communicating the measurements across the channel. Again using the formalism of automatons to model certain classes of dropouts combined with the protocol, it is shown that observability is decidable in finite time for measurements sent across using a protocol, and subject to dropouts.