Transience bounds for long walks

DOI10.1287/MOOR.24.2.414MaRDI QIDQ2757602zbMATH OpenOpenAlexFDO

Authors Cristina Arguelles, Mark Hartmann

Publication date 26 November 2001

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/246414012e735356cac0f0f7a3d101ab0c6e3735

zbMATH Keywords

dynamic programmingmax-algebratransient

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• An overview of transience bounds in max-plus algebra
• Generalizations of bounds on the index of convergence to weighted digraphs
• scientific article; zbMATH DE number 4195732
• New transience bounds for max-plus linear systems
• Weak CSR expansions and transience bounds in max-plus algebra

Cited in

(16)

• Tropical linear algebra with the Łukasiewicz t-norm
• Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach
• New bounds on the periodicity transient of the powers of a tropical matrix: using cyclicity and factor rank
• Computational techniques for reachability analysis of Max-Plus-Linear systems
• Walking within growing domains: recurrence versus transience
• Local and global robustness with \(q\)-step delay for max-plus linear systems
• Fiedler-Pták scaling in max algebra
• Weak CSR expansions and transience bounds in max-plus algebra
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• New transience bounds for max-plus linear systems
• A bound for the rank-one transient of inhomogeneous matrix products in special case.
• scientific article; zbMATH DE number 7670358 (Why is no real title available?)
• On the tightness of bounds for transients of weak CSR expansions and periodicity transients of critical rows and columns of tropical matrix powers
• Algorithm for the CSR expansion of max-plus matrices using the characteristic polynomial
• Generalizations of bounds on the index of convergence to weighted digraphs
• A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs

This page was built for publication: Transience bounds for long walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757602)