Paper Info
Title
Efficient checking of link-reversal-based concurrent systems
Abstract
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.
Year
DOI
Venue
2012
10.1007/978-3-642-32940-1_34
CONCUR
Keywords
Field
DocType
concurrency related problem,resource allocation,link-reversal-based concurrent system,conflict graph,leader election,link reversal algorithm,large system,link reversal,algorithmic method,efficient checking,smaller graph,large graph
Leader election,Kripke structure,Computer science,Concurrency,Linear temporal logic,Theoretical computer science,Resource allocation,Temporal logic,Time complexity,Mutual exclusion,Distributed computing
Conference
Volume
ISSN
Citations 
7454
0302-9743
1
PageRank 
References 
Authors
0.35
19
2
Name
Order
Citations
PageRank
Matthias Függer116721.14
Josef Widder222923.99