Abstract
Modeling and analysis of a specific class of Discrete Event Systems lead to introduce an exotic algebra of formal series (dioid algebra). In particular, the behavior of these systems is characterized by computing transfer matrices. In this paper, we study the algebraic problems which arise when considering rational computations in this particular dioid. The main theorem states that rational elements are periodic, in the sense they represent the eventual periodic behavior of Timed Event Graphs. Then the algebra of periodicities is investigated. Some formulae and algorithms are presented. In particular, we show how the computation of the periodic behavior is related to the Frobenius problem for linear diophantine equations. These algorithms have been implemented in MAPLE. An application to a simple flowshop is presented.
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.
