Copyright © 2006 Elsevier B.V. All rights reserved.
Available online 18 May 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The STP (Spanning Tree Protocol) which is standardized as IEEE 802.1D has been used in many bridges and switches of networks. This algorithm tries to eliminate loops in bridged networks. In this study the correctness of STP algorithm is formally verified using Extended ebeca. In order to not to be confined to a specific case or set of cases we used a compositional verification approach. This allows us to gain generality in verifying the algorithm. The clarity and convenience in model checking by means of Extended
ebeca suggests that this language can be used for verifying more network protocols in future.






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)





