Abstract

We deal with timed event graphs whose holding times associated with places are variable. Defining a first-in-first-out functioning rule, we show that such graphs can be linearly described in (max,+) algebra. Moreover, this linear representation allows extending the just-in-time control synthesis existing for timed event graphs with constant holding times. An example is proposed in order to illustrate how the approach can be applied as a just-in-time strategy for production lines.

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 call

Disclaimer: 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.