A PROOF RULE FOR FAIR TERMINATION OF GUARDED COMMANDS

被引：27
作者：
GRUMBERG, O [1 ]
FRANCEZ, N [1 ]
MAKOWSKY, JA [1 ]
DEROEVER, WP [1 ]
机构：
[1] STATE UNIV UTRECHT, VAKGRP INFORMAT, UTRECHT, NETHERLANDS
来源：
INFORMATION AND CONTROL | 1985年 / 66卷 / 1-2期
关键词：
D O I：
10.1016/S0019-9958(85)80014-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：83 / 102
页数：20
相关论文
共 23 条
[1]   FAIR TERMINATION REVISITED WITH DELAY [J].
APT, KR ;
PNUELI, A ;
STAVI, J .
THEORETICAL COMPUTER SCIENCE, 1984, 33 (01) :65-84
[2]   PROOF RULES AND TRANSFORMATIONS DEALING WITH FAIRNESS [J].
APT, KR ;
OLDEROG, ER .
SCIENCE OF COMPUTER PROGRAMMING, 1983, 3 (01) :65-100
[3]  
APT KR, 1981, JUL P INT C AUT LANG, P91
[4]  
DEROEVER WP, 1976, LECTURE NOTES COMPUT, V45
[5]  
Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
[6]  
Floyd R. W, 1967, MATH ASPECTS COMPUTE
[7]   PROOF METHOD FOR CYCLIC PROGRAMS [J].
FRANCEZ, N ;
PNUELI, A .
ACTA INFORMATICA, 1978, 9 (02) :133-157
[8]  
FRANCEZ N, 1980, FAIRNESS COMMUNICATI
[9]  
FRANCEZ N, 1984, JAN P ANN ACM S PRIN
[10]  
GABBAY D, 1980, 7TH P ACM S PRINC PR
123