Abstract
Since parallel and distributed algorithms are subject to subtle errors that are unlikely to be detected in usual operation, only testing is not enough to reduce errors. Thus, it is necessary to formally analyze such algorithms in order to confirm that they have desirable properties. This paper describes the case study that Suzuki&Kasami distributed mutual exclusion algorithm is formally analyzed. In the case study, the algorithm has been modeled using UNITY-like models called observational transition systems (ots’s), the model has been described in CafeOBJ, and it has been verified that the algorithm is mutually exclusive and lockout free with the help of CafeOBJ system. In the verification that the algorithm is lockout free, we have found a hidden assumption necessary for the verification, which is not explicitly mentioned in the original paper written by Suzuki and Kasami.
Chapter PDF
Similar content being viewed by others
Keywords
References
CafeOBJ web page (2001). CafeOBJ web page. http://www.ldl.jaist.ac.jp/cafeobj/.
Chandy, K. M. and Misra, J. (1988). Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA.
Diaconescu, R. and Futatsugi, K. (1998). CafeOBJ Report. AMAST Series in Computing, 6. World Scientific, Singapore.
Diaconescu, R., Futatsugi, K., and Iida, S. (1999). Component-based algebraic specification and verification in CafeOBJ. In Formal Methods ‘89 Conference Proceedings (LNCS 1709, Springer-Verlag), pages 1644–1663.
Goguen, J. and Malcolm, G. (2000). A hidden agenda. TCS, 245: 55–101.
Lamport, L. (1994). The temporal logic of actions. ACM TOPLAS, 16 (3): 872–923.
Lynch, N. A. (1996). Distributed algorithms. Morgan-Kaufmann, San Francisco, CA.
Manna, Z. and Pnueli, A. (1991). The temporal logic of reactive and concurrent systems: specification. Springer-Verlag, NY.
Manna, Z. and Pnueli, A. (1995). Temporal verification of reactive systems: safety. Springer-Verlag, NY.
Suzuki, I. and Kasami, T. (1985). A distributed mutual exclusion algorithm. ACM TOCS, 3 (4): 344–349.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this paper
Cite this paper
Ogata, K., Futatsugi, K. (2002). Formal Analysis of Suzuki&Kasami Distributed Mutual Exclusion Algorithm. In: Jacobs, B., Rensink, A. (eds) Formal Methods for Open Object-Based Distributed Systems V. FMOODS 2002. IFIP — The International Federation for Information Processing, vol 81. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35496-5_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-35496-5_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5268-7
Online ISBN: 978-0-387-35496-5
eBook Packages: Springer Book Archive