---
res:
  bibo_abstract:
  - 'Consider a fully-connected synchronous distributed system consisting of n nodes,
    where up to f nodes may be faulty and every node starts in an arbitrary initial
    state. In the synchronous C-counting problem, all nodes need to eventually agree
    on a counter that is increased by one modulo C in each round for given C>1.
    In the self-stabilising firing squad problem, the task is to eventually guarantee
    that all non-faulty nodes have simultaneous responses to external inputs: if a
    subset of the correct nodes receive an external “go” signal as input, then all
    correct nodes should agree on a round (in the not-too-distant future) in which
    to jointly output a “fire” signal. Moreover, no node should generate a “fire”
    signal without some correct node having previously received a “go” signal as input.
    We present a framework reducing both tasks to binary consensus at very small cost.
    For example, we obtain a deterministic algorithm for self-stabilising Byzantine
    firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation
    and response time O(f), and message size O(log f). As our framework does not restrict
    the type of consensus routines used, we also obtain efficient randomised solutions.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Christoph
      foaf_name: Lenzen, Christoph
      foaf_surname: Lenzen
  - foaf_Person:
      foaf_givenName: Joel
      foaf_name: Rybicki, Joel
      foaf_surname: Rybicki
      foaf_workInfoHomepage: http://www.librecat.org/personId=334EFD2E-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-6432-6646
  bibo_doi: 10.1007/s00446-018-0342-6
  dct_date: 2018^xs_gYear
  dct_identifier:
  - UT:000475627800005
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Near-optimal self-stabilising counting and firing squads@
...