@inproceedings{19deaf19d2164be7b8d265658b4616c1,
title = "Polynomial time decidability of weighted synchronization under partial observability",
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.",
keywords = "Complexity, Partial observability, Synchronization, Weighted automata",
author = "Jan K{\v r}et{\'i}nsk{\'y} and Larsen, {Kim Guldstrand} and Simon Laursen and Ji{\v r}{\'i} Srba",
note = "Publisher Copyright: {\textcopyright} Jan Kret{\'i}nsk{\'y}, Kim Guldstrand Larsen, Simon Laursen, and Jir{\'i} Srba; licensed under Creative Commons License CC-BY.; 26th International Conference on Concurrency Theory, CONCUR 2015 ; Conference date: 01-09-2015 Through 04-09-2015",
year = "2015",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.CONCUR.2015.142",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "142--154",
editor = "Luca Aceto and {de Frutos Escrig}, David",
booktitle = "26th International Conference on Concurrency Theory, CONCUR 2015",
}