Pages that link to "Item:Q2504587"
From MaRDI portal
The following pages link to On computation of supremal controllable, normal sublanguages (Q2504587):
Displaying 12 items.
- Formulas for calculating supremal controllable and normal sublanguages (Q752649) (← links)
- Characterizations and effective computation of supremal relatively observable sublanguages (Q1788694) (← links)
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage (Q1801642) (← links)
- Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis (Q2151821) (← links)
- Supervisory control of state-tree structures with partial observation (Q2200558) (← links)
- Supervisory control of switching control systems (Q2474450) (← links)
- Synthesis of covert actuator and sensor attackers (Q2665344) (← links)
- Distributed computation of supremal conditionally controllable sublanguages (Q2792732) (← links)
- A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages (Q2982862) (← links)
- New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage (Q4566940) (← links)
- Supervisory Control with Partial Observations (Q5496922) (← links)
- On the computation of natural observers in discrete-event systems (Q5962024) (← links)