THE TEMPORAL LOGIC OF BRANCHING TIME

被引:173
作者
BENARI, M
PNUELI, A
MANNA, Z
机构
[1] WEIZMANN INST SCI,DEPT APPL MATH,IL-76100 REHOVOT,ISRAEL
[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
关键词
D O I
10.1007/BF01257083
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:207 / 226
页数:20
相关论文
共 16 条
[1]  
ABRAHAMSON K, 1979, LECTURE NOTES COMPUT, V70, P21
[2]  
BENARI M, 1981, 8TH ANN ACM S PRINC, P164
[3]  
EMERSON AE, 1982, 14TH ACM S THEOR COM, P169
[4]   NONDETERMINISTIC ALGORITHMS [J].
FLOYD, RW .
JOURNAL OF THE ACM, 1967, 14 (04) :636-&
[5]  
Gabbay D., 1980, POPL 80 PROC 7 ACM S, P163, DOI [10.1145/567446.567462, DOI 10.1145/567446.567462]
[6]  
Harel D., 1980, 21st Annual Symposium on Foundations of Computer Science, P129, DOI 10.1109/SFCS.1980.35
[7]  
HAREL D, 1979, LECTURE NOTES COMPUT, V68
[8]  
KROGER A, 1977, IFIP WORKING C FORMA
[9]  
LAMPORT L, 1980, 7TH ANN ACM S PRINC, P174
[10]  
MANNA Z, 1979, LECTURE NOTES COMPUT, V79, P385