Decidability of the Petri net reachability problem

From MaRDI portal

Publication:1813788

Jump to:navigation, search

zbMath0795.68147MaRDI QIDQ1813788

B. L. Budinas

Publication date: 25 June 1992

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

reachability Petri nets decidability semilinear sets Presburger arithmetic vector addition graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

This page was built for publication: Decidability of the Petri net reachability problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1813788&oldid=11990323"