ON MODAL MU-CALCULUS AND BUCHI TREE AUTOMATA

被引：4

作者：

KAIVOLA, R

机构：

[1] Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, EH9 3JZ, The King's Buildings

来源：

关键词：

FORMAL LANGUAGES; MODAL MU-CALCULUS; ALTERNATION; BUCHI-AUTOMATA;

D O I：

10.1016/0020-0190(94)00227-P

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：17 / 22

页数：6

共 11 条

[1] LOGICAL DEFINABILITY OF FIXED-POINTS [J].

ARNOLD, A .

[2]

ARNOLD A, 1990, J INFORM PROCESS CYB, V8, P451

[3]

DAM M, 1992, LECT NOTES COMPUT SC, V652, P39

[4]

Emerson E. A., 1986, Proceedings of the Symposium on Logic in Computer Science (Cat. No.86CH2321-8), P267

[5] SNS CAN BE MODALLY CHARACTERIZED [J].

HUTTEL, H .

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

KOZEN, D .

[7]

NIWINSKI D, 1986, LECT NOTES COMPUT SC, V226, P464

[8]

NIWINSKY D, 1988, 3RD P ANN S LOG COMP, P402

[9]

Rabin M. O., 1970, MATH LOGIC F SET THE, P1

[10]

STIRLING C, 1992, HDB LOGIC COMPUTER S, P477