Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Stably Computable Predicates are Semilinear Dana Angluin, James Aspnes and David Eisenstat
 

Summary: Stably Computable Predicates are Semilinear
Dana Angluin, James Aspnes and David Eisenstat
1
Population Protocols
Introduced by [Angluin, Aspnes, Diamadi, Fischer and Peralta,
PODC '04].
Anonymous, finite-state agents
Pairwise (ordered) interactions scheduled by a faira
adversary
No faults (but see [Delporte-Gallet, Fauconnier, Guerraoui and
Ruppert, DCOSS '06])
No termination, stabilizing outputs
Similar models used to study epidemics, chemical reactions.
aAny configuration reachable infinitely often is reached infinitely often.
2
Example: Leader Election
States are {leader, follower}. When two agents in state leader
interact, one switches to follower.
If all agents start in state leader, eventually only one remains.
3

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences