Skip to main navigation Skip to search Skip to main content

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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages158-169
Number of pages12
ISBN (Electronic)0769503314, 9780769503318
DOIs
Publication statusPublished - 1 Jan 1999
Event8th International Workshop on Petri Nets and Performance Models, PNPM 1999 - Zaragoza, Spain
Duration: 8 Sept 199910 Sept 1999

Publication series

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

Conference

Conference8th International Workshop on Petri Nets and Performance Models, PNPM 1999
Country/TerritorySpain
CityZaragoza
Period8/09/9910/09/99

Fingerprint

Dive into the research topics of 'Asymptotic analysis of heaps of pieces and application to timed Petri nets'. Together they form a unique fingerprint.

Cite this