Pages that link to "Item:Q752649"

The following pages link to Formulas for calculating supremal controllable and normal sublanguages (Q752649):

Displaying 32 items.

• Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
• Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator (Q553375) (← links)
• Extremal solutions of inequations over lattices with applications to supervisory control (Q672379) (← links)
• Opacity of discrete event systems and its applications (Q716123) (← links)
• Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
• On tolerable and desirable behaviors in supervisory control of discrete event systems (Q1180362) (← links)
• On nonconflicting languages that arise in supervisory control of discrete event systems (Q1186853) (← links)
• On controllability and normality of discrete event dynamical systems (Q1190393) (← links)
• Decentralized supervisory control of discrete event systems with nonhomogeneous control structure (Q1208142) (← links)
• Input/output discrete event processes and communication delays (Q1314850) (← links)
• On-line control of partially observed discrete event systems (Q1332442) (← 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)
• 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)
• The infimal prefix-closed and observable superlanguage of a given language (Q1814432) (← links)
• On optimal control of a class of partially observed discrete event systems (Q1858865) (← links)
• Supervisory control of discrete event systems (Q1922191) (← links)
• Supervisory control synthesis of discrete-event systems using a coordination scheme (Q1941245) (← links)
• Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies (Q2106413) (← links)
• Supervisory control of state-tree structures with partial observation (Q2200558) (← links)
• Estimate based limited lookahead supervisory control for closed language specifications (Q2275047) (← links)
• Robust nonblocking supervisory control of discrete-event systems under partial observation (Q2433426) (← links)
• Supervisory control of modular systems with global specification languages (Q2440703) (← links)
• Control of discrete-event systems with modular or distributed structure (Q2464943) (← links)
• On computation of supremal controllable, normal sublanguages (Q2504587) (← links)
• Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation (Q2563760) (← links)
• Supervisory Control with Complete Observations (Q5496921) (← links)
• Supervisory Control with Partial Observations (Q5496922) (← links)
• Coordination Control of Distributed Discrete-Event Systems (Q5496926) (← links)
• Logical models of discrete even systems: a comparative exposition (Q5955794) (← links)
• A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)