Discounted Properties of Probabilistic Pushdown Automata

Authors:
Tomáš Brázdil;Václav Brožek;Jan Holeček;Antonín Kučera
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic 60200;Faculty of Informatics, Masaryk University, Brno, Czech Republic 60200;Faculty of Informatics, Masaryk University, Brno, Czech Republic 60200;Faculty of Informatics, Masaryk University, Brno, Czech Republic 60200
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 14
Cited 4

Complexity of deciding Tarski algebra

Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Competitive Markov decision processes

Competitive Markov decision processes
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model checking LTL with regular valuations for pushdown systems

Information and Computation - TACS 2001
Model Checking Probabilistic Pushdown Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)

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
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
Discounting the future in systems theory

ICALP'03 Proceedings of the 30th 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
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations

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

Runtime analysis of probabilistic programs with unbounded recursion

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Efficient analysis of probabilistic programs with an unbounded counter

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Branching-time model-checking of probabilistic pushdown automata

Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that several basic discounted properties of probabilistic pushdown automata related both to terminating and non-terminating runs can be efficiently approximated up to an arbitrarily small given precision.