Polynomial time decidability of weighted synchronization under partial observability LIPIcs Kretinsky, Jan ; https://orcid.org/0000-0002-8122-2881 Larsen, Kim Laursen, Simon Srba, Jiří ddc:000 ddc:003 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. Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/1499 https://research-explorer.ista.ac.at/download/1499/4672 Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2015.142">10.4230/LIPIcs.CONCUR.2015.142</a> eng info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.CONCUR.2015.142 info:eu-repo/semantics/openAccess