Passer à la navigation principale Passer à la recherche Passer au contenu principal

Asymptotic analysis of heaps of pieces and application to timed Petri nets

  • Laboratoire de Probabilités et Modèles Aléatoires

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

What is the density of an infinite heap of pieces, if we let pieces fall down randomly, or if we select pieces to maximize the density? How many transitions of a safe timed Petri net can we fire per time unit? We reduce these questions to the computation of the average and optimal case Lyapunov exponents of max-plus automata, and we present several techniques to compute these exponents. First, we introduce a completed "non-linear automaton", which essentially fills incrementally all the gaps that can be filled in a heap without changing its asymptotic height. Using this construction, when the pieces have integer valued shapes, and when any two pieces overlap, the Lyapunov exponents can be explicitly computed. We present two other constructions (partly based on Cartier-Foata normal forms of traces) which allow us to compute the optimal case Lyapunov exponent, assuming only that the pieces have integer valued shapes.

langue originaleAnglais
titreProceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999
EditeurInstitute of Electrical and Electronics Engineers Inc.
Pages158-169
Nombre de pages12
ISBN (Electronique)0769503314, 9780769503318
Les DOIs
étatPublié - 1 janv. 1999
Evénement8th International Workshop on Petri Nets and Performance Models, PNPM 1999 - Zaragoza, Espagne
Durée: 8 sept. 199910 sept. 1999

Série de publications

NomProceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999

Une conférence

Une conférence8th International Workshop on Petri Nets and Performance Models, PNPM 1999
Pays/TerritoireEspagne
La villeZaragoza
période8/09/9910/09/99

Empreinte digitale

Examiner les sujets de recherche de « Asymptotic analysis of heaps of pieces and application to timed Petri nets ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation