For the most recent entries see the Petri Nets Newsletter.

Reproducibility of the Empty Marking.

Lautenbach, Kurt

In: J. Esparza, C. Lakos (Eds.): Lecture Notes in Computer Science, Vol. 2360: 23rd International Conference on Applications and Theory of Petri Nets, Adelaide, Australia, June 24-30, 2002, pages 1-237pp. Springer Verlag, June 2002.

Abstract: The main theorem of the paper states that the empty marking is reproducible in a p/t-net N if and only if there are reproducing T-invariants whose net representations have neither traps nor co-traps (deadlocks, siphons). This result is to be seen in connection to modeling processes, since all processes which have a start and a goal event usually reproduce the empty marking.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography