DETERMINISTIC PROPOSITIONAL DYNAMIC LOGIC - FINITE-MODELS, COMPLEXITY, AND COMPLETENESS

被引：24

作者：

BENARI, M ^{[1
]}

HALPERN, JY ^{[1
]}

PNUELI, A ^{[1
]}

机构：

[1] HARVARD UNIV,DEPT MATH,CAMBRIDGE,MA 02138

来源：

关键词：

D O I：

10.1016/0022-0000(82)90018-6

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：402 / 417

页数：16

共 11 条

[1] PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS
FISCHER, MJ
LADNER, RE
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 194 - 211
[2] FISCHER MJ, 1977, 9TH P ANN ACM S THEO, P286
[3] AN ELEMENTARY PROOF OF THE COMPLETENESS OF PDL
KOZEN, D
PARIKH, R
[J]. THEORETICAL COMPUTER SCIENCE, 1981, 14 (01) : 113 - 118
[4] PARIKH R, 1978, MITLCSTM112 TECHN RE
[5] PARIKH R, 1980, 7TH P ACM S PRINC PR, P186
[6] Pratt V. R., 1979, 20th Annual Symposium of Foundations of Computer Science, P115, DOI 10.1109/SFCS.1979.24
[7] Pratt V.R., 1976, FOCS, P109, DOI [10.1109/SFCS.1976.27, DOI 10.1109/SFCS.1976.27]
[8] A NEAR-OPTIMAL METHOD FOR REASONING ABOUT ACTION
PRATT, VR
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (02) : 231 - 254
[9] PRATT VR, 1977, 10TH ACM S THEOR COM, P326
[10] Segerberg Krister, 1977, NOT AM MATH SOC, V24, pA