Analyzing probabilistic pushdown automata
DOI10.1007/S10703-012-0166-0zbMATH Open1291.68226OpenAlexW2083374362MaRDI QIDQ2248071FDOQ2248071
Authors: Tomáš Brázdil, Javier Esparza, Stefan Kiefer, Antonin Kučera 
Publication date: 30 June 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://is.muni.cz/repo/1076453
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
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)
Cites Work
- Title not available (Why is that?)
- Probability with Martingales
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logic for reasoning about time and reliability
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Title not available (Why is that?)
- A First Look at Rigorous Probability Theory
- On the Complexity of Numerical Analysis
- Reachability analysis of pushdown automata: Application to model-checking
- STACS 2005
- Title not available (Why is that?)
- Approximating the termination value of one-counter MDPs and stochastic games
- Title not available (Why is that?)
- Branching-time model-checking of probabilistic pushdown automata
- One-counter Markov decision processes
- Discounted Properties of Probabilistic Pushdown Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- STACS 2005
- Verification, Model Checking, and Abstract Interpretation
- Reachability in recursive Markov decision processes
- Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
- Complexity of deciding Tarski algebra
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- One-counter stochastic games
- Runtime analysis of probabilistic programs with unbounded recursion
- CONCUR 2004 - Concurrency Theory
Cited In (17)
- Branching-time model-checking of probabilistic pushdown automata
- Model Checking Temporal Properties of Recursive Probabilistic Programs
- Properties of probabilistic pushdown automata
- On the termination problem for probabilistic higher-order recursive programs
- Model checking probabilistic systems
- Preface to the special issue on probabilistic model checking
- Ratio and weight quantiles
- Title not available (Why is that?)
- Introducing divergence for infinite probabilistic models
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Title not available (Why is that?)
- Computing expected runtimes for constant probability programs
- An analysis using dP automata
- Probabilistic verification beyond context-freeness
- Model Checking Probabilistic Pushdown Automata
- Certificates for probabilistic pushdown automata via optimistic value iteration
- Title not available (Why is that?)
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)
