[ main ] [ back ]

22/2012 : Efficient Checking of Link-reversal-based Concurrent Systems

RR Number
22/2012
Conference
CONCUR 2012
Author(s)
Matthias Fuegger, Josef Widder
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.
Bibtex
@techreport{FW12:Tech,
  author =       "Matthias Fuegger and Josef Widder",
  title =        "Efficient Checking of Link-reversal-based Concurrent Systems",
  institution =  "Technische Universit{\"a}t Wien, Institut f{\"u}r Technische Informatik",
  address =      "Treitlstr. 1-3/182-2, 1040 Vienna, Austria",
  type =         "Research Report",
  year =         "2012",
  number =       "22/2012"
}

@incollection{FW12:CONCUR,
year={2012},
isbn={978-3-642-32939-5},
booktitle={CONCUR 2012 – Concurrency Theory},
volume={7454},
series={Lecture Notes in Computer Science},
editor={Koutny, Maciej and Ulidowski, Irek},
doi={10.1007/978-3-642-32940-1_34},
title={Efficient Checking of Link-Reversal-Based Concurrent Systems},
url={http://dx.doi.org/10.1007/978-3-642-32940-1_34},
publisher={Springer Berlin Heidelberg},
author={Függer, Matthias and Widder, Josef},
pages={486-499}
}
Download
Get camera.pdf - Adobe PDF-format, (296.0342 KB; posted at July 09 2013; )

[ main ] [ back ]