5 papers · 1 filter
Model-checking parametric lock-sharing systems against regular constraints
Corto Mascle, Anca Muscholl, Igor Walukiewicz
In parametric lock-sharing systems processes can spawn new processes to run in parallel, and can create new locks. The behavior of every process is given by a pushdown automaton. W…
Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
Lucie Guillou, Corto Mascle, Nicolas Waldburger
We consider the parameterized verification of arbitrarily large networks of agents which communicate by broadcasting and receiving messages. In our model, the broadcast topology is…
Responsibility and verification: Importance value in temporal logics
Corto Mascle, Christel Baier, Florian Funke +2
We aim at measuring the influence of the nondeterministic choices of a part of a system on its ability to satisfy a specification. For this purpose, we apply the concept of Shapley…
Controlling a Random Population is EXPTIME-hard
Corto Mascle, Mahsa Shirmohammadi, Patrick Totzke
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achieve a reachability objective in games (on the same finite arena) simultaneou…
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
Corto Mascle, Martin Zimmermann
HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-cri…