Verifying mutual exclusion and liveness properties with split preconditions
AK Singh, AK Bandyopadhyay - Journal of Computer Science and …, 2004 - Springer
AK Singh, AK Bandyopadhyay
Journal of Computer Science and Technology, 2004•SpringerThis work is focused on presenting a split precondition approach for the modeling and
proving the correctness of distributed algorithms. Formal specification and precise analysis
of Peterson's distributed mutual exclusion algorithm for two process has been considered.
The proof of properties like, mutual exclusion, liveness, and lockout-freedom have also been
presented.
proving the correctness of distributed algorithms. Formal specification and precise analysis
of Peterson's distributed mutual exclusion algorithm for two process has been considered.
The proof of properties like, mutual exclusion, liveness, and lockout-freedom have also been
presented.
Abstract
This work is focused on presenting a split precondition approach for the modeling and proving the correctness of distributed algorithms. Formal specification and precise analysis of Peterson's distributed mutual exclusion algorithm for two process has been considered. The proof of properties like, mutual exclusion, liveness, and lockout-freedom have also been presented.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果