PSPACE-completeness of modular supervisory control problems (Q1773103)
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: PSPACE-completeness of modular supervisory control problems |
scientific article; zbMATH DE number 2161212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of modular supervisory control problems |
scientific article; zbMATH DE number 2161212 |
Statements
PSPACE-completeness of modular supervisory control problems (English)
0 references
25 April 2005
0 references
modular systems
0 references
supervisory control
0 references
verification
0 references
computational complexity
0 references
0 references
0 references
0 references
0.7847086191177368
0 references
0.784567654132843
0 references
0.779213547706604
0 references
