Synchronizing Strategies under Partial Observability

DOI10.1007/978-3-662-44584-6_14zbMath1417.68129OpenAlexW1781878795MaRDI QIDQ3190117

Simon Laursen, Kim Guldstrand Larsen, Jiří Srba

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://vbn.aau.dk/da/publications/2e6cf33b-5451-40b2-b4d6-bbb48f1da422

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Synchronizing deterministic push-down automata can be really hard ⋮ Preimage problems for deterministic finite automata ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ The complexity of synchronizing Markov decision processes ⋮ Semicomputable points in Euclidean spaces

This page was built for publication: Synchronizing Strategies under Partial Observability