A New Verification Algorithm for Inferencing in Supervisory Control of Discrete-Event Systems
Résumé
We present a new algorithm to verify inference observability in supervisory control of decentralized discrete-event systems. The algorithm’s success relies on the following idea. An inferencing solution exists only when a language contains no inferencing cycles. When there are no cycles, the algorithm computes the smallest upper bound for an inferencing solution.
Domaines
Génie logiciel [cs.SE]Origine | Fichiers produits par l'(les) auteur(s) |
---|