Efficient Checking of Link-Reversal-Based Concurrent Systems
Link reversal is an algorithmic method with various applications. Originally proposed by Gafni and Bertsekas in 1981 for routing in radio networks, it has been later applied also to solve concurrency related problems as mutual exclusion, resource allocation, and leader election. For resource allocation, conflicts can be represented by conflict graphs, and link reversal algorithms work on these graphs to resolve conflicts. In this paper we establish that executions of link reversal algorithms on large graphs are similar (a notion which we make precise in the paper) to executions on smaller graphs. This similarity then allows to verify linear time temporal properties of large systems, by verifying a smaller one.
KeywordsModel Check Temporal Logic Linear Temporal Logic Concurrent System Kripke Structure
Unable to display preview. Download preview PDF.
- 2.Baier, C., Katoen, J.-P.: Principles of model checking. MIT Press (2008)Google Scholar
- 5.Busch, C., Surapaneni, S., Tirthapura, S.: Analysis of link reversal routing algorithms for mobile ad hoc networks. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 210–219 (2003)Google Scholar
- 8.Charron-Bost, B., Gaillard, A., Welch, J.L., Widder, J.: Routing without ordering. In: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 145–153 (2009)Google Scholar
- 12.Allen Emerson, E., Namjoshi, K.S.: Reasoning about rings. In: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 85–94 (1995)Google Scholar
- 15.Malpani, N., Welch, J.L., Vaidya, N.: Leader election algorithms for mobile ad hoc networks. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (2000)Google Scholar
- 16.Park, V.D., Scott Corson, M.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: 16th Conference on Computer Communications (Infocom), pp. 1405–1413 (April 1997)Google Scholar
- 18.Welch, J.L., Walter, J.E.: Link Reversal Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2011)Google Scholar