activity
20092024
most citedAn Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

11 citations · 16 across the 8 of their papers we have counts for

collaborators
Showing cs.DCShow all

7 papers · 1 filter

cs.DC20211 cited

Abduction of trap invariants in parameterized systems

Javier Esparza, Mikhail Raskin, Christoph Welzel

In a previous paper we have presented a CEGAR approach for the verification of parameterized systems with an arbitrary number of processes organized in an array or a ring. The tech…

cs.DC2021

Population Protocols: Beyond Runtime Analysis

Javier Esparza

I survey our recent work on the verification of population protocols and their state complexity.

cs.DC2020

Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs

Javier Esparza, Martin Helfrich, Stefan Jaax +1

We present a new version of Peregrine, the tool for the analysis and parameterized verification of population protocols introduced in [Blondin et al., CAV'2018]. Population protoco…

cs.DC2019

Succinct Population Protocols for Presburger Arithmetic

Michael Blondin, Javier Esparza, Blaise Genest +2

Angluin et al. proved that population protocols compute exactly the predicates definable in Presburger arithmetic (PA), the first-order theory of addition. As part of this result,…

cs.DC2019

Expressive Power of Broadcast Consensus Protocols

Michael Blondin, Javier Esparza, Stefan Jaax

Population protocols are a formal model of computation by identical, anonymous mobile agents interacting in pairs. Their computational power is rather limited: Angluin et al. have…

cs.DC20153 cited

Model Checking Parameterized Asynchronous Shared-Memory Systems

Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty +1

We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes.…