On the application of formal methods for specifying and verifying distributed protocols
SourceProceedings of the 7th IEEE International Symposium on Networking Computing and Applications, NCA 2008
7th IEEE International Symposium on Networking Computing and Applications, NCA 2008
Google Scholar check
MetadataShow full item record
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relative capabilities, strengths and usability. To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols. © 2008 IEEE.