Affiliations: Department of Electricity and Electronics, University of the Basque Country, Faculty of Sciences-Leioa, P.O.Box 644, 48080 Bilbao, Spain | Department of Information Systems and Computation, Polytechnic University of Valencia, Camino de Vera sn, P.O.Box 22012, 46020 Valencia, Spain | Telecom Paris, 46 rue Barrault, 75013 Paris, France
Note: [] This work has been supported by the research grant no. UPV 224.310-EA061193 of the University of the Basque Country and by CICYT grant TIC93-0304.
Abstract: In this paper we consider the problem of the distributed deadlock resolution. Starting from a high level specification of the problem and the resolution algorithm for a system with single request model, we provide successive levels of decreasing abstraction of the initial specification in order to achieve a solution in a complete distributed system. The successive refinements and the final distributed deadlock resolution algorithm are formaly described and proved by using the Input-Output Automata Model. The proposed solution is a modification of the algorithms in Mitchell and Merritt (1984) and Gonzalez de Mendívil et al. (1993) and preserves a similar message traffic to resolve a deadlock.
Keywords: distributed systems, distributed deadlocks, deadlock resolution, input-output automata model, single request model
DOI: 10.3233/INF-1995-6103
Journal: Informatica, vol. 6, no. 1, pp. 35-60, 1995
