A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A model for deadlock detection based on automata and languages theory
1993
Computers and Mathematics with Applications
In this paper, a model for solving the deadlock detection problem is introduced by using the formalism of the Automata and Languages Theory. The abstraction allows one to model the wait-for-relations between processes as a string of symbols. The set of wait-for-strings, which represent deadlock situations, is a regular language and it is accepted by a Finite Automaton (FA). The periodical algorithm for deadlock detection based on this FA has a linear time complexity O(N). This algorithm is
doi:10.1016/0898-1221(93)90298-a
fatcat:fu3iw4f325bifn32i2z5nem2fq