Testing undecidability of the reachability in Petri nets with the help of 10th Hilbert problem

DOI10.1007/3-540-48745-X_16MaRDI QIDQ4263303zbMATH OpenFDO

Authors Piotr Chrząstowski-Wachtel

Publication date 22 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48745-X_16

zbMATH Keywords

Petri nets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Decidability (number-theoretic aspects) (11U05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability of the Petri net reachability problem
• Entscheidbarkeit bei Petri Netzen
• An Algorithm for the General Petri Net Reachability Problem
• scientific article; zbMATH DE number 4092785

Cited in

(1)

• Soundness of workflow nets: classification, decidability, and analysis

This page was built for publication: Testing undecidability of the reachability in Petri nets with the help of 10th Hilbert problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263303)