Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

FSTTCS
2009
Springer

favoriteEmaildiscussreport

137views Software Engineering» more FSTTCS 2009»

The Covering and Boundedness Problems for Branching Vector Addition Systems

13 years 11 months ago

The Covering and Boundedness Problems for Branching Vector Addition Systems

Download www.lsv.ens-cachan.fr

The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.

Stéphane Demri, Marcin Jurdzinski, Oded Lac

Real-time Traffic

Boundedness Problems | FSTTCS 2009 | Theoretical Computer Science | Vector Addition Systems |

claim paper

Related Content

» PlaceBoundedness for Vector Addition Systems with one zerotest

» Mixing Coverability and Reachability to Analyze VASS with One ZeroTest

» The reachability problem for branching vector addition systems requires doublyexponential ...

» Rewriting Systems for Reachability in Vector Addition Systems with Pairs

» Approximating ContentBased ObjectLevel Image Retrieval

» Improving the Performance of HighEnergy Physics Analysis through Bitmap Indices

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FSTTCS
Authors	Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic

Comments (0)