Talks and Poster Presentations (with Proceedings-Entry):
M Függer, J. Widder:
"Efficient Checking of Link-Reversal-Based Concurrent Systems";
Talk: International Conference on Concurrency Theory (CONCUR),
Newcaslte upon Tyne, UK;
- 2012-09-08; in: "CONCUR 2012 - Concurrency Theory",
Lecture Notes in Computer Science. Springer Verlag.,
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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.