The covering and boundedness problems for branching vector addition systems

DOI10.4230/LIPICS.FSTTCS.2009.2317MaRDI QIDQ2920125zbMATH OpenFDO

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

Publication date 24 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_ef7f.html

zbMATH Keywords

computational complexityboundednesscoveringPetri netsvector addition systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(2)

• The reachability problem for branching vector addition systems requires doubly-exponential space
• Expand, Enlarge, and Check for Branching Vector Addition Systems

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

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