In: Proceedings of Applications and Theory of Petri Nets 2004: 25th International Conference, ICATPN 2004, Bologna, Italy, June 21-25, 2004, pages 157-176. Volume 3099 of Lecture Notes in Computer Science / Cortadella, Reisig (Eds.) --- Springer-Verlag, September 2004.
Abstract: The aim of this paper is to introduce a concept for an efficient representation of the behavior of an unbounded Petri net. This concept combines a known method for the description of unbounded Petri nets, namely coverability trees, with an efficient, partial order based method developed for bounded Petri nets, namely Petri net unfoldings.
Back to the Petri Nets Bibliography