Abstract
This paper discusses the problem of marking constraints in a class of partially controllable timed Petri nets. Specifically, these are Timed Event Graphs (TEGs) which include disturbed input transitions and which are subject to token capacity constraints in some paths. Using the Min-Plus algebra formalism, formal approaches are proposed to design causal control laws to guarantee compliance with marking constraints in TEGs. Sufficient conditions are defined to show the existence and synthesis of these controllers. The developed methodologies are illustrated in a case study of a disassembly system with a limited stock of components.
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.
