DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS (Q3526548)
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: DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS |
scientific article; zbMATH DE number 5346935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS |
scientific article; zbMATH DE number 5346935 |
Statements
DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS (English)
0 references
25 September 2008
0 references
discrete event systems
0 references
forbidden state problem
0 references
decision problem
0 references
complexity
0 references
control policies
0 references
non-blocking
0 references
fairness
0 references
finite state systems
0 references
Petri nets
0 references
0.8195850253105164
0 references
0.8186861276626587
0 references
0.8002432584762573
0 references
0.7996646165847778
0 references
0.7940423488616943
0 references
