A Note on Undecidability of Observation Consistency for Non-Regular Languages
Systems and Control
2012-01-10 v1 Formal Languages and Automata Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1201.1754,
title = {A Note on Undecidability of Observation Consistency for Non-Regular Languages},
author = {Tomáš Masopust},
journal= {arXiv preprint arXiv:1201.1754},
year = {2012}
}