Showing cs.FLShow all
3 papers · 1 filter
cs.FL2025
Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
Flavio T. Principato, Javier Esparza, Philipp Czerner
Esparza and Reiter have recently conducted a systematic comparative study of weak asynchronous models of distributed computing, in which a network of identical finite-state machine…
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.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…