Structurally Cyclic Petri Nets

DOI10.2168/LMCS-11(4:15)2015zbMath1448.68340arXiv1510.08331MaRDI QIDQ3460419

Drewes Frank, Leroux Jérôme

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.08331

zbMATH Keywords

reachabilityPetri netvector addition systemstructural cyclicity

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 (3)

Verification of Flat FIFO Systems ⋮ Language theoretic properties of regular DAG languages ⋮ Unnamed Item

This page was built for publication: Structurally Cyclic Petri Nets