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.
Originalsprog | Engelsk |
---|---|
Titel | 26th International Conference on Concurrency Theory (CONCUR 2015) |
Redaktører | Luca Aceto, David de Frutos Escrig |
Antal sider | 13 |
Udgivelsessted | Germany |
Forlag | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Publikationsdato | 2015 |
Sider | 142-154 |
ISBN (Trykt) | 978-3-939897-91-0 |
DOI | |
Status | Udgivet - 2015 |
Begivenhed | 26th International Conference on Concurrency Theory - Madrid, Spanien Varighed: 1 sep. 2015 → 4 sep. 2015 Konferencens nummer: 26 |
Konference
Konference | 26th International Conference on Concurrency Theory |
---|---|
Nummer | 26 |
Land/Område | Spanien |
By | Madrid |
Periode | 01/09/2015 → 04/09/2015 |
Navn | Leibniz International Proceedings in Informatics |
---|---|
Vol/bind | 42 |
ISSN | 1868-8969 |