77 citations · 145 across the 23 of their papers we have counts for
10 papers · 1 filter
Deciding the synthesis problem for hybrid games through bisimulation
Catalin Dima, Mariem Hammami, Youssouf Oualhadj +1
Hybrid games are games played on a finite graph endowed with real variables which may model behaviors of discrete controllers of continuous systems. The synthesis problem for hybri…
Careful Autonomous Agents in Environments With Multiple Common Resources
Rodica Condurache, Catalin Dima, Madalina Jitaru +2
Careful rational synthesis was defined in (Condurache et al. 2021) as a quantitative extension of Fisman et al.'s rational synthesis (Fisman et al. 2010), as a model of multi-agent…
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…
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…
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…
The Expressive Power of Epistemic -Calculus
Cătălin Dima, Bastien Maubert, Sophie Pinchinat
While the -calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic -calculus does not subsume ATL with imperfect information (ATL)…