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

Authors:
Piotr Chrzastowski-Wachtel
Affiliations:
-
Venue:
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Year:
1999

Citing 3
Cited 1

Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

On Trace-Expressible Behaviour of Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

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.