The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete (Q2409237)

From MaRDI portal
Revision as of 13:33, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
scientific article

    Statements

    The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete (English)
    0 references
    0 references
    0 references
    11 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete event system
    0 references
    finite automaton
    0 references
    weak (periodic) detectability
    0 references
    PSPACE-hardness
    0 references
    0 references