What makes Petri nets harder to verify: stack or data?

DOI10.1007/978-3-319-51046-0_8MaRDI QIDQ1708715zbMATH OpenOpenAlexFDO

Authors Ranko Lazić, Patrick Totzke

Publication date 26 March 2018

Full work available at URL http://wrap.warwick.ac.uk/83719/7/WRAP-what-makes-petri-nets-harder-verify-Lazic-2016.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The Reachability Problem for Petri Nets Is Not Elementary
• The reachability problem for Petri nets is not elementary
• Nets with tokens which carry data
• Nets with Tokens Which Carry Data
• Coverability trees for Petri nets with unordered data

Cited in

(8)

• The Reachability Problem for Petri Nets Is Not Elementary
• The reachability problem for Petri nets is not elementary
• scientific article; zbMATH DE number 7561336 (Why is no real title available?)
• On functions weakly computable by pushdown Petri nets and related systems
• A lower bound for the coverability problem in acyclic pushdown VAS
• On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
• Solvability of orbit-finite systems of linear equations
• Linear equations for unordered data vectors in $[D]^k\to{}Z^d$

This page was built for publication: What makes Petri nets harder to verify: stack or data?

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