PReMo: an analyzer for probabilistic recursive models

Authors:
Dominik Wojtczak;Kousha Etessami
Affiliations:
School of Informatics, University of Edinburgh;School of Informatics, University of Edinburgh
Venue:
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2007

Citing 6
Cited 15

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
Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive markov decision processes and recursive stochastic games

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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

Computation of distances for regular and context-free probabilistic languages

Theoretical Computer Science
Automata, Probability, and Recursion

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM (JACM)
Weighted parsing of trees

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Performance Evaluation
On least fixed points of systems of positive polynomials

ACM Communications in Computer Algebra
Computing relaxed abstract semantics w.r.t. quadratic zones precisely

SAS'10 Proceedings of the 17th international conference on Static analysis
Solving systems of rational equations through strategy iteration

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computation of infix probabilities for probabilistic context-free grammars

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Prefix probabilities for linear context-free rewriting systems

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
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
Model checking with probabilistic tabled logic programming

Theory and Practice of Logic Programming
Stochastic context-free grammars, regular languages, and newton's method

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Upper bounds for newton's method on monotone polynomial systems, and p-time model checking of probabilistic one-counter automata

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Tulip: model checking probabilistic systems using expectation maximisation algorithm

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes PReMo, a tool for analyzing Recursive Markov Chains, and their controlled/game extensions: (1-exit) Recursive Markov Decision Processes and Recursive Simple Stochastic Games.