An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information

Belardinelli, Francesco; Ferrando, Angelo; Malvone, Vadim

doi:10.1016/j.artint.2022.103847

Cited by 10 publications

(6 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The latter apply "automatic" abstraction and refinement methods to address state-explosion in the verification of system specifications. Such techniques have also been proposed for concurrent game structures and strategy logics, e.g., (Belardinelli, Ferrando, and Malvone 2023). The abstractions that these methods generate need not be meaningful to users of the system.…”

Section: Discussionmentioning

confidence: 99%

Abstraction of Situation Calculus Concurrent Game Structures

Lesperance,

De Giacomo,

Rostamigiv

et al. 2024

AAAI

View full text Add to dashboard Cite

We present a general framework for abstracting agent behavior in multi-agent synchronous games in the situation calculus, which provides a first-order representation of the state and allows us to model how plays depend on the data and objects involved. We represent such games as action theories of a special form called situation calculus synchronous game structures (SCSGSs), in which we have a single action "tick" whose effects depend on the combination of moves selected by the players. In our framework, one specifies both an abstract SCSGS and a concrete SCSGS, as well as a refinement mapping that specifies how each abstract move is implemented by a Golog program defined over the concrete SCSGS. We define notions of sound and complete abstraction with respect to a mapping over such SCSGS. To express strategic properties on the abstract and concrete games we adopt a first-order variant of alternating-time mu-calculus mu-ATL-FO. We show that we can exploit abstraction in verifying mu-ATL-FO properties of SCSGSs under the assumption that agents can always execute abstract moves to completion even if not fully controlling their outcomes.

show abstract

Section: Discussionmentioning

confidence: 99%

Abstraction of Situation Calculus Concurrent Game Structures

Lesperance,

De Giacomo,

Rostamigiv

et al. 2024

AAAI

View full text Add to dashboard Cite

show abstract

“…the memoryfull and perfect information case, and again undecidable in the memoryfull and imperfect information case. To address the latter problem, some works have either focused on an approximation to perfect information [3], developed notions of bounded memory [6], or employed hybrid techniques [14,15]. Despite its expressiveness, ATL * suffers from the strong limitation that strategies are treated only implicitly in the semantics of strategic operators.…”

Section: Model Checking Complexitiesmentioning

confidence: 99%

“…As discussed earlier in the paper, some approaches try to make some MAS with imperfect information decidable. However, the authors in [5,3,16] do not give a specific class of MAS with imperfect information that is decidable. Currently, only the class of hierarchical information has been proposed [25,24] and analyzed in SL [7].…”

Section: Future Directionsmentioning

confidence: 99%

The Impact of Strategies and Information in Model Checking for Multi-Agent Systems

Malvone

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

System correctness is one of the most crucial and challenging objectives in software and hardware systems. With the increasing evolution of connected and distributed systems, ensuring their correctness requires the use of formal verification for multi-agent systems. In this paper, we present a summary of certain results on model checking for multi-agent systems that derive from the selection of strategies and information for agents. Additionally, we discuss some open directions for future research.

show abstract

“…Indeed, our tool can be used in several works, such as [20,16,24,25], to provide results for the verification of three-valued LT L formulas. Furthermore, our tool is already used in [6]. In this work, the authors present an abstraction-refinement method to partially solve the model checking of multi-agent systems under imperfect information and perfect recall strategies.…”

Section: Introductionmentioning

confidence: 99%

3vLTL: A Tool to Generate Automata for Three-valued LTL

Belardinelli,

Ferrando,

Malvone

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multivalued specification languages. We present 3vLTL, a tool to generate Büchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Büchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Büchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.3vLTL: A Tool to Generate Automata for Three-valued LTL Semantics. Formally we define the three-valued semantics for LT L as follows. Definition 3 (Satisfaction) The three-valued satisfaction relation |= 3 for a Transition Model M, path p ∈ S ω , atom q ∈ AP, v ∈ {tt, ff}, and formula ϕ is defined as follows:for some j ≥ 1, ((M, p ≥ j ) |= 3 ψ) = ff, and for all j ′ , 1 ≤ j ′ ≤ j ⇒ ((M, p ≥ j ′ ) |= 3 ψ ′ ) = ff In all other cases the value of ϕ is uu.

show abstract

An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information

Cited by 10 publications

References 29 publications

Abstraction of Situation Calculus Concurrent Game Structures

Abstraction of Situation Calculus Concurrent Game Structures

The Impact of Strategies and Information in Model Checking for Multi-Agent Systems

3vLTL: A Tool to Generate Automata for Three-valued LTL

Contact Info

Product

Resources

About