Detectability of labeled weighted automata over monoids (Q2081085): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10626-022-00362-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3108600299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Universality for Timed Automata with Minimal Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Yen’s Path Logic for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinization of transducers over finite and infinite words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and Logic-Based Dynamic Observers for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Discrete Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3602752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Codiagnosability for Discrete Event and Timed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree of Sequentiality of Weighted Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observability of place/transition nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subclasses of Presburger arithmetic and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation and Inference in Discrete Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Description of Linear Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of detectability in probabilistic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of C-detectability using Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: State estimation of max-plus automata with unobservable events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Detectability for Unambiguous Weighted Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observer Construction for Polynomially Ambiguous Max-Plus Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observers for a Class of Timed Automata Based on Elapsed Time Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding detectability in discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding detectability for labeled Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Path Length Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosability of discrete-event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detectability of Discrete Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized detectability for discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Diagnosis for Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory control of discrete-event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for deciding the existence of certain petri net paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On detectability of labeled Petri nets and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Time and Discrete-Space Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10626-022-00362-8 / rank
 
Normal rank

Latest revision as of 23:57, 16 December 2024

scientific article
Language Label Description Also known as
English
Detectability of labeled weighted automata over monoids
scientific article

    Statements

    Detectability of labeled weighted automata over monoids (English)
    0 references
    0 references
    12 October 2022
    0 references
    labeled weighted automaton
    0 references
    monoid
    0 references
    semiring
    0 references
    detectability
    0 references
    concurrent composition
    0 references
    observer
    0 references
    detector
    0 references
    complexity
    0 references
    labeled timed automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references