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

DOI10.1007/978-3-319-51046-0_8zbMath1485.68164OpenAlexW2563122255MaRDI QIDQ1708715

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

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

Related Items (5)

Unnamed Item ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ A lower bound for the coverability problem in acyclic pushdown VAS ⋮ Unnamed Item ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems

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