|
Volumn 5, Issue , 2000, Pages 3153-3158
|
Efficient computation of enabled transition bindings in high-level Petri nets
a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COLOURED PETRI NETS (CPN);
CONSTRAINT SATISFACTION PROBLEM (CSP);
RESOURCE CONSTRAINTS;
TRANSITION BINDINGS;
ALGORITHMS;
COMPUTER SIMULATION;
CONSTRAINT THEORY;
PROBLEM SOLVING;
PETRI NETS;
|
EID: 0034499016
PISSN: 08843627
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (5)
|
References (8)
|