|
Volumn 616 LNCS, Issue , 1992, Pages 263-278
|
An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
CHARACTERIZATION;
PETRI NETS;
BOUNDEDNESS;
FREE-CHOICE NETS;
INITIAL MARKING;
LIVENESS;
NEW RESULTS;
POLYNOMIAL-TIME ALGORITHMS;
POLYNOMIAL APPROXIMATION;
|
EID: 85027188133
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-55676-1_15 Document Type: Conference Paper |
Times cited : (37)
|
References (10)
|