Showing 2024Show all
3 papers · 1 filter
cs.FL2024
The Black Ninjas and the Sniper: On Robustness of Population Protocols
Benno Lossin, Philipp Czerner, Javier Esparza +2
Population protocols are a model of distributed computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs to decide some property of their…
cs.DC2024
Breaking through the -space barrier: Population Protocols Decide Double-exponential Thresholds
Philipp Czerner
Population protocols are a model of distributed computation in which finite-state agents interact randomly in pairs. A protocol decides for any initial configuration whether it sat…
cs.FL2024
Computing Inductive Invariants of Regular Abstraction Frameworks
Philipp Czerner, Javier Esparza, Valentin Krasotin +1
Regular transition systems (RTS) are a popular formalism for modeling infinite-state systems in general, and parameterised systems in particular. In a CONCUR 22 paper, Esparza et a…