Techreport4020: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Tomas Masopust (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Tomas Masopust (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 4: | Zeile 4: | ||
}} | }} | ||
{{Techreport | {{Techreport | ||
|Title=A Note on Undecidability of Observation Consistency for Non-Regular | |Title=A Note on Undecidability of Observation Consistency for Non-Regular Languages | ||
|Year=2012 | |Year=2012 | ||
|Institution= | |Month=Januar | ||
|Institution=arXiv.org | |||
|Archivierungsnummer=CoRR abs/1201.1754 | |||
|Note=The problem is still open | |Note=The problem is still open | ||
|Referiert=0 | |Referiert=0 | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|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. | |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 | |Download=A Note on Undecidability of Observation Consistency for Non-Regular Language.pdf | ||
|Forschungsgruppe=Knowledge Systems | |Forschungsgruppe=Knowledge Systems | ||
|DOI=http://arxiv.org/abs/1201.1754 | |DOI=http://arxiv.org/abs/1201.1754 | ||
}} | }} | ||
Version vom 10. November 2014, 22:57 Uhr
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Tomáš MasopustTomáš Masopust
Tomáš Masopust
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Technical Report, arXiv.org, volume CoRR abs/1201.1754, January 2012
A Note on Undecidability of Observation Consistency for Non-Regular Languages
Technical Report, arXiv.org, volume CoRR abs/1201.1754, January 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 Languages},
institution = {arXiv.org},
year = {2012},
month = {January}
}
