Performance evaluation of (max,+) automata

DOI10.1109/9.478227zbMath0855.93019MaRDI QIDQ4875977

Stéphane Gaubert

Publication date: 4 February 1997

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.478227

zbMATH Keywords

automata; performance evaluation; timed event graphs; discrete event systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

93B25: Algebraic methods

93E03: Stochastic systems in control theory (general)

93A10: General systems

Related Items

Uncertain dynamical systems defined by pseudomeasures, Unnamed Item, Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids, REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS, Asymptotic behavior in a heap model with two pieces, Model checking for a class of weighted automata, Determinization of timed Petri nets behaviors, Generalized spectral radius and its max algebra version, On the continuity of the generalized spectral radius in max algebra, \(P_{\max}^1\) and \(S_{\max}\) properties and asymptotic stability in the max algebra, String execution time for finite languages: max is easy, min is hard, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Supervisory control of \((\max,+)\) automata: a behavioral approach, Component simulation-based substitutivity managing QoS and composition issues, Barabanov norms, Lipschitz continuity and monotonicity for the max algebraic joint spectral radius, Application of max-plus algebra to biological sequence comparisons, On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra, The analytic hierarchy process, max algebra and multi-objective optimisation, State estimation of max-plus automata with unobservable events, New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems, Compositions of (max,+) automata, Bisimulation relations for weighted automata, Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture, Coinduction in Concurrent Timed Systems, Placement Inference for a Client-Server Calculus, APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS, How to Tackle Integer Weighted Automata Positivity