The covering and boundedness problems for branching vector addition systems

DOI10.1016/j.jcss.2012.04.002zbMath1260.68264OpenAlexW2066170410MaRDI QIDQ1936244

Oded Lachish, Ranko Lazić, Marcin Jurdziński, Stéphane P. Demri

Publication date: 21 February 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.04.002

zbMATH Keywords

computational complexitycoveringboundednessPetri netsbranching vector addition systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension ⋮ Unnamed Item ⋮ IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Coverability and Termination in Recursive Petri Nets ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ On the complexity of resource-bounded logics ⋮ Constructive decision via redundancy-free proof-search ⋮ The ideal view on Rackoff's coverability technique ⋮ Unnamed Item ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

This page was built for publication: The covering and boundedness problems for branching vector addition systems