A modal mu-calculus for durational transition systems

被引：3

|

作者：

Seidl, H ^{[1
]}

机构：

[1] UNIV TRIER,FB INFORMAT 4,D-54286 TRIER,GERMANY

来源：

11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 1996年

关键词：

D O I：

10.1109/LICS.1996.561312

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

下载

收藏

页码：128 / 137

页数：10

相关论文

共 50 条

[41] Model checking the full modal mu-calculus for infinite sequential processes
Burkart, O
Steffen, B
AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 419 - 429
[42] Transfinite extension of the Mu-calculus
Bradfield, J
Duparc, J
Quickert, S
COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 384 - 396
[43] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 348 - 359
[44] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 333 - 354
[45] Mu-calculus path checking
Markey, N
Schnoebelen, P
INFORMATION PROCESSING LETTERS, 2006, 97 (06) : 225 - 230
[46] THE PROPOSITIONAL MU-CALCULUS IS ELEMENTARY
STREETT, RS
EMERSON, EA
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 465 - 472
[47] CTL-ASTERISK AND ECTL-ASTERISK AS FRAGMENTS OF THE MODAL MU-CALCULUS
DAM, M
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 581 : 145 - 164
[48] 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
[49] CTL-ASTERISK AND ECTL-ASTERISK AS FRAGMENTS OF THE MODAL MU-CALCULUS
DAM, M
THEORETICAL COMPUTER SCIENCE, 1994, 126 (01) : 77 - 96
[50] Alternation-free modal mu-calculus for data trees (Extended abstract)
Jurdzinski, Marcin
Lazic, Ranko
22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2007, : 131 - +

← 1 2 3 4 5 →