Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Michele Tatarek"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 131-146 (2014)
We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalizat
Externí odkaz:
https://doaj.org/article/9f3dd29bc25142419bcf7688d4ae4d6a
Publikováno v:
GandALF
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 131-146 (2014)
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 131-146 (2014)
We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::854f5b44db2552f96c140c59eb1aab19
https://doi.org/10.4204/eptcs.161.13
https://doi.org/10.4204/eptcs.161.13