Partial-order reduction in the weak modal mu-calculus

被引：0

作者：

Ramakrishna, YS ^{[1
]}

Smolka, SA ^{[1
]}

机构：

[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA

来源：

CONCUR'97 : CONCURRENCY THEORY | 1997年 / 1243卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that partial-order reduction can be highly effective in combating state explosion in modal mu-calculus model checking.

引用

页码：5 / 24

页数：20

共 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] On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus
Janin, D
Lenzi, G
FUNDAMENTA INFORMATICAE, 2004, 61 (3-4) : 247 - 265
[44] Transfinite extension of the Mu-calculus
Bradfield, J
Duparc, J
Quickert, S
COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 384 - 396
[45] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 348 - 359
[46] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
KOZEN, D
THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 333 - 354
[47] Stateful dynamic partial-order reduction
Yi, Xiaodong
Wang, Ji
Yang, Xuejun
FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2006, 4260 : 149 - +
[48] Stateful dynamic partial-order reduction
National Laboratory for Parallel and Distributed Processing, Changsha, China
Lect. Notes Comput. Sci., 2006, (149-167):
[49] Mu-calculus path checking
Markey, N
Schnoebelen, P
INFORMATION PROCESSING LETTERS, 2006, 97 (06) : 225 - 230
[50] THE PROPOSITIONAL MU-CALCULUS IS ELEMENTARY
STREETT, RS
EMERSON, EA
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 465 - 472

← 1 2 3 4 5 →