Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1323251, author = {Křetínský, Jan and Larsen, Kim Guldstrand and Laursen, Simon and Srba, Jiří}, address = {Dagstuhl, Germany}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, doi = {http://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.142}, keywords = {weighted automata; partial observability; synchronization; complexity}, howpublished = {elektronická verze "online"}, language = {eng}, location = {Dagstuhl, Germany}, isbn = {978-3-939897-91-0}, pages = {142-154}, publisher = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik}, title = {Polynomial Time Decidability of Weighted Synchronization under Partial Observability}, year = {2015} }
TY - JOUR ID - 1323251 AU - Křetínský, Jan - Larsen, Kim Guldstrand - Laursen, Simon - Srba, Jiří PY - 2015 TI - Polynomial Time Decidability of Weighted Synchronization under Partial Observability PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany SN - 9783939897910 KW - weighted automata KW - partial observability KW - synchronization KW - complexity N2 - 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. ER -
KŘETÍNSKÝ, Jan, Kim Guldstrand LARSEN, Simon LAURSEN a Jiří SRBA. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Online. In \textit{26th International Conference on Concurrency Theory (CONCUR 2015)}. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015, s.~142-154. ISBN~978-3-939897-91-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.142.
|