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

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 54卷 / 01期

关键词：

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

共 50 条

[41] Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Kobayashi, Naoki
Ong, C. -H. Luke
AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 223 - +
[42] Model checking the full modal mu-calculus for infinite sequential processes
Burkart, O
Steffen, B
AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 419 - 429
[43] Transfinite extension of the Mu-calculus
Bradfield, J
Duparc, J
Quickert, S
COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 384 - 396
[44] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 348 - 359
[45] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 333 - 354
[46] A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Büchi Register Automata
Takata, Yoshiaki
Onishi, Akira
Senda, Ryoma
Seki, Hiroyuki
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107 (12) : 1529 - 1532
[47] Mu-calculus path checking
Markey, N
Schnoebelen, P
INFORMATION PROCESSING LETTERS, 2006, 97 (06) : 225 - 230
[48] THE PROPOSITIONAL MU-CALCULUS IS ELEMENTARY
STREETT, RS
EMERSON, EA
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 465 - 472
[49] Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants
Hella, Lauri
Kuusisto, Antti
Ronnholm, Raine
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (326): : 82 - 96
[50] CTL-ASTERISK AND ECTL-ASTERISK AS FRAGMENTS OF THE MODAL MU-CALCULUS
DAM, M
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 581 : 145 - 164

← 1 2 3 4 5 →