SNS CAN BE MODALLY CHARACTERIZED

被引：3

作者：

HUTTEL, H

机构：

[1] Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh

来源：

关键词：

D O I：

10.1016/0304-3975(90)90140-D

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：239 / 248

页数：10

共 11 条

[1] PRESERVATION OF EXPRESSIVE COMPLETENESS IN TEMPORAL MODELS [J].

AMIR, A ;

GABBAY, DM .

[2] THE TEMPORAL LOGIC OF BRANCHING TIME [J].

BENARI, M ;

PNUELI, A ;

MANNA, Z .

[3]

BROWNE MC, 1987, CMUCS87104 CARN MELL

[4]

HAFER T, 1984, LECTURE NOTES COMPUT, V267, P269

[5] RESULTS ON THE PROPOSITIONAL MU-CALCULUS [J].

KOZEN, D .

[6]

Milner R., 1989, Communication and concurrency

[7]

NIWINSKI D, 1988, 3RD P S LOG COMP SCI

RABIN, MO .

[9]

STREET RS, 1984, LECTURE NOTES COMPUT, V267, P465

[10] TEMPORAL LOGIC CAN BE MORE EXPRESSIVE [J].

WOLPER, P .

INFORMATION AND CONTROL, 1983, 56 (1-2) :72-99