Transition refinement for deriving a distributed minimum weight spanning tree algorithm
| Contribuinte(s) |
J. Esparza C. Lakos |
|---|---|
| Data(s) |
01/01/2002
|
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Palavras-Chave | #algorithm #Gallager #Humblet #Spira #new correctness proof #new model #Algebraic Petri nets #transition refinement #E1 #700199 Computer software and services not elsewhere classified #280401 Analysis of Algorithms and Complexity |
| Tipo |
Conference Paper |