Decentralized Observation of Discrete-Event Systems: At Least One Can Tell

by   Stavros Tripakis, et al.

We introduce a new decentralized observation condition which we call "at least one can tell" (OCT) and which attempts to capture the idea that for any possible behavior that a system can generate, at least one decentralized observation agent can tell whether that behavior was "good" or "bad", for given formal specifications of "good" and "bad". We provide several equivalent formulations of the OCT condition, and we relate it to (and show that it is different from) previously introduced joint observability. In fact, contrary to joint observability which is undecidable, we show that the OCT condition is decidable. We also show that when the condition holds, finite-state decentralized observers exist.


page 1

page 2

page 3

page 4


On the Monitoring of Decentralized Specifications Semantics, Properties, Analysis, and Simulation

We define two complementary approaches to monitor decentralized systems....

Scalable Accelerated Decentralized Multi-Robot Policy Search in Continuous Observation Spaces

This paper presents the first ever approach for solving continuous-obser...

Event Concealment and Concealability Enforcement in Discrete Event Systems Under Partial Observation

Inspired by privacy problems where the behavior of a system should not b...

A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems

The state inference problem and fault diagnosis/prediction problem are f...

Notions of Centralized and Decentralized Opacity in Linear Systems

We formulate notions of opacity for cyberphysical systems modeled as dis...

Aggregation using input-output trade-off

In this paper, we introduce a new learning strategy based on a seminal i...

Please sign up or login with your details

Forgot password? Click here to reset