|
 
|
[BM92] A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets
Conférence Internationale avec comité de lecture : Application and Theory of Petri Nets, January 1992, pp.62-75, Series LNCS 616,
motcle:
Résumé:
Voir le lien ici
Commentaires:
note
BibTeX
| @inproceedings { | |||
| BM92, | |||
| title | = | "{A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets}", | |
| author | = | " K. Barkaoui and M. Minoux ", | |
| booktitle | = | "{Application and Theory of Petri Nets}", | |
| year | = | 1992, | |
| month | = | "January", | |
| series | = | "LNCS 616", | |
| pages | = | "62-75", | |
| note | = | "{note}", | |
| } | |||
