From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
From MaRDI portal
Publication:1870590
DOI10.1016/S0304-3975(02)00235-9zbMath1036.93045MaRDI QIDQ1870590
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Fixed point; Max-plus semiring; Cycle time; Nonnegative matrix; Discrete event system; Nonexpansive map; Nonlinear eigenvalue; Topical function
93C65: Discrete event control/observation systems
47N70: Applications of operator theory in systems, signals, circuits, and control theory
47H99: Nonlinear operators and their properties
Related Items
The Perron-Frobenius theorem for homogeneous, monotone functions, Unnamed Item, Definable Zero-Sum Stochastic Games, The existence and uniqueness of eigenvalues for monotone homogeneous mapping pairs, Contractive mappings and existence of cycle times for a monotone and homogeneous function, Equivalence of communication and projective boundedness properties for monotone and homogeneous functions, Output feedback stabilization for a class of nonlinear time-evolution systems, Spectral theorem for convex monotone homogeneous maps, and ergodic control, Poisson equations associated with a homogeneous and monotone function: necessary and sufficient conditions for a solution in a weakly convex case, The many benefits of putting stack filters into disjunctive or conjunctive normal form, An algorithm for the largest eigenvalue of nonhomogeneous nonnegative polynomials, Sub-topical functions and plus-co-radiant sets, TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES, Unnamed Item, Evolution equations in discrete and continuous time for nonexpansive operators in Banach spaces, A maximin characterisation of the escape rate of non-expansive mappings in metrically convex spaces, A note on periodic points of order preserving subhomogeneous maps, A Denjoy–Wolff theorem for Hilbert metric nonexpansive maps on polyhedral domains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of uniformly continuous transformations and hyperconvex metric spaces
- Asymptotic expansions for dynamic programming recursions with general nonnegative matrices
- Asymptotic behavior of nonexpansive mappings in normed linear spaces
- Omega limit sets of nonexpansive maps: Finiteness and cardinality estimates
- Eigenvalues of dynamic max-min systems
- Alternative proof of Sine's theorem on the size of a regular polygon in \(\mathbb{R}{}^ n\) with the \(\ell{}_ \infty\)-metric
- Minimax algebra
- Min-max functions
- Some ergodic results on stochastic iterative discrete events systems
- The cycle time vector of D-A-D functions
- Dioïds and semirings: Links to fuzzy sets and other applications
- The spectrum of a nonlinear operator associated with a matrix
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- A Nonlinear Perron-Frobenius Theorem
- Hilbert’s projective metric and iterated nonlinear maps
- Iterated nonlinear maps and Hilbert’s projective metric. II
- Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
- Some Relations Between Nonexpansive and Order Preserving Mappings
- Growth Optimality for Branching Markov Decision Chains
- The Asymptotic Theory of Stochastic Games
- On Stochastic Games with Stationary Optimal Strategies
- The duality theorem for min-max functions
- Existence and uniqueness of diffusions on finitely ramified self-similar fractals
- An algorithm for exact bounds on the time separation of events in concurrent systems
- The Perron-Frobenius theorem for homogeneous, monotone functions
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- A constructive fixed point theorem for min-max functions
- Scheduling Parallel Computations
- An Algebra for Network Routing Problems
