Abstract
This article concerns control design for partially controlled timed continuous Petri nets under infinite server semantics and constant bounded input control actions. Domains of stationary markings and of their corresponding control actions are computed. Linear matrix inequalities and linear programming problems are used for that purpose. Then, disturbance rejection in the neighborhood of the stationary markings is also investigated.
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.
