Techreport4020: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Long Cheng (Diskussion | Beiträge) K (1 Version: Automatically imported publication data from DBLP) |
Tomas Masopust (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname=Tomáš | |||
|ErsterAutorNachname=Masopust | |ErsterAutorNachname=Masopust | ||
}} | }} | ||
{{Techreport | {{Techreport | ||
|Title=A Note on Undecidability of Observation Consistency for Non-Regular Language | |Title=A Note on Undecidability of Observation Consistency for Non-Regular Language | ||
|Year=2012 | |Year=2012 | ||
|Institution= | |Institution=arxiv.org | ||
|Note=The problem is still open | |||
|Referiert=0 | |||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract= | |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. | ||
| | |Download=A Note on Undecidability of Observation Consistency for Non-Regular Language.pdf | ||
| | |Forschungsgruppe=Knowledge Systems | ||
|DOI=http://arxiv.org/abs/1201.1754 | |DOI=http://arxiv.org/abs/1201.1754 | ||
}} | }} | ||
Version vom 29. Oktober 2014, 16:35 Uhr
A Note on Undecidability of Observation Consistency for Non-Regular Language
Tomáš MasopustTomáš Masopust
Tomáš Masopust
A Note on Undecidability of Observation Consistency for Non-Regular Language
Technical Report, arxiv.org, 2012
A Note on Undecidability of Observation Consistency for Non-Regular Language
Technical Report, arxiv.org, 2012
- 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: Knowledge SystemsKnowledge-Based Systems
@techreport{M2012,
author = {Tom{\'{a}}{\v{s}} Masopust},
title = {A Note on Undecidability of Observation Consistency for
Non-Regular Language},
institution = {arxiv.org},
year = {2012}
}
