Name
Abstract | ||
|---|---|---|
This paper deals with the problem of decentralized observability of discrete event systems. We consider a set of sites each capable of observing a subset of the total event set. When a synchronization occurs, each site transmits its own observation to a coordinator that decides if the word observed belongs to a reference language K or not. Two different properties are studied: uniform q-observability and q-sync observability. It is proved that both properties are decidable for regular languages. Finally, under the assumption that languages K and L are regular, and all the events are observable by at least one site, we propose a procedure to determine the instants at which synchronization should occur to detect the occurrence of any word not in K, as soon as it occurs. The advantage of the proposed approach is that most of the burdensome computations can be moved off-line. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.automatica.2017.08.009 | Automatica |
Keywords | Field | DocType |
Discrete event systems,Decentralized observability,Formal languages | Synchronization,Observability,Observable,Control theory,Decidability,Regular language,sync,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
85 | 1 | 0005-1098 |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Giua | 1 | 1836 | 199.57 |
| Cristian Mahulea | 2 | 161 | 19.50 |
| Carla Seatzu | 3 | 700 | 67.51 |