For the most recent entries see the Petri Nets Newsletter.

Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem.

Chrzastowski-Wachtel, Piotr

In: Donatelli, Susanna; Kleijn, Jetty: Lecture Notes in Computer Science, Vol. 1630: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, pages 268-281. Springer-Verlag, June 1999.

Abstract: The 10th Hilbert problem is used as a test for undecidability of reachability problem in some classes of Petri Nets, such as self-modifying nets, nets with priorities and nets with inhibitor arcs. Common method is proposed in which implementing in a weak sense the multiplication in a given class of Petri nets including PT-nets is sufficient for such undecidability.


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

Back to the Petri Nets Bibliography