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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.automatica.2017.03.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2606674369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-automaton aperiodicity is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3108337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observability of discrete event dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory Control of a Class of Discrete Event Processes / 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

Latest revision as of 12:33, 14 July 2024

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
    discrete event system
    0 references
    finite automaton
    0 references
    weak (periodic) detectability
    0 references
    PSPACE-hardness
    0 references

    Identifiers