This work deals with the supervisory control of discrete event systems (DES). Supervisory control is classically applied to systems modeled by finite state machine (FSM). The results presented in this paper aim to extend the classical supervisory control theory in order to provide an efficient way to compute supervisors which control systems modeled by concurrent extended finite state machines (EFSM). The link with the classical theory is obtained introducing the parameterized languages. It is then shown how this can be applied to concurrent systems whose subsystems exchange information during the synchronizations.