%0 Conference Proceedings
%F marchand00a
%A Marchand, H.
%A Pinchinat, S.
%T Supervisory Control Problem using Symbolic Bisimulation Techniques
%B 2000 American Control Conference
%P 4067-4071
%C Chicago, Illinois, USA
%X In this paper, we present methods for solving the basic Supervisory Control Problem (SCP) using algorithms based on bisimulation techniques. Barrett and Lafortune first presented the relations between bisimulation and controllability and provided algorithms for solving the SCP. We efficiently solve the same problem using Intensional Labeled Transition System (ILTS), an implicit representation of automaton, relying on algebraic methods
%U http://www.irisa.fr/vertecs/Publis/Ps/2000-ACC-Bisim.pdf
%8 June
%D 2000