Syntactic approach to the deadlock detection problem

CompEuro 1992 Proceedings Computer Systems and Software Engineering Pub Date : 1992-05-04 DOI:10.1109/CMPEUR.1992.218430

J.R. Gonzalez de Mendivil, J. R. Garitagoitia

引用次数: 0

Abstract

A method for solving the deadlock detection problem in operating systems with single unit resources is introduced by using the formalism of the automata and languages theory. The waiting relations between processes are represented in a wait-string. The study of the properties of wait-strings which contain deadlocked processes allows a solution to be obtained for the deadlock detection problem in the form of a finite automation (FA). The designed FA, which accepts the wait-strings with deadlock, acts as a deadlock detection algorithm. Its performance is proved. The design method of the FA is itself a detection algorithm based on the same principles. Therefore its formal proof is also valid, and can be used when strong memory requirements are imposed.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

死锁检测问题的语法方法

利用自动机的形式化理论和语言理论，提出了一种解决单单元资源操作系统死锁检测问题的方法。进程之间的等待关系用等待字符串表示。通过对包含死锁进程的等待字符串的性质的研究，可以得到以有限自动化(FA)形式的死锁检测问题的解决方案。设计的FA作为死锁检测算法，接受带有死锁的等待字符串。验证了其性能。FA的设计方法本身就是一种基于相同原理的检测算法。因此，它的形式证明也是有效的，并且可以在施加强内存要求时使用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

CompEuro 1992 Proceedings Computer Systems and Software Engineering

自引率

0.00%

发文量

期刊最新文献

Neural clustering algorithms for classification and pre-placement of VLSI cells General-to-specific learning of Horn clauses from positive examples Minimization of NAND circuits by rewriting-rules heuristic A generalized stochastic Petri net model of Multibus II Activation of connections to accelerate the learning in recurrent back-propagation