---
res:
  bibo_abstract:
  - "We consider weighted automata with both positive and negative integer weights
    on edges and\r\nstudy the problem of synchronization using adaptive strategies
    that may only observe whether\r\nthe current weight-level is negative or nonnegative.
    We show that the synchronization problem is decidable in polynomial time for deterministic
    weighted automata.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Jan
      foaf_name: Kretinsky, Jan
      foaf_surname: Kretinsky
      foaf_workInfoHomepage: http://www.librecat.org/personId=44CEF464-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-8122-2881
  - foaf_Person:
      foaf_givenName: Kim
      foaf_name: Larsen, Kim
      foaf_surname: Larsen
  - foaf_Person:
      foaf_givenName: Simon
      foaf_name: Laursen, Simon
      foaf_surname: Laursen
  - foaf_Person:
      foaf_givenName: Jiří
      foaf_name: Srba, Jiří
      foaf_surname: Srba
  bibo_doi: 10.4230/LIPIcs.CONCUR.2015.142
  bibo_volume: 42
  dct_date: 2015^xs_gYear
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Polynomial time decidability of weighted synchronization under partial
    observability@
...