|
Volumn 4762 LNCS, Issue , 2007, Pages 98-113
|
On the efficient computation of the minimal coverability set for petri nets
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION ALGORITHMS;
COMPUTATIONAL METHODS;
PROBLEM SOLVING;
COVERABILITY;
REACHABLE MARKINGS;
PETRI NETS;
|
EID: 38149005502
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-75596-8_9 Document Type: Conference Paper |
Times cited : (23)
|
References (12)
|