PROCESS LOGIC - EXPRESSIVENESS, DECIDABILITY, COMPLETENESS

被引：62

作者：

HAREL, D

KOZEN, D

PARIKH, R

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

[2] BOSTON UNIV,DEPT MATH,BOSTON,MA 02215

[3] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1016/0022-0000(82)90003-4

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：144 / 170

页数：27

共 34 条

[1]

ABRAHAMSON K, COMMUNICATION

[2]

BANACHOWSKI L, 1977, MATH F COMPUTER SCI

[3]

BENARI M, 1981, 8TH P C AUT LANG PRO

[4]

CHANDRA AK, 1981, 13TH P ACM S THEOR C

[5] PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS [J].

FISCHER, MJ ;

LADNER, RE .

[6]

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

[7]

GABBAY DM, 1977, AXIOMATIZATIONS LOGI

[8] 2 RESULTS ON PROCESS LOGIC [J].

HAREL, D .

[9]

HAREL D, 1979, LECTURE NOTES COMPUT, V68

[10]

KAMP HW, 1968, THESIS UCLA CALIFORN