conference paper published yes Jan Kretinsky author 44CEF464-F248-11E8-B48F-1D18A9856A870000-0002-8122-2881 Kim Larsen author Simon Laursen author Jiří Srba author ToHe department KrCh department CONCUR: Concurrency Theory Quantitative Reactive Modeling project Rigorous Systems Engineering project Formal methods for the design and analysis of complex systems project International IST Postdoc Fellowship Programme project 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. https://research-explorer.ista.ac.at/download/1499/4672/IST-2016-498-v1+1_32.pdf application/pdfno Schloss Dagstuhl - Leibniz-Zentrum für Informatik2015Madrid, Spain eng 10.4230/LIPIcs.CONCUR.2015.142 42142 - 154 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> Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154. J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154. Kretinsky, J., Larsen, K., Laursen, S., &#38; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2015.142">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a> Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,” 42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2015.142">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>. Kretinsky, Jan, et al. <i>Polynomial Time Decidability of Weighted Synchronization under Partial Observability</i>. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2015.142">10.4230/LIPIcs.CONCUR.2015.142</a>. J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154. 14992018-12-11T11:52:22Z2025-04-15T06:26:02Z