Verification of Inference Observability in Supervisory Control of Discrete-Event Systems
Abstract
We present a new algorithm to verify inference observability in supervisory control of decentralized discreteevent systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language does not contain any inferencing cycles.
Domains
Software Engineering [cs.SE]
Origin : Files produced by the author(s)