Abstract
It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to combinatorial state explosion that is exponential in the number of system components. To manage this complexity we introduce state tree structures (STS), an adaptation of statecharts to the supervisory control theory. The systems to be controlled are modeled as STS hierarchies encoded by binary decision diagrams. This approach is capable of dealing with discrete-event systems of industrial size; furthermore the controllers are highly structured and comprehensible to non-specialists
Sign-in/Register to access full text options 
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.
