TESTING DEADLOCK-FREEDOM OF COMPUTER-SYSTEMS

被引：13

作者：

KAMEDA, T

机构：

来源：

关键词：

D O I：

10.1145/322186.322192

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：270 / 280

页数：11

共 24 条

[1]

[Anonymous], 1970, SOVIET MATH DOKL

[2]

Berge C., 1962, THEORY GRAPHS ITS AP

[3]

CHAMBERLIN D, 1974, 1974 P IFIP C STOCKH, P340

[4]

CHU WW, 1974, NOV P ACM ANN C SAN, P156

[5]

Coffman E. G., 1971, COMPUT SURV, V3, P67, DOI DOI 10.1145/356586.356588

[6] GAME INTERPRETATION OF DEADLOCK AVOIDANCE PROBLEM [J].

DEVILLERS, R .

[7]

Dijkstra E. W., 1968, Programming languages, P43

[8]

Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043

[9]

Ford Lester R., 1962, FLOWS NETWORKS

[10]

Galil Z., 1978, 19th Annual Symposium on Foundations of Computer Science, P231, DOI 10.1109/SFCS.1978.5