A decidable class of problems for control under partial observation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3959244 (Why is no real title available?)
- scientific article; zbMATH DE number 1759605 (Why is no real title available?)
- scientific article; zbMATH DE number 1383199 (Why is no real title available?)
- An automata theoretic decision procedure for the propositional mu- calculus
- An automata-theoretic approach to branching-time model checking
- Games for synthesis of controllers with partial observation.
- Mathematical Foundations of Computer Science 2003
- On observability of discrete-event systems
- Results on the propositional \(\mu\)-calculus
- Rudiments of \(\mu\)-calculus
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Supervision of Infinite Behavior of Discrete-Event Systems
- The undecidability of the domino problem
- “Sometimes” and “not never” revisited
Cited in
(3)
This page was built for publication: A decidable class of problems for control under partial observation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041809)