Verification of Inference Observability in Supervisory Control of Discrete-Event Systems
Résumé
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.
Domaines
Génie logiciel [cs.SE]Origine | Fichiers produits par l'(les) auteur(s) |
---|