The following case study illustrates the modelling of safe Timed Petri Net, such as Jobshop systems, by (max,+) automata and heaps of pieces. It should be read in line with the last example of the paper: ``Modeling and Analysis of Timed Petri Nets using Heaps of Pieces'', Stéphane Gaubert, Jean Mairesse, submitted to IEEE-TAC. ShortVersion.ps, LongVersion.ps, LongVersion.ps.gz

The mapleV.3 implementation below is a toy one, provided only for illustrative purposes.

• The maple worksheet to load in maple
• The procedure definitions needed by the worksheet (save this file as ``shuffleandco.maple``)
• The latex transcription of the session (jobshop.tex)
• The dvi transcription of the session
• The postscript transcription of the session
• maplems.sty (needed to compile jobshop.tex)
• mapleenv.sty (needed to compile jobshop.tex)
• everything.tar.gz (all the above files, in a tar gzipped archive) =41KBytes

Last modified: June 3. 1997