Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus

被引：8

作者：

Dima, Catalin ^{[1
]}

Maubert, Bastien ^{[2
]}

Pinchinat, Sophie ^{[3
]}

机构：

[1] Univ Paris Est, LACL, UPEC, Creteil, France

[2] Univ Lorraine, CNRS, LORIA, Nancy, France

[3] Univ Rennes 1, IRISA, Rennes, France

来源：

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I | 2015年 / 9234卷

关键词：

MODEL-CHECKING; COMPLEXITY; KNOWLEDGE; TREES;

D O I：

10.1007/978-3-662-48057-1_14

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We revisit Janin and Walukiewicz's classic result on the expressive completeness of the modal mu-calculus w.r.t. MSO, when transition systems are equipped with a binary relation over paths. We obtain two natural extensions of MSO and the mu-calculus: MSO with path relation and the jumping mu-calculus. While "bounded-memory" binary relations bring about no extra expressivity to either of the two logics, "unbounded-memory" binary relations make the bisimulation-invariant fragment of MSO with path relation more expressive than the jumping mu-calculus: the existence of winning strategies in games with imperfect-information inhabits the gap.

引用

页码：179 / 191

页数：13

共 50 条

[1] Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
Dima, Catalin
Maubert, Bastien
Pinchinat, Sophie
[J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2018, 19 (03)
[2] A modal mu-calculus for durational transition systems
Seidl, H
[J]. 11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, : 128 - 137
[3] Sahlqvist Correspondence for Modal mu-calculus
Johan van Benthem
Nick Bezhanishvili
Ian Hodkinson
[J]. Studia Logica, 2012, 100 : 31 - 60
[4] On the proof theory of the modal mu-calculus
Studer T.
[J]. Studia Logica, 2008, 89 (3) : 343 - 363
[5] DUALITY AND THE COMPLETENESS OF THE MODAL MU-CALCULUS
AMBLER, S
KWIATKOWSKA, M
MEASOR, N
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 151 (01) : 3 - 27
[6] Local model-checking of modal Mu-calculus on acyclic Labeled Transition Systems
Mateescu, R
[J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANAYLSIS OF SYSTEMS, PROCEEDINGS, 2002, 2280 : 281 - 295
[7] Sahlqvist Correspondence for Modal mu-calculus
van Benthem, Johan
Bezhanishvili, Nick
Hodkinson, Ian
[J]. STUDIA LOGICA, 2012, 100 (1-2) : 31 - 60
[8] PROOF SYSTEMS FOR TWO-WAY MODAL MU-CALCULUS
Afshari, Bahareh
Enqvist, Sebastian
Leigh, Graham e.
Marti, Johannes
Venema, Yde
[J]. JOURNAL OF SYMBOLIC LOGIC, 2023,
[9] Characteristic mu-Calculus Formulas for Underspecified Transition Systems
Fecher, Harald
Steffen, Martin
[J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 128 (02) : 103 - 116
[10] Simple Probabilistic Extension of Modal Mu-Calculus
Liu, Wanwei
Song, Lei
Wang, Ji
Zhang, Lijun
[J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 882 - 888

← 1 2 3 4 5 →