2012/01/09 by Tomáš Masopust, Masopust, Tomáš
Computer Science · #68Q45 #93A13 #93B07 #93C65 #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Electrical engineering #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Petri Nets in System Modeling #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1201.1754
openalex publication_date 2012/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.