Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
