In: Lectures on Concurrency and Petri Nets: Advances in Petri Nets, pages 413-438. Volume 3098 of Lecture Notes in Computer Science / Jörg Desel, Wolfgang Reisig, Grzegorz Rozenberg (Eds.) --- Springer-Verlag, June 2004.
Abstract: We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable markings may be infinite.
Back to the Petri Nets Bibliography