88 citations · 281 across the 25 of their papers we have counts for
Showing 2021 · cs.LOShow all
2 papers · 2 filters
cs.LO2021
State Complexity of Protocols With Leaders
Jérôme Leroux
Population protocols are a model of computation in which an arbitrary number of anonymous finite-memory agents are interacting in order to decide by stable consensus a predicate. I…
cs.LO2021
The Reachability Problem for Petri Nets is Not Primitive Recursive
Jérôme Leroux
We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. Moreover in fixed dimension , we show…