Undecidable problems of decentralized observation and control on regular languages

We introduce a decentralized observation problem, where the system under observation is modeled as a regular la L over a finite alphabet Σ andn subsets ofΣ model distributed observation points. A regular language K ⊆ L models a set o distinguished behaviors, say, correct behaviors of the system. The objective is to check the existence of a function wh then… CONTINUE READING



Citations per Year

91 Citations

Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.