Polynomial time decidability of weighted synchronization under partial observability

DOI10.4230/LIPICS.CONCUR.2015.142MaRDI QIDQ5357700zbMATH OpenOpenAlexFDO

Authors Jan Křetínský, Simon Laursen, Kim G. Larsen, Jiří Srba

Publication date 12 September 2017

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

zbMATH Keywords

complexitypartial observabilitysynchronizationweighted 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)

Recommendations

• Synchronizing words for weighted and timed automata
• Synchronizing weighted automata
• What's decidable about weighted automata?
• On the complexity of synthesizing a minimum-weighted supervisor under partial observation
• On two algorithmic problems about synchronizing automata (short paper)

Cited in

(5)

• The complexity of synchronizing Markov decision processes
• Synchronizing words for weighted and timed automata
• Synchronizing strategies under partial observability
• Synchronizing weighted automata
• Synchronizing deterministic push-down automata can be really hard

This page was built for publication: Polynomial time decidability of weighted synchronization under partial observability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357700)