Polynomial Time Decidability of Weighted Synchronization under Partial Observability

DOI10.4230/LIPIcs.CONCUR.2015.142zbMath1374.68260OpenAlexW2213301192MaRDI QIDQ5357700

Jan Křetínský, Simon Laursen, Kim Guldstrand Larsen, Jiří Srba

Publication date: 12 September 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2015.142

zbMATH Keywords

complexitysynchronizationpartial observabilityweighted automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Synchronizing deterministic push-down automata can be really hard ⋮ The complexity of synchronizing Markov decision processes

This page was built for publication: Polynomial Time Decidability of Weighted Synchronization under Partial Observability