Polynomial-time decidability of linear asymptotic expected termination time for a class of nondeterministic pVASS, with a quadratic lower bound otherwise.
In: 2011 Eleventh International Conference on Appl ication of Concurrency to System Design
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deciding Fast Termination for Probabilistic VASS with Nondeterminism
Polynomial-time decidability of linear asymptotic expected termination time for a class of nondeterministic pVASS, with a quadratic lower bound otherwise.