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
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
Random walks with “back buttons” (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
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)
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
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive concurrent stochastic games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
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
Reachability in recursive markov decision processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
In this talk we will discuss recent work on the modeling and analysis of systems that involve recursion and probability. Both, recursion and probability, are fundamental constructs that arise in a wide variety of settings in computer science and other disciplines.