Abstract
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the max-plus minimal realization problem. These results are derived from general facts on rational expressions over idempotent commutative semirings: we show more generally that the set of values of the coefficients of a commutative rational expression in one letter that yield a given max-plus linear sequence is a finite union of polyhedral sets.
| Original language | English |
|---|---|
| Pages (from-to) | 820-833 |
| Number of pages | 14 |
| Journal | Journal of Computer and System Sciences |
| Volume | 77 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jan 2011 |
Keywords
- Discrete event systems
- Formal series
- Max-plus algebra
- Minimal realization
- Semi-polyhedral set
- Semiring
Fingerprint
Dive into the research topics of 'The set of realizations of a max-plus linear sequence is semi-polyhedral'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver