Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Obfuscated Consensus
James Aspnes, Shlomi Dolev, Amit Hendin
The classic Fischer, Lynch, and Paterson impossibility proof demonstrates that any deterministic protocol for consensus in either a message-passing or shared-memory system must vio…
cs.DC2025
Stochastic well-structured transition systems
James Aspnes
Extending well-structured transition systems to incorporate a probabilistic scheduling rule, we define a new class of stochastic well-structured transition systems that includes po…
cs.DC2024
Stably computable relations and predicates
James Aspnes
A population protocol stably computes a relation R(x,y) if its output always stabilizes and R(x,y) holds if and only if y is a possible output for input x. Alternatively, a populat…