Abstract
This paper presents an approach to computing a safe upper bound of the response time of Distributed Control System (DCS). From a graphical model of live autonomous Timed Event Graphs (TEGs) with asynchronous links and weights, we draw algebraic representations of the time/event dynamics using the Minax〚γ,δ〛 dioid. By introducing scalers and two operators for handling batching or multiplying events, we are able to calculate the trajectories and transfer functions. With deterministic and worst-case hypotheses, the worst delays induced by the model is then computed, composing an upper bound for the response time. We validate the method through a numerical application, confronted to experimental measurements. The method is modular, can be automated and is easily used to any DCS modelled with TEGs.
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.
