Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata

DOI10.1016/j.tcs.2024.114743MaRDI QIDQ6614006

Kuize Zhang, Jörg Raisch

Publication date: 7 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

diagnosabilityconcurrent compositionlabeled weighted automaton over a progressive dioid

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault detection for discrete event systems using Petri nets with unobservable transitions
• A unified approach for deciding the existence of certain petri net paths
• A theory of timed automata
• Diagnosability of discrete event systems and its applications
• A necessary and sufficient condition for diagnosability of stochastic discrete event systems
• Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
• Coordinated decentralized protocols for failure diagnosis of discrete event systems
• Detectability of labeled weighted automata over monoids
• Reachability in two-clock timed automata is PSPACE-complete
• The exact path length problem.
• On Yen’s Path Logic for Petri Nets
• Supervisory control of discrete-event processes with partial observations
• A polynomial algorithm for testing diagnosability of discrete-event systems
• On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
• The Complexity of Diagnosability and Opacity Verification for Petri Nets
• Diagnosability of discrete-event systems
• An Efficient Approach for Online Diagnosis of Discrete Event Systems
• A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• Diagnosability of stochastic discrete-event systems
• Detectability of Discrete Event Systems
• Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
• The Complexity of Codiagnosability for Discrete Event and Timed Systems
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
• Fault Diagnosis for Timed Automata
• Foundations of Software Science and Computational Structures

This page was built for publication: Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata

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