@inproceedings{b82e6e4784514e5c9e1bdf0c170d8daa,
title = "Modeling and analysis of timed Petri nets using heaps of pieces",
abstract = "We show that safe timed Petri nets can be represented by special automata over the (max,+) semiring, which compute the height of heaps of pieces. This extends to the timed case the classical representation a' la Mazurkievicz of the behavior of safe Petri nets by trace monoids and trace languages. For a subclass including all safe Free Choice Petri nets, we obtain reduced heap realizations using structural properties of the net (covering by safe state machine components). We illustrate the heap-based modeling by the typical case of safe jobshops. For a periodic schedule, we obtain a heap-based throughput formula, which is simpler to compute than its traditional timed event graph version, particularly if one is interested in the successive evaluation of a large number of possible schedules.",
keywords = "(max,+) semiring, Automata with multiplicities, Heaps of pieces, Scheduling, Timed Petri nets",
author = "St{\'e}phane Gaubert and Jean Mairesse",
year = "1997",
month = apr,
day = "8",
doi = "10.23919/ecc.1997.7082187",
language = "English",
series = "ECC 1997 - European Control Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "754--759",
booktitle = "ECC 1997 - European Control Conference",
note = "4th European Control Conference, ECC 1997 ; Conference date: 01-07-1997 Through 04-07-1997",
}