|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing
Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services
Wuhan, China
October 22-October 23
ISBN: 978-0-7695-4498-4
| ASCII Text | x | ||
| Wei Zhou, Liu Chen, "Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services," Intelligence Information Processing and Trusted Computing, International Symposium on, pp. 35-38, 2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/IPTC.2011.16, author = {Wei Zhou and Liu Chen}, title = {Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services}, journal ={Intelligence Information Processing and Trusted Computing, International Symposium on}, volume = {0}, year = {2011}, isbn = {978-0-7695-4498-4}, pages = {35-38}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPTC.2011.16}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Intelligence Information Processing and Trusted Computing, International Symposium on TI - Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services SN - 978-0-7695-4498-4 SP35 EP38 A1 - Wei Zhou, A1 - Liu Chen, PY - 2011 KW - web service KW - Byzantine fault KW - replica KW - I/O automata VL - 0 JA - Intelligence Information Processing and Trusted Computing, International Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPTC.2011.16
A Byzantine Fault Tolerant Algorithm suiting web services is proposed considering the features of web services. There are significant differences between the algorithm and the Castro and Liskov's well-known practical Byzantine fault tolerance method. First, we have to create replicas on both sides of communicating web services, while in CLBFT's method, replicas are created only on the server side. Second, due to the autonomous behavior of web services, we have to synchronize the timing of the receiving of messages among replicas. The I/O automata model of the algorithm is presented, and it's correctness is formally specified and verified.
Index Terms:
web service, Byzantine fault, replica, I/O automata
Citation:
Wei Zhou, Liu Chen, "Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services," iptc, pp.35-38, 2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing, 2011
Usage of this product signifies your acceptance of the Terms of Use.