Games for synthesis of controllers with partial observation.
From MaRDI portal
Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Games involving graphs (91A43) Discrete event control/observation systems (93C65)
Recommendations
Cites work
- -calculus synthesis
- A polynomial algorithm for testing diagnosability of discrete-event systems
- A unified approach to control problems in discrete event processes
- Diagnosability of discrete-event systems
- Effective control synthesis for partially observed discrete-event systems
- Fast and simple nested fixpoints
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 781092 (Why is no real title available?)
- Introduction to discrete event systems
- On the synthesis of discrete controllers for timed systems
- State-strategies for games in Fσδ ∩ Gδσ
- The Complexity of Tree Automata and Logics of Programs
- Think globally, act locally: decentralized supervisory control
- Undecidable problems of decentralized observation and control on regular languages
Cited in
(60)- Approximately bisimilar symbolic models for nonlinear control systems
- A decidable class of problems for control under partial observation
- Controller synthesis for net condition/event systems with a solution for incomplete state observation
- Parity game reductions
- Control design for nondeterministic input/output automata
- Supervisory control and reactive synthesis: a comparative introduction
- Ambiguous classes in \(\mu\)-calculi hierarchies
- Modal event-clock specifications for timed component-based design
- Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface
- Approximately bisimilar symbolic model for switched systems with unstable subsystems
- Supervisory control of state-tree structures with partial observation
- Natural projection as partial model checking
- Synthesis of covert actuator attackers for free
- Dynamic control with indistinguishable events
- Control of discrete-event systems with modular or distributed structure
- Undecidability in decentralized supervision
- Synthesis of covert actuator and sensor attackers
- Two local strategy iteration schemes for parity game solving
- Automata and games for synthesis
- Nondeterministic controllers of nondeterministic processes
- Cooking Your Own Parity Game Preorders Through Matching Plays
- Synthesis for Structure Rewriting Systems
- Controller/orchestrator synthesis via filtration
- A comparison of BDD-based parity game solvers
- REASONING ABOUT TRANSFINITE SEQUENCES
- Symbolic models for time-varying time-delay systems via alternating approximate bisimulation
- Controller Synthesis with Budget Constraints
- Symbolic synthesis of finite-state controllers for request-response specifications
- On Distributed Program Specification and Synthesis in Architectures with Cycles
- Solving parity games in practice
- Branching-time logics with path relativisation
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- Controller synthesis for safety and reachability via approximate bisimulation
- Expressiveness and succinctness of a logic of robustness
- The modal transition system control problem
- The control of synchronous systems. II
- Permissive strategies: from parity games to safety games
- Improvement in small progress measures
- Controlling a population
- Maximally permissive controlled system synthesis for non-determinism and modal logic
- Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- Computer Science Logic
- CONCUR 2004 - Concurrency Theory
- Mathematical Foundations of Computer Science 2003
- Automata, Languages and Programming
- Timed modal logics for real-time systems. Specification, verification and control
- Branching time controllers for discrete event systems
- What's to come is still unsure. Synthesizing controllers resilient to delayed interaction
- Bisimilarity enforcing supervisory control of nondeterministic discrete event systems with nondeterministic specifications
- Decentralized control of infinite systems
- Finite-step approximately bi-similar symbolic model for switched systems
- Finite-step alternating approximately bi-similar symbolic model for Markov jump systems
- TSO games -- on the decidability of safety games under the total store order semantics
- Reachability and safety games under TSO semantics
- Synthesising full-information protocols
- Games with winning conditions of high Borel complexity
- Distributed synthesis for well-connected architectures
- Solvability of centralized supervisory control under partial observation
- Modal specifications for the control theory of discrete event systems
This page was built for publication: Games for synthesis of controllers with partial observation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401346)
