most citedReasoning about Intuitionistic Computation Tree Logic

1 citations · 1 across the 7 of their papers we have counts for

collaborators

7 papers

cs.FL2023

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

Francesco Belardinelli, Angelo Ferrando, Vadim Malvone

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 dev…

cs.MA2023

Scalable Verification of Strategy Logic through Three-valued Abstraction

Francesco Belardinelli, Angelo Ferrando, Wojciech Jamroga +2

The model checking problem for multi-agent systems against Strategy Logic specifications is known to be non-elementary. On this logic several fragments have been defined to tackle…

cs.LO20231 cited

Reasoning about Intuitionistic Computation Tree Logic

Davide Catta, Vadim Malvone, Aniello Murano

In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics c…

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.MA2023

Capacity ATL

Gabriel Ballot, Vadim Malvone, Jean Leneutre +1

Model checking strategic abilities was successfully developed and applied since the early 2000s to ensure properties in Multi-Agent System. In this paper, we introduce the notion o…

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…