Verification of C-detectability using Petri nets (Q2023240): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UMDES / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2921227100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1903.07827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Discrete Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On observability 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: Comparative analysis of related notions of opacity in centralized and coordinated architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault detection for discrete event systems using Petri nets with unobservable transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observer-Based State-Feedback Control of Timed Petri Nets With Deadlock Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of State-Based Opacity Using Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marking Estimation of Petri Nets With Silent Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized detectability for discrete event systems / 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: Delayed Detectability of Discrete Event Systems / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets / rank
 
Normal rank

Latest revision as of 15:32, 25 July 2024

scientific article
Language Label Description Also known as
English
Verification of C-detectability using Petri nets
scientific article

    Statements

    Verification of C-detectability using Petri nets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2021
    0 references
    detectability
    0 references
    Petri nets
    0 references
    discrete-event systems
    0 references
    state estimation
    0 references

    Identifiers