Pages that link to "Item:Q3426554"
From MaRDI portal
The following pages link to Introduction to Discrete Event Systems (Q3426554):
Displaying 50 items.
- Opacity of networked discrete event systems (Q2053901) (← links)
- Detectability verification of probabilistic Boolean networks (Q2056383) (← links)
- Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches (Q2058490) (← links)
- Supervisor synthesis and throughput optimization of partially-controllable manufacturing systems (Q2058495) (← links)
- Nonblocking and deterministic decentralized control for networked discrete event systems under communication delays (Q2058568) (← links)
- Compositional coordinator synthesis of extended finite automata (Q2058570) (← links)
- Three kinds of coprognosability for partially-observed discrete event systems via a matrix approach (Q2060855) (← links)
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets (Q2060875) (← links)
- Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems (Q2061133) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- Optimal modular control of discrete event systems with distinguishers and approximations (Q2063103) (← links)
- Design of supervisors for linear marking specifications in labeled Petri nets (Q2063788) (← links)
- Enforcing current-state opacity through shuffle and deletions of event observations (Q2065172) (← links)
- Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers (Q2065174) (← links)
- Usability aware secret protection with minimum cost (Q2074757) (← links)
- Diagnosability verification using LTL model checking (Q2081084) (← links)
- Optimization-based assessment of initial-state opacity in Petri nets (Q2089626) (← links)
- Dealing with sensor and actuator deception attacks in supervisory control (Q2103716) (← links)
- Using subobservers to synthesize opacity-enforcing supervisors (Q2106417) (← links)
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems (Q2123401) (← links)
- Robust decentralized diagnosability of networked discrete event systems against DoS and deception attacks (Q2123407) (← links)
- Enforcement for infinite-step opacity and K-step opacity via insertion mechanism (Q2125498) (← links)
- \(K\)-loss robust codiagnosability of discrete-event systems (Q2125509) (← links)
- A framework for current-state opacity under dynamic information release mechanism (Q2125535) (← links)
- An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems (Q2127112) (← links)
- Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection (Q2128087) (← links)
- Hierarchical planning in a supervisory control context with compositional abstraction (Q2128088) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Modular control of discrete-event systems using similarity (Q2151956) (← links)
- On the state liveness of some classes of guidepath-based transport systems and its computational complexity (Q2173958) (← links)
- Coordinated static control of asynchronous sequential machines (Q2173968) (← links)
- A controller synthesis framework for automated service composition (Q2177764) (← links)
- Time-optimal control of large-scale systems of systems using compositional optimization (Q2177769) (← links)
- Causality analysis and fault ascription in component-based systems (Q2193287) (← links)
- Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction (Q2197579) (← links)
- Information control in networked discrete event systems and its application to battery management systems (Q2197580) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Modeling for supervisor synthesis -- a lock-bridge combination case study (Q2197591) (← links)
- Algorithms for approximate subtropical matrix factorization (Q2218339) (← links)
- A general approach for optimizing dynamic sensor activation for discrete event systems (Q2280709) (← links)
- Discrete event system identification with the aim of fault detection (Q2286331) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Supervisory control of discrete-event systems under attacks (Q2292112) (← links)
- Matrix approach to detectability of discrete event systems (Q2316509) (← links)
- A simple fault tolerant control for input/output asynchronous sequential machines (Q2342754) (← links)
- A branch and bound approach for the design of decentralized supervisors in Petri net models (Q2342792) (← links)
- Multi-intersection traffic light control with blocking (Q2348355) (← links)
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks (Q2348357) (← links)
- Coordination control of discrete-event systems revisited (Q2348358) (← links)
- A hierarchical and modular control architecture for sequential behaviours (Q2348360) (← links)
