Common knowledge in well-structured perfect recall systems

被引：1

作者：

Garanina N.O. ^{[1
]}

机构：

[1] Ershov Institute of Informatic Systems, Siberian Branch, Russian Academy of Sciences, pr. Akad. Lavrent’eva 6, Novosibirsk

来源：

Automatic Control and Computer Sciences | 2014年 / 48卷 / 07期

基金：

俄罗斯基础研究基金会;

关键词：

logic of common knowledge; model checking; multiagent perfect recall systems; well-structured systems;

D O I：

10.3103/S0146411614070086

中图分类号：

学科分类号：

摘要：

In this paper, a model checking problem for the μPLCn logic of common knowledge and fixpoints in well-structured multiagent systems with perfect recall is investigated. It is shown that a synchronous perfect recall environment generated by a well-structured environment and provided with a special PRS order forms a well-structured environment. This implies that the model checking problem for the disjunctive fragment of μPLCn is decidable. © 2014, Allerton Press, Inc.

引用

页码：381 / 388

页数：7

共 3 条

[1] Termination and Boundedness for Well-Structured Pushdown Systems
Lei, Suhua
Cai, Xiaojuan
Ogawa, Mizuhito
2016 10TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE), 2016, : 22 - 29
[2] Comparing the expressive power of well-structured transition systems
Abdulla, Parosh Aziz
Delzanno, Giorgio
Van Begin, Laurent
COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2007, 4646 : 99 - +
[3] Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata
Cai, Xiaojuan
Ogawa, Mizuhito
FUNCTIONAL AND LOGIC PROGRAMMING, FLOPS 2014, 2014, 8475 : 336 - 352

← 1 →