Pages that link to "Item:Q1801642"
From MaRDI portal
The following pages link to Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage (Q1801642):
Displaying 10 items.
- Formulas for calculating supremal controllable and normal sublanguages (Q752649) (← links)
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation (Q1108988) (← links)
- Maximizing robustness of supervisors for partially observed discrete event systems. (Q1428152) (← links)
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication (Q1686848) (← links)
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control (Q2503503) (← links)
- On computation of supremal controllable, normal sublanguages (Q2504587) (← 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)
- The infimal controllable and N-observable superpredicate of a given predicate (Q4850257) (← links)
- Characterization of co-observable languages and formulas for their super/sublanguages (Q5274029) (← links)