s'authentifier
version française rss feed
Fiche détaillée  Récupérer au format
Journal of Computer and System Sciences 4, 77 (2011) 820-833
Versions disponibles :
ensl-00507757, version 2
arXiv:1010.3685
Informatique/Algorithme et structure de données
Informatique/Automatique
The set of realizations of a max-plus linear sequence is semi-polyhedral
Vincent Blondel1, Stéphane Gaubert2, 3, Natacha Portier4, 5
1 :  INMA - Pôle en ingénierie mathématique
2 :  INRIA Saclay - Ile de France - MAXPLUS
3 :  CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique
4 :  LIP - Laboratoire de l'Informatique du Parallélisme
5 :  Department of Computer Science
[MC2 - Modèles de calcul et complexité]
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.
Anglais
max-plus algebra – minimal realization – discrete event systems – semi-polyhedral set – formal series – semiring
Research Report RRLIP 2010-33
This work was partly supported by a grant Tournesol (Programme de coopération scientifique entre la France et la communauté Française de Belgique) and by the European Community Framework IV program through the research network ALAPEDES (``The Algebraic Approach to Performance Evaluation of Discrete Event Systems'') and by European Community under contract PIOF-GA-2009-236197 of the 7th PCRD.
Liste des fichiers attachés à ce document : 
PS
RR-BGP.ps(878.2 KB)
PDF
RR-BGP.pdf(368.5 KB)