Detectability of labeled weighted automata over monoids

DOI10.1007/S10626-022-00362-8OpenAlexW3108600299MaRDI QIDQ2081085

Kuize Zhang

Publication date: 12 October 2022

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

Full work available at URL: https://arxiv.org/abs/2006.14164

zbMATH Keywords

complexityobserverdetectorsemiringdetectabilitymonoidconcurrent compositionlabeled timed automatonlabeled weighted automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Observability (93B07)

Related Items (2)

State-based opacity of labeled real-time automata ⋮ Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized detectability for discrete event systems
• Subclasses of Presburger arithmetic and the polynomial-time hierarchy
• A unified approach for deciding the existence of certain petri net paths
• A theory of timed automata
• Verification of detectability in probabilistic finite automata
• Deciding detectability for labeled Petri nets
• Supervisory control of discrete-event systems
• Complexity of deciding detectability in discrete event systems
• Determinization of transducers over finite and infinite words.
• Verification of C-detectability using Petri nets
• On detectability of labeled Petri nets and finite automata
• State estimation of max-plus automata with unobservable events
• Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
• The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
• The Exact Path Length Problem
• A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks
• Degree of Sequentiality of Weighted Automata
• Classical and Logic-Based Dynamic Observers for Finite Automata
• Undecidability of Universality for Timed Automata with Minimal Resources
• On Yen’s Path Logic for Petri Nets
• On the complexity of integer programming
• Diagnosability of discrete-event systems
• Introduction to Discrete Event Systems
• Verification of Detectability for Unambiguous Weighted Automata
• Observers for a Class of Timed Automata Based on Elapsed Time Graphs
• Observer Construction for Polynomially Ambiguous Max-Plus Automata
• A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
• Discrete-Time and Discrete-Space Dynamical Systems
• Estimation and Inference in Discrete Event Systems
• Observability of place/transition nets
• Detectability of Discrete Event Systems
• The Complexity of Codiagnosability for Discrete Event and Timed Systems
• Fault Diagnosis for Timed Automata
• Mathematical Description of Linear Dynamical Systems
• Foundations of Software Science and Computational Structures
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Detectability of labeled weighted automata over monoids