52 citations · 267 across the 47 of their papers we have counts for
5 papers · 1 filter
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…
Population Protocols: Beyond Runtime Analysis
Javier Esparza
I survey our recent work on the verification of population protocols and their state complexity.
Computing Parameterized Invariants of Parameterized Petri Nets
Javier Esparza, Mikhail Raskin, Christoph Welzel
A fundamental advantage of Petri net models is the possibility to automatically compute useful system invariants from the syntax of the net. Classical techniques used for this are…
Decision Power of Weak Asynchronous Models of Distributed Computing
Philipp Czerner, Roland Guttenberg, Martin Helfrich +1
Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that coopera…
Lower Bounds on the State Complexity of Population Protocols
Philipp Czerner, Javier Esparza, Jérôme Leroux
Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stab…