Distributed Asynchonous detection: General models
John S. Baras · 1987
We introduce axiomatically, new non-commutative probability models for the data in distributed detection asynchronous schemes. We completely characterize mathematically these models and their representation. They represent extensions of models for communicating asynchronous processes. We provide a general theorem characterizing the representation of data collected by a distributed asynchronous detection scheme. We discuss how this model can be used to obtain performance bounds.