Pages that link to "Item:Q2503503"
From MaRDI portal
The following pages link to Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control (Q2503503):
Displaying 15 items.
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
- A new class of supervisors for timed discrete event systems under partial observation (Q859740) (← links)
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication (Q1686848) (← links)
- Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems (Q2059364) (← links)
- Supervisory control of state-tree structures with partial observation (Q2200558) (← links)
- Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions (Q2224835) (← links)
- Estimate based limited lookahead supervisory control for closed language specifications (Q2275047) (← links)
- Supervisor localization of discrete-event systems under partial observation (Q2409225) (← links)
- On computation of supremal controllable, normal sublanguages (Q2504587) (← links)
- Optimal supervisory control with mean payoff objectives and under partial observation (Q2662323) (← links)
- Delay-robustness in distributed control of timed discrete-event systems based on supervisor localisation (Q2979535) (← 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)
- Supervisory Control with Partial Observations (Q5496922) (← links)
