15836 articles – 31981 references  [version française]
HAL: ensl-00507757, version 2

Detailed view  Export this paper
Journal of Computer and System Sciences 77, 4 (2011) 820-833
Available versions:
The set of realizations of a max-plus linear sequence is semi-polyhedral
Vincent Blondel 1, Stéphane Gaubert 2, 3, Natacha Portier 4, 5
(2011-07)

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 semi-algebraic set in the max-plus sense. In particular, it is a finite union of polyhedral sets.
1:  Pôle en ingénierie mathématique (INMA)
Université Catholique de Louvain (UCL) - Belgique
2:  MAXPLUS (INRIA Saclay - Ile de France)
INRIA – CNRS : UMR – Polytechnique - X
3:  Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP)
Polytechnique - X – CNRS : UMR7641
4:  Laboratoire de l'Informatique du Parallélisme (LIP)
Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I
5:  Department of Computer Science
University of Toronto
Computer Science/Data Structures and Algorithms

Computer Science/Automatic Control Engineering
max-plus algebra – minimal realization – discrete event systems – semi-polyhedral set – formal series – semiring
Attached file list to this document: 
PS
RR-BGP.ps(878.2 KB)
PDF
RR-BGP.pdf(368.5 KB)