Supervisory control problem using symbolic bisimulation techniques

In this paper, we present methods for solving the basic supervisory control problem (SCP) using algorithms based on bisimulation techniques. Barrett et al. (1998) first presented the relations between bisimulation and controllability and provided algorithms for solving the SCP. We efficiently solve the same problem using the intentional labeled transition system, an implicit representation of automaton, relying on algebraic methods.