The Complexity of Coverability in ν-Petri Nets

DOI10.1145/2933575.2933593zbMath1392.68306OpenAlexW2286125845WikidataQ130974889 ScholiaQ130974889MaRDI QIDQ4635904

Sylvain Schmitz, Ranko Lazić

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/79162/8/WRAP_0070379-cs-170516-sigplanconf%20%281%29.pdf

zbMATH Keywords

formal verificationorder idealwell-quasi-orderwell-structured transition systemfast-growing complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Handling infinitely branching well-structured transition systems ⋮ Coverability and Termination in Recursive Petri Nets ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Ordinal recursive complexity of unordered data nets ⋮ WQO dichotomy for 3-graphs ⋮ The ideal view on Rackoff's coverability technique ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

This page was built for publication: The Complexity of Coverability in ν-Petri Nets