Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Deterministic one-counter automata
1. Fachtagung über Automatentheorie und Formale Sprachen
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Checking LTL Properties of Recursive Markov Chains
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Transient analysis of tree-Like processes and its application to random access systems
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Structured Markov chains solver: algorithms
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
On the convergence of Newton's method for monotone systems of polynomial equations
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
CSL model checking algorithms for QBDs
Theoretical Computer Science
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
PReMo: an analyzer for probabilistic recursive models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
One-counter Markov decision processes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Minimizing expected termination time in one-counter markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a precise sense, to probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TL-QBDs) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs). We then proceed to exploit these connections to obtain a number of new algorithmic upper and lower bounds for central computational problems about these models. Our main result is this: for an arbitrary QBD, we can approximate its termination probabilities (i.e., its G matrix) to within i bits of precision (i.e., within additive error 1/2^i), in time polynomial in both the encoding size of the QBD and in i, in the unit-cost rational arithmetic RAM model of computation. Specifically, we show that a decomposed Newton's method can be used to achieve this. We emphasize that this bound is very different from the well-known ''linear/quadratic convergence'' of numerical analysis, known for QBDs and TL-QBDs, which typically gives no constructive bound in terms of the encoding size of the system being solved. In fact, we observe (based on recent results) that for the more general TL-QBDs such a polynomial upper bound on Newton's method fails badly. Our upper bound proof for QBDs combines several ingredients: a detailed analysis of the structure of 1-Counter Automata, an iterative application of a classic condition number bound for errors in linear systems, and a very recent constructive bound on the performance of Newton's method for strongly connected monotone systems of polynomial equations. We show that the quantitative termination decision problem for QBDs (namely, ''is G"u","v=1/2?'') is at least as hard as long-standing open problems in the complexity of exact numerical computation, specifically the square-root sum problem. On the other hand, it follows from our earlier results for RMCs that any non-trivial approximation of termination probabilities for TL-QBDs is sqrt-root-sum-hard.