Abstract
The mutual exclusion problem is a classic and essential problem in computer science. Since its inception, many related algorithms and variants have been proposed. However, finding the atomicity requirement of mutual exclusion algorithms remains challenging. In this paper, we proposed a model-checking framework called MEA to solve this issue, which is implemented in Maude. MEA provides a workflow to model a mutual exclusion algorithm and can easily perform verification. We use two classic mutual exclusion algorithms as examples to elaborate on how it works. Both two cases denote that MEA is capable of basic modeling of mutual exclusion algorithms focusing on atomicity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alagarsamy, K.: Some myths about famous mutual exclusion algorithms. SIGACT News 34(3), 94–103 (2003)
Attiya, H., Kogan, A., Welch, J.L.: Efficient and robust local mutual exclusion in mobile ad hoc networks. IEEE Trans. Mob. Comput. 9(3), 361–375 (2010)
Bagchi, S.: Design and topological analysis of probabilistic distributed mutual exclusion algorithm with unbiased refined ordering. Futur. Gener. Comput. Syst. 95, 175–186 (2019)
Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: CCGrid, vol. 2004, pp. 539–546 (2004)
Clavel, M., et al.: Maude manual (version 3.0). SRI International (2020)
Clavel, M., et al.: Maude: specification and programming in rewriting logic. Theoret. Comput. Sci. 285(2), 187–243 (2002)
Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71999-1
Clavel, M., Eker, S., Lincoln, P., Meseguer, J.: Principles of Maude. Electron. Notes Theor. Comput. Sci. 4, 65–89 (1996)
Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1, 115–138 (1971). https://doi.org/10.1007/BF00289519
Joung, Y.: Asynchronous group mutual exclusion. Distrib. Comput. 13(4), 189–206 (2000)
Lamport, L.: A new solution of Dijkstra’s concurrent programming problem. Commun. ACM 17(8), 453–455 (1974)
Peterson, G.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115–116 (1981)
Acknowledgement
This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 62032024, 61872145), the “Digital Silk Road” Shanghai International Joint Lab of Trustworthy Intelligent Software (Grant No. 22510750100), Shanghai Trusted Industry Internet Software Collaborative Innovation Center, and the Dean’s Fund of Shanghai Key Laboratory of Trustworthy Computing (East China Normal University).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Luo, J., Yin, J., Zhu, H. (2023). MEA: A Framework for Model Checking of Mutual Exclusion Algorithms Focusing on Atomicity. In: Takizawa, H., Shen, H., Hanawa, T., Hyuk Park, J., Tian, H., Egawa, R. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2022. Lecture Notes in Computer Science, vol 13798. Springer, Cham. https://doi.org/10.1007/978-3-031-29927-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-031-29927-8_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29926-1
Online ISBN: 978-3-031-29927-8
eBook Packages: Computer ScienceComputer Science (R0)