DEADLOCK ABSENCE PROOFS FOR NETWORKS OF COMMUNICATING PROCESSES

被引：11

作者：

CHANDY, KM

MISRA, J

机构：

[1] Computer Sciences Department, University of Texas, Austin

来源：

基金：

美国国家科学基金会;

关键词：

deadlock avoidance; Processor networks; synchronisation;

D O I：

10.1016/0020-0190(79)90065-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：185 / 189

页数：5

共 5 条

[1] Chandy, Misra, An axiomatic proof technique for networks of communicating processes, Technical Report 98, (1978)
[2] Chandy, Misra, Proving temporal properties for networks of communicating processes, Technical Report, (1978)
[3] Chandy, Misra, Myers, Verman, Proofs of absence of deadlock in distributed programs and protocols, Technical Report, (1979)
[4] Hoare, Communicating sequential processes, Comm. ACM, 21, 8, pp. 666-677, (1978)
[5] Kahn, The semantics of a simple language for parallel programming, Information Processing, 74, pp. 471-475, (1974)