activity
20192024
most citedTowards the Combination of Model Checking and Runtime Verification on Multi-Agent Systems

10 citations · 22 across the 13 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2023

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

Vadim Malvone

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, ensur…

cs.LO2022

Program Semantics and a Verification Technique for Knowledge-Based Multi-Agent Systems

Francesco Belardinelli, Ioana Boureanu, Vadim Malvone +1

We give a relational and a weakest precondition semantics for "knowledge-based programs", i.e., programs that restrict observability of variables so as to richly express changes in…

cs.LO2022

Model Checking Strategic Abilities in Information-sharing Systems

Francesco Belardinelli, Ioana Boureanu, Catalin Dima +1

We introduce a subclass of concurrent game structures (CGS) with imperfect information in which agents are endowed with private data-sharing capabilities. Importantly, our CGSs are…

cs.LO2022★ 10 cited

Towards the Combination of Model Checking and Runtime Verification on Multi-Agent Systems

Angelo Ferrando, Vadim Malvone

Multi-Agent Systems (MAS) are notoriously complex and hard to verify. In fact, it is not trivial to model a MAS, and even when a model is built, it is not always possible to verify…

cs.LO2020

A Hennessy-Milner Theorem for ATL with Imperfect Information

Francesco Belardinelli, Catalin Dima, Vadim Malvone +1

We show that a history-based variant of alternating bisimulation with imperfect information allows it to be related to a variant of Alternating-time Temporal Logic (ATL) with imper…

cs.LO2019

Model Checking ATL* on vCGS

Francesco Belardinelli, Catalin Dima, Ioana Boureanu +1

We prove that the model checking ATL* on concurrent game structures with propositional control for atom-visibility (vCGS) is undecidable. To do so, we reduce this problem to model…