A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
An Asymptotic Cyclicity Analysis of Live Autonomous Timed Event Graphs
Designing a discrete event system converging to steady temporal patterns is an essential issue of a system with time window constraints. Until now, to analyze asymptotic stability, we have modeled a timed event graph's dynamic behavior, transformed it into the matrix form of (max,+) algebra, and then constructed a precedence graph. This article's aim is to provide a theoretical basis for analyzing the stability and cyclicity of timed event graphs without using (max,+) algebra. In this article,doi:10.3390/app11114769 fatcat:kamywlqyx5gejaprgtwehc7mbi