@inproceedings{1499,
  abstract     = {We consider weighted automata with both positive and negative integer weights on edges and
study the problem of synchronization using adaptive strategies that may only observe whether
the current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata.},
  author       = {Kretinsky, Jan and Larsen, Kim and Laursen, Simon and Srba, Jiří},
  location     = {Madrid, Spain},
  pages        = {142 -- 154},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Polynomial time decidability of weighted synchronization under partial observability}},
  doi          = {10.4230/LIPIcs.CONCUR.2015.142},
  volume       = {42},
  year         = {2015},
}