Deciding detectability for labeled Petri nets (Q1737932): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128182914, #quickstatements; #temporary_batch_1723938276269
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: ON YEN'S PATH LOGIC FOR PETRI NETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets / 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: 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: Observability of discrete event dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized detectability for discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delayed Detectability 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: Decidability of opacity verification problems in labeled Petri net 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: Q5375267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decidability and Complexity of Diagnosability for Labeled Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification complexity of a class of observational properties for modular discrete events 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 / Wikidata QID
 
Property / Wikidata QID: Q128182914 / rank
 
Normal rank

Latest revision as of 01:51, 18 August 2024

scientific article
Language Label Description Also known as
English
Deciding detectability for labeled Petri nets
scientific article

    Statements

    Deciding detectability for labeled Petri nets (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete event systems
    0 references
    Petri nets
    0 references
    detectability
    0 references
    complexity
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references