Performance safety enforcement in strongly connected timed event graphs
From MaRDI portal
Publication:2021327
DOI10.1016/j.automatica.2021.109605zbMath1461.93307OpenAlexW3151737739MaRDI QIDQ2021327
Publication date: 26 April 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109605
Uses Software
Cites Work
- Unnamed Item
- Active fault tolerant control of discrete event systems using online diagnostics
- Supervisory control of \((\max,+)\) automata: a behavioral approach
- An integrated control strategy to solve the disturbance decoupling problem for max-plus linear systems with applications to a high throughput screening system
- Detection and mitigation of classes of attacks in supervisory control systems
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Supervisor synthesis to thwart cyber attack with bounded sensor reading alterations
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Decidability of opacity verification problems in labeled Petri net systems
- State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions
- Properties and performance bounds for timed marked graphs
- Synthesis of Maximally Permissive Nonblocking Supervisors for the Lower Bound Containment Problem
- Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions
- Design of Supervisors for Active Diagnosis in Discrete Event Systems
- Firing rate optimization of cyclic timed event graphs by token allocations
This page was built for publication: Performance safety enforcement in strongly connected timed event graphs
