A decidable class of problems for control under partial observation

DOI10.1016/j.ipl.2005.04.011zbMath1177.93059OpenAlexW2019704274MaRDI QIDQ1041809

Sophie Pinchinat, Stéphane Riedweg

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.04.011

zbMATH Keywords

optimal controlformal methodstemporal logicspecification languagesupervisiondiscrete-events systems

Mathematics Subject Classification ID

Hierarchical systems (93A13) Discrete event control/observation systems (93C65) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Modal specifications for the control theory of discrete event systems ⋮ A GENERAL NOTION OF UNIFORM STRATEGIES ⋮ Compositional construction of most general controllers

Uses Software

• UMDES

Cites Work

• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Results on the propositional \(\mu\)-calculus
• On observability of discrete-event systems
• An automata theoretic decision procedure for the propositional mu- calculus
• Games for synthesis of controllers with partial observation.
• “Sometimes” and “not never” revisited
• Supervision of Infinite Behavior of Discrete-Event Systems
• An automata-theoretic approach to branching-time model checking
• Mathematical Foundations of Computer Science 2003
• The undecidability of the domino problem
• Rudiments of \(\mu\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decidable class of problems for control under partial observation