DMCA
Modeling and Analysis of Timed Petri Nets Using Heaps of Pieces (1997)
Cached
Download Links
| Citations: | 56 - 18 self |
BibTeX
@MISC{Gaubert97modelingand,
author = {Stéphane Gaubert and Jean Mairesse},
title = {Modeling and Analysis of Timed Petri Nets Using Heaps of Pieces},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
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 Timed Petri nets, automata with multiplicities, heaps of pieces, (max,+) semiring, scheduling. I. Introduction The purpose of this paper 1 is to prove the following result: Timed safe Pe...
Keyphrases
timed petri net using heap petri net successive evaluation trace language la mazurkievicz large number following result trace monoids structural property classical representation periodic schedule timed case heap-based throughput formula traditional timed event graph version heap-based modeling typical case safe state machine component safe jobshops possible schedule timed safe pe safe petri net special automaton heap realization safe free choice petri net
