On the complexity of synthesizing a minimum-weighted supervisor under partial observation (Q458885)
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: On the complexity of synthesizing a minimum-weighted supervisor under partial observation |
scientific article; zbMATH DE number 6352414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of synthesizing a minimum-weighted supervisor under partial observation |
scientific article; zbMATH DE number 6352414 |
Statements
On the complexity of synthesizing a minimum-weighted supervisor under partial observation (English)
0 references
8 October 2014
0 references
weighted automata
0 references
supervisor synthesis
0 references
controllability
0 references
normality
0 references
NP-completeness/hardness
0 references
natural observer
0 references
0.7604178786277771
0 references
0.7518712878227234
0 references
0.7515298128128052
0 references
0.7515264749526978
0 references
0.7506167888641357
0 references
