A further study on weak Byzantine gathering of mobile agents

The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering start-up delays, i.e., the good agents may not wake...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1022; s. 114892
Hlavní autori:	Saxena, Ashish, Mondal, Kaushik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 29.12.2024
Predmet:	Anonymous graphs Byzantine faults Deterministic algorithm Gathering Mobile agents Byzantine faults Gathering Deterministic algorithm Anonymous graphs Mobile agents
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!