TEMPORAL LOGIC CAN BE MORE EXPRESSIVE

被引：323

作者：

WOLPER, P ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

INFORMATION AND CONTROL | 1983年 / 56卷 / 1-2期

关键词：

D O I：

10.1016/S0019-9958(83)80051-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：72 / 99

页数：28

共 25 条

[1]

BENARI M, 1981, 8TH ANN ACM S PRINC, P164

COHEN, RS ;

GOLD, AY .

[3]

EMERSON EA, 1980, LECT NOTES COMPUT SC, V85, P169

[4]

Gabbay D., 1980, POPL 80 PROC 7 ACM S, P163, DOI [10.1145/567446.567462, DOI 10.1145/567446.567462]

[5]

HABERMANN AN, 1975, PATH EXPRESSIONS

[6]

Halpern J. Y., 1981, 22nd Annual Symposium on Foundations of Computer Science, P322, DOI 10.1109/SFCS.1981.49

[7]

Harel D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P310, DOI 10.1109/SFCS.1981.38

[8]

Harel D., 1980, 21st Annual Symposium on Foundations of Computer Science, P129, DOI 10.1109/SFCS.1980.35

[9]

HAREL D, 1979, LECTURE NOTES COMPUT, V68

[10]

Kamp J.A.W., 1968, THESIS U CALIFORNIA