Supervisory control of state-tree structures with partial observation
From MaRDI portal
Publication:2200558
DOI10.1016/j.ins.2018.07.025zbMath1455.93118OpenAlexW2884266744MaRDI QIDQ2200558
Publication date: 22 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.07.025
Related Items (6)
Optimal Petri net supervisor synthesis for forbidden state problems using marking mask ⋮ Optimal supervisory control with mean payoff objectives and under partial observation ⋮ SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time ⋮ On the invariance property of reduced supervisors from the perspective of vector discrete-event systems ⋮ State-based fault diagnosis of discrete-event systems with partially observable outputs ⋮ Nonblocking supervisory control of state-tree structures with event forcing
Uses Software
Cites Work
- Distributed supervisory control of discrete-event systems with communication delay
- Formulas for calculating supremal controllable and normal sublanguages
- Petri net-based approach to short-term scheduling of crude oil operations with less tank requirement
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- Multi-level hierarchical interface-based supervisory control
- Statecharts: a visual formalism for complex systems
- On observability of discrete-event systems
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Why event observation: Observability revisited
- Games for synthesis of controllers with partial observation.
- Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- Deadlock recovery for flexible manufacturing systems modeled with Petri nets
- Coordination control of discrete-event systems revisited
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- On computation of supremal controllable, normal sublanguages
- Nonblocking supervisory control of state tree structures.
- A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
- Synthesis of Maximally Permissive Supervisors for Partially-Observed Discrete-Event Systems
- Nonblocking Supervisory Control of Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
- Supervisor Synthesis for Networked Discrete Event Systems With Communication Delays
- Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- A Learning-Based Synthesis Approach to the Supremal Nonblocking Supervisor of Discrete-Event Systems
- Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
- Static-state feedback control of discrete-event systems under partial observation
- Supervisor Localization: A Top-Down Approach to Distributed Control of Discrete-Event Systems
- Decentralized control and coordination of discrete-event systems with partial observation
- Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach
- Nonblocking Supervisory Control of State Tree Structures
- Predicates and predicate transformers for supervisory control of discrete event dynamical systems
- Exploiting symmetry of state tree structures for discrete-event systems with parallel components
This page was built for publication: Supervisory control of state-tree structures with partial observation
