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

Computer Science – Systems and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Note on Undecidability of Observation Consistency for Non-Regular Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on Undecidability of Observation Consistency for Non-Regular Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Undecidability of Observation Consistency for Non-Regular Languages will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-643258

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.