मुक्त अभिगमComputer ScienceMathematics
DOI: 10.9746/jcmsi.1.307

tlooto सारांश

The problem of synthesizing a supervisor that enforces opacity in a maximally permissive way is addressed and a formula for computing the supremal sublanguage under some assumption on uncontrollable events is presented.

सारांश

सार उपलब्ध नहीं है।

साइटेशन फॉर्मेट

TAKAI, S.; OKA, Yusuke. A formula for the supremal controllable and opaque sublanguage arising in supervisory control. SICE Journal of Control Measurement and System Integration, 2008, 1: 307–311.