|
Volumn 4024 LNCS, Issue , 2006, Pages 322-341
|
Designing reversibility-enforcing supervisors of polynomial complexity for bounded Petri nets through the theory of regions
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTER SOFTWARE;
CONSTRAINT THEORY;
INTEGER PROGRAMMING;
OPTIMIZATION;
POLYNOMIALS;
BEHAVIORAL SPACES;
MUTUAL EXCLUSION CONSTRAINTS;
OPTIMIZATION SOFTWARE;
PROCESS-RESOURCE NETS;
REVERSIBILITY-ENFORCING SUPERVISORS;
PETRI NETS;
|
EID: 33746071615
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/11767589_18 Document Type: Conference Paper |
Times cited : (29)
|
References (11)
|