Prognosis of -languages for the diagnosis of *-languages: a topological perspective

DOI10.1007/S10626-009-0084-5MaRDI QIDQ843994zbMATH OpenOpenAlexFDO

Authors 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

diagnosisdiscrete-event systemsprognosabilitytopologies in the space of infinite words

Mathematics Subject Classification ID

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

Recommendations

• Diagnosis in infinite-state probabilistic systems
• Diagnosis of behaviors of interest in partially-observed discrete-event systems
• A tale of two diagnoses in probabilistic systems
• What topology tells us about diagnosability in partial order semantics
• scientific article; zbMATH DE number 6707784

Cites work

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

Cited in

(2)

• What topology tells us about diagnosability in partial order semantics
• Computer Aided Verification

This page was built for publication: Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843994)