The Complexity of Bounded Synthesis for Timed Control with Partial Observability

DOI10.1007/978-3-642-33365-1_15zbMath1375.68035OpenAlexW1855807124MaRDI QIDQ4649397

Bernd Finkbeiner, Hans-Jörg Peter

Publication date: 21 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33365-1_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)