Name
Abstract | ||
|---|---|---|
Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides important information on complexity measures of such systems, and so is crucial in system design. We identify relevant parameters in a graph representation of these systems and propose a modular strategy to derive new upper bounds on the length of the transient phase. By that we are the first to give asymptotically tight and potentially subquadratic transience bounds. We use our bounds to derive new complexity results, in particular in distributed computing. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2016.11.003 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Transience bounds,Max-plus systems,Cyclic scheduling,Network synchronizers,Link-reversal algorithms | Complex system,Combinatorics,Linear system,Systems design,Cyclic scheduling,Modular design,Periodic graph (geometry),Graph (abstract data type),Mathematics | Journal |
Volume | Issue | ISSN |
219 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernadette Charron-bost | 1 | 785 | 67.22 |
| Matthias Függer | 2 | 167 | 21.14 |
| Thomas Nowak | 3 | 32 | 9.18 |