activity
20112022
most citedRefinement Modal Logic

33 citations · 65 across the 13 of their papers we have counts for

collaborators

15 papers

cs.GT2022★ 3 cited

Adversarial Formal Semantics of Attack Trees and Related Problems

Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko

Security is a subject of increasing attention in our actual society in order to protect critical resources from information disclosure, theft or damage. The informal model of attac…

cs.LO2022

On the Role of Postconditions in Dynamic First-Order Epistemic Logic

Côme Neyrand, Sophie Pinchinat

Dynamic Epistemic Logic (DEL) is a logic that models information change in a multi-agent setting through the use of action models with pre- and post-conditions. In a recent work, D…

cs.FL2020

Alternating Tree Automata with Qualitative Semantics

Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot +7

We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a r…

cs.LO2020★ 1 cited

Dynamic Epistemic Logic Games with Epistemic Temporal Goals

Bastien Maubert, Aniello Murano, Sophie Pinchinat +2

Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games wer…

cs.CC2019★ 2 cited

The Packed Interval Covering Problem is NP-complete

Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat +1

We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.

cs.LO2019

Reachability Games in Dynamic Epistemic Logic

Bastien Maubert, Sophie Pinchinat, François Schwarzentruber

We define reachability games based on Dynamic Epistemic Logic (DEL), where the players' actions are finely described as DEL action models. We first consider the setting where an ex…