The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete (Q2409237): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:32, 2 February 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
11 October 2017
0 references
discrete event system
0 references
finite automaton
0 references
weak (periodic) detectability
0 references
PSPACE-hardness
0 references
