Detailed Information on Publication Record
2015
Polynomial Time Decidability of Weighted Synchronization under Partial Observability
KŘETÍNSKÝ, Jan, Kim Guldstrand LARSEN, Simon LAURSEN and Jiří SRBABasic information
Original name
Polynomial Time Decidability of Weighted Synchronization under Partial Observability
Authors
KŘETÍNSKÝ, Jan (203 Czech Republic, guarantor, belonging to the institution), Kim Guldstrand LARSEN (208 Denmark), Simon LAURSEN (208 Denmark) and Jiří SRBA (203 Czech Republic, belonging to the institution)
Edition
Dagstuhl, Germany, 26th International Conference on Concurrency Theory (CONCUR 2015), p. 142-154, 13 pp. 2015
Publisher
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Germany
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
electronic version available online
RIV identification code
RIV/00216224:14330/15:00081430
Organization unit
Faculty of Informatics
ISBN
978-3-939897-91-0
ISSN
Keywords in English
weighted automata; partial observability; synchronization; complexity
Tags
Tags
International impact, Reviewed
Změněno: 23/10/2017 12:43, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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.
Links
| GBP202/12/G061, research and development project |
|