dc.contributor.author |
Roig, Pedro Juan |
|
dc.contributor.author |
Alcaraz, Salvador |
|
dc.contributor.author |
Gilly, Katja |
|
dc.date.accessioned |
2024-02-01T08:35:49Z |
|
dc.date.available |
2024-02-01T08:35:49Z |
|
dc.identifier.uri |
http://hdl.handle.net/11201/164444 |
|
dc.description.abstract |
Spanning-Tree Protocol (STP) has nowadays been implemented by most manufacturers in order to avoid loops in bridged networks. IEEE 802.1D STP is the original standard and it is run as a distributed algorithm by every bridge. In this paper we propose a formal specification of that STP by using a Process Algebra named Algebra of Communicating Processes (ACP), following a manual approach. Furthermore, STP protocol verification has been performed, both in a formal and in an informal way. |
|
dc.format |
application/pdf |
|
dc.relation.isformatof |
https://doi.org/10.5755/j01.eie.23.2.18005 |
|
dc.relation.ispartof |
Elektronika Ir Elektrotechnika, 2017, vol. 23, num. 2, p. 84-91 |
|
dc.rights |
, 2017 |
|
dc.subject.classification |
Electrònica i telecomunicacions |
|
dc.subject.other |
Electronics and telecommunication |
|
dc.title |
Formal specification of Spanning Tree Protocol using ACP |
|
dc.type |
info:eu-repo/semantics/article |
|
dc.date.updated |
2024-02-01T08:35:49Z |
|
dc.subject.keywords |
ACP |
|
dc.subject.keywords |
Distributed algorithms |
|
dc.subject.keywords |
Formal protocol specification |
|
dc.subject.keywords |
STP |
|
dc.rights.accessRights |
info:eu-repo/semantics/openAccess |
|
dc.identifier.doi |
https://doi.org/10.5755/j01.eie.23.2.18005 |
|