pith. sign in

arxiv: 1201.1754 · v1 · pith:YWDGY3NEnew · submitted 2012-01-09 · 💻 cs.SY · cs.FL

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

classification 💻 cs.SY cs.FL
keywords consistencyconditionlanguagesobservationnon-regularabstractedcharacterizedconcerning
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.