Conditions for the structural existence of an eigenvalue of a bipartite (min, max, +)-system
Theoretical Computer Science
Min-Max Inequalities and the Timing Verification Problem with Max and Linear Constraints
Discrete Event Dynamic Systems
How to solve large scale deterministic games with mean payoff by policy iteration
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
A survey of the theory of min-max systems
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
| Hi-index | 0.00 |
An algorithm CalcCycleTime to compute the cycle time of min-max systems is proposed. The computation is done by first calling CalcSpectralRadius to find the spectral radius, and then recursively calling itself to compute the cycle time of the reduced system. This algorithm is found to be efficient in practice. It is also used as a theoretical tool to analyze the structure of the eigenspace of min-max systems. It is found that a partial order, which is induced from the min-max function, is the key to characterize the structure of the eigenspace of min-max functions.