Abstract
Timed event graph (TEG) is a subclass of timed Petri nets that can be used to model discrete event systems subject to synchronization and time delay phenomena. Just-in-Time control in TEG can be defined as the determination of latest admission date of resources in order to respect a given demand profile. In this paper this kind of control problem is studied in situations in which the input dynamics are constrained to a given semimodule (a kind of linear vector space in a semiring context). We give necessary and sufficient conditions to solve the problem and present two computational methods to solve it. Application examples are presented to illustrate the applicability of the results.
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.
