Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries (bibtex)
by Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Reference:
Verification of Randomized Consensus Algorithms Under Round-Rigid AdversariesNathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder30th International Conference on Concurrency Theory (CONCUR 2019) (Wan Fokkink, Rob van Glabbeek, eds.), volume 140 of Leibniz International Proceedings in Informatics (LIPIcs), pages 33:1-33:15, 2019, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
Bibtex Entry:
@InProceedings{bertrand_et_al:LIPIcs:2019:10935,
  author =	{Nathalie Bertrand and Igor Konnov and Marijana Lazic and Josef Widder},
  title =	{{Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{33:1--33:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Wan Fokkink and Rob van Glabbeek},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10935},
  URN =		{urn:nbn:de:0030-drops-109358},
  doi =		{10.4230/LIPIcs.CONCUR.2019.33},
  annote =	{Keywords: threshold automata, counter systems, parameterized verification, randomized distributed algorithms, Byzantine faults}
}
Powered by bibtexbrowser