Analyzing probabilistic pushdown automata
From MaRDI portal
Publication:2248071
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
- Methods for quantitative analysis of probabilistic pushdown automata
- On probabilistic pushdown automata
- Properties of probabilistic pushdown automata
- Model Checking Probabilistic Pushdown Automata
- Properties of probabilistic pushdown automata
- Analysis of probabilistic processes and automata theory
- Discounted Properties of Probabilistic Pushdown Automata
- scientific article; zbMATH DE number 3499660
- STACS 2005
Cites work
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 5485454 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 2080197 (Why is no real title available?)
- scientific article; zbMATH DE number 1796135 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A First Look at Rigorous Probability Theory
- A lattice-theoretical fixpoint theorem and its applications
- A logic for reasoning about time and reliability
- Approximating the termination value of one-counter MDPs and stochastic games
- Branching-time model-checking of probabilistic pushdown automata
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
- CONCUR 2004 - Concurrency Theory
- Complexity of deciding Tarski algebra
- Discounted Properties of Probabilistic Pushdown Automata
- On the Complexity of Numerical Analysis
- One-counter Markov decision processes
- One-counter stochastic games
- Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
- Probability with Martingales
- Reachability analysis of pushdown automata: Application to model-checking
- Reachability in recursive Markov decision processes
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Runtime analysis of probabilistic programs with unbounded recursion
- STACS 2005
- STACS 2005
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification, Model Checking, and Abstract Interpretation
Cited in
(16)- Introducing divergence for infinite probabilistic models
- Model checking probabilistic systems
- Branching-time model-checking of probabilistic pushdown automata
- Probabilistic verification beyond context-freeness
- Preface to the special issue on probabilistic model checking
- Computing expected runtimes for constant probability programs
- Model Checking Probabilistic Pushdown Automata
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Ratio and weight quantiles
- Certificates for probabilistic pushdown automata via optimistic value iteration
- Properties of probabilistic pushdown automata
- scientific article; zbMATH DE number 7471675 (Why is no real title available?)
- On the termination problem for probabilistic higher-order recursive programs
- scientific article; zbMATH DE number 5167670 (Why is no real title available?)
- scientific article; zbMATH DE number 7376040 (Why is no real title available?)
- An analysis using dP automata
This page was built for publication: Analyzing probabilistic pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248071)
