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

@inproceedings{Gaubert1999AsymptoticAO,
  title={Asymptotic analysis of heaps of pieces and application to timed Petri nets},
  author={St{\'e}phane Gaubert and Jean Mairesse},
  booktitle={PNPM},
  year={1999}
}
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… CONTINUE READING