Probability and recursion

Authors:
Kousha Etessami;Mihalis Yannakakis
Affiliations:
LFCS, School of Informatics, University of Edinburgh;Department of Computer Science, Columbia University
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 21
Cited 0

Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A problem that is easier to solve on the unit-cost algebraic RAM

Journal of Complexity
The complexity of stochastic games

Information and Computation
Probabilistic verification

Information and Computation
The complexity of probabilistic verification

Journal of the ACM (JACM)
On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
Competitive Markov decision processes

Competitive Markov decision processes
Foundations of statistical natural language processing

Foundations of statistical natural language processing
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model checking for probability and time: from theory to practice

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Some NP-complete geometric problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
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
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
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
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this talk we will discuss recent work on the modeling and algorithmic analysis of systems involving recursion and probability. There has been intense activity recently in the study of such systems [2,3,10,11,13,14,15,16,17]. The primary motivation comes from the analysis of probabilistic programs with procedures. Probability can arise either due to randomizing steps in the program, or it may reflect statistical assumptions on the behaviour of the program, under which we want to investigate its properties.