The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete (Q2409237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete |
scientific article; zbMATH DE number 6789537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete |
scientific article; zbMATH DE number 6789537 |
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
0.8588128089904785
0 references
0.8460322618484497
0 references
0.8152725696563721
0 references
0.8131114840507507
0 references
0.7850236296653748
0 references
