Gossiping, Asynchronous Automata and Zielonka's Theorem

@inproceedings{Sohoni1994GossipingAA,
  title={Gossiping, Asynchronous Automata and Zielonka's Theorem},
  author={Milind A. Sohoni},
  year={1994}
}
In this paper, we rst tackle a natural problem from distributed computing, involving time-stamps. We then show that our solution to this problem can be applied to provide a simpliied proof of Zielonka's theorem|a fundamental result in the theory of concurrent systems. Let P = fp 1 ; p 2 ; : : : ; p N g be a set of computing agents or processes which synchronize with each other from time to time and exchange information about themselves and others. The gossip problem is the following: Whenever a… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
14 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

On the complementation of B uchi asynchronous cellular automata

  • A Mus, Muscholl
  • Proc. ICALP
  • 1994

Recognizable trace languages and asynchronous automata, Phd Thesis, Dip

  • G Pig, Pighizzini
  • Scienze dell'Informazione, Univ. di Milano
  • 1993

Thiagarajan: TrPTL: A trace based extension of linear time temporal logic, to appear in Proc

  • P S Thi
  • IEEE LICS
  • 1993

Zielonka: Asynchronous mappings and asynchronous cellular automata

  • Cmz, R Cori, Y Metivier
  • Inform. and Comput
  • 1993

Asynchronous cellular automata for innnite traces

  • Gp, P Gastin, A Petit
  • Proc. ICALP '92
  • 1992

Similar Papers

Loading similar papers…