A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Kacprzak, Magdalena; Penczek, Wojciech

doi:10.1007/s11229-004-2446-8

Cited by 14 publications

(17 citation statements)

References 25 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An interested reader is referred to [13] for an overview, and to [9,17,20,24,42,48,57,59] for more specific results; some attempts at taming the complexity were proposed e.g. in [18,23,38,46,47]. Studies on other decision problems than model checking were much less frequent, though satisfiability of the basic variant of ATL has been investigated in [30,31,54,64].…”

Section: Related Workmentioning

confidence: 99%

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents' abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics.

show abstract

Section: Related Workmentioning

confidence: 99%

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

show abstract

“…In a similar way, Kacprzak et al [29] have investigated the problem of verifying epistemic properties using CTLK by means of an unbounded model checking algorithm. Kacprzak and Penczek [28] have addressed the problem of verifying game-like structures by means of unbounded model checking. Recently, Cohen et al [16] have introduced a new abstraction-based model checking technique for MASs aiming at saving representation space and verification time.…”

Section: Developing New Algorithms and Toolsmentioning

confidence: 99%

Model Checking Agent Communication

Bentahar¹,

Meyer

Wang³

2010

Specification and Verification of Multi-Agent Systems

View full text Add to dashboard Cite

Abstract. Model checking is a formal and automatic technique used to verify computational systems (e.g. communication protocols) against given properties. The purpose of this chapter is to describe a model checking algorithm to verify communication protocols used by autonomous agents interacting using dialogue games, which are governed by a set of logical rules. We use a variant of Extended Computation Tree Logic CTL* for specifying these dialogue games and the properties to be checked. This logic, called ACTL*, extends CTL* by allowing formulae to constrain actions as well as states. The verification method uses an on-the-fly efficient algorithm. It is based on translating formulae into a variant of alternating tree automata called Alternating Büchi Tableau Automata (ABTA). We present a tableau-based version of this algorithm and provide the soundness, completeness, termination and complexity results. Two case studies are discussed along with their respective implementations to illustrate the proposed approach. The first one is about an agent-based negotiation protocol and the second one considers a modified version of the NetBill protocol.

show abstract

“…On the other hand, there have been recently several new approaches to model checking of temporal logics of knowledge: CTLK [12,23,25,17], CTLKD [31,28,27], TCTLKD [32],and an epistemic extension of ATL [19,20,16].…”

Section: Related Workmentioning

confidence: 99%

Model checking for multivalued logic of knowledge and time

Konikowska

Penczek

2006

Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems

View full text Add to dashboard Cite

We present a multivalued µK-calculus, an expressive logic to specify knowledge and time in multi-agent systems. We show that the general method of translation [22] from multivalued to two-valued De Morgan algebras can be extended to mv µK-calculus model checking. This way can we reduce the model checking problem for mv µK-calculus to several instances of the model checking problem for two-valued µK-calculus. As a result, properties involving mv µK-calculus or its subsets, like mv CTLK or mv CTL * K, can be verified using any of the available model checking algorithms. Three simple examples are shown to exemplify possible applications of multivalued logics of knowledge and time.

show abstract

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Cited by 14 publications

References 25 publications

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Model Checking Agent Communication

Model checking for multivalued logic of knowledge and time

Contact Info

Product

Resources

About