The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Infinite trees and automaton definable over &ohgr;-words
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Handbook of formal languages, vol. 3
Model Checking of Safety Properties
Formal Methods in System Design
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
| Hi-index | 0.00 |
This article offers a novel perspective on the diagnosis of *-languages via a topological characterization of ω-languages. This allows for the different concepts that currently exist in diagnosis of discrete-event systems to be related to one another in a uniform setting and to study their complexity. For this purpose, we introduce the notion of prognosability of an ω-language, which in the classical setting corresponds to testing if a language is diagnosable and prediagnosable. We show that we can build a prognoser for some ω-language if this language is open and saturated, where openness is usually implied in the finitary setting. For both of these problems we present PSPACE algorithms, and establish that prognosability (i.e., whether or not a prognoser exists) for an ω-language is a PSPACE-complete problem. Our new characterization offers a novel point of view in the classical setting of diagnosis.