A Note on Undecidability of Observation Consistency for Non-Regular Languages

Tomáš MasopustTomáš Masopust

Download

Tomáš Masopust
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Technical Report, arXiv.org, volume CoRR abs/1201.1754, January 2012

Details
Bibtex

KurzfassungAbstract
One of the most interesting questions concerning hierarchical control of discrete-event systems with partial observations is a condition under which the language observability is preserved between the original and the abstracted plant. Recently, we have characterized two such sufficient conditions---observation consistency and local observation consistency. In this paper, we prove that the condition of observation consistency is undecidable for non-regular (linear, deterministic context-free) languages. The question whether the condition is decidable for regular languages is open.
Bemerkung: Note: The problem is still open
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@techreport{M2012,
  author      = {Tom{\'{a}}{\v{s}} Masopust},
  title       = {A Note on Undecidability of Observation Consistency for
                 Non-Regular Languages},
  institution = {arXiv.org},
  year        = {2012},
  month       = {January}
}