The Complexity of Bounded Synthesis for Timed Control with Partial Observability

DOI10.1007/978-3-642-33365-1_15MaRDI QIDQ4649397zbMATHOpenAlexFDO

Authors Hans-Jörg Peter, Bernd Finkbeiner

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

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

Recommendations

• On the complexity of bounded time reachability for piecewise affine systems
• Integer-complete synthesis for bounded parametric timed automata
• On the complexity of bounded time and precision reachability for piecewise affine systems
• On the synthesis of discrete controllers for timed systems
• Optimal controller synthesis for timed systems
• scientific article; zbMATH DE number 1973987
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
• The Complexity of Synthesis of b-Bounded Petri Nets
• Synthesis of bounded integer parameters for parametric timed reachability games
• Polynomial-time verification for bisimilarity control of partially observed nondeterministic discrete event systems with deterministic specifications

Cited in

(7)

• Controllers with minimal observation power (application to timed systems)
• scientific article; zbMATH DE number 2086417 (Why is no real title available?)
• On the complexity of bounded time and precision reachability for piecewise affine systems
• Control strategies for off-line testing of timed systems
• Timed control with partial observability.
• Counterexample-guided synthesis of observation predicates
• Template-based controller synthesis for timed systems

This page was built for publication: The Complexity of Bounded Synthesis for Timed Control with Partial Observability

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