Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective

DOI10.1007/s10626-009-0084-5zbMath1180.93064OpenAlexW2067782496MaRDI QIDQ843994

Andreas Bauer, Sophie Pinchinat

Publication date: 18 January 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-009-0084-5

zbMATH Keywords

discrete-event systemsdiagnosisprognosabilitytopologies in the space of infinite words

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

What topology tells us about diagnosability in partial order semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Relations rationnelles infinitaires
• The complementation problem for Büchi automata with applications to temporal logic
• Recognizing safety and liveness
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Safety, liveness and fairness in temporal logic
• Relationships between nondeterministic and deterministic tape complexities
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Diagnosability of discrete-event systems
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic Specifications
• On Relations Defined by Generalized Finite Automata
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Model checking of safety properties