Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
M Függer, J. Widder:
"Efficient Checking of Link-Reversal-Based Concurrent Systems";
Vortrag: International Conference on Concurrency Theory (CONCUR),
Newcaslte upon Tyne, UK;
03.09.2012
- 08.09.2012; in: "CONCUR 2012 - Concurrency Theory",
Lecture Notes in Computer Science. Springer Verlag.,
7454
(2012),
ISBN: 978-3-642-32939-5;
S. 486
- 499.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-32940-1_34
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.