Abstract
Timed event graphs with multipliers, also called timed weighted marked graphs, constitute a subclass of Petri nets well adapted to model discrete event systems involving synchronization and saturation phenomena. Their dynamic behaviors can be modeled by using a particular algebra, called dioid, defined on a set of operators and endowed with the pointwise minimum operation as addition and the composition operation as multiplication. A just in time control method of these graphs based on Residuation theory is proposed.
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.
