Model Checking Probabilistic Pushdown Automata
From MaRDI portal
Recommendations
- Model checking probabilistic systems against pushdown specifications
- Branching-time model-checking of probabilistic pushdown automata
- Branching-time model-checking of probabilistic pushdown automata
- Model checking for probabilistic timed automata
- scientific article; zbMATH DE number 1696496
- On probabilistic pushdown automata
- Analyzing probabilistic pushdown automata
- The probabilistic model checking landscape
- Model checking of recursive probabilistic systems
- Model checking probabilistic systems
Cited in
(39)- Branching-time model-checking of probabilistic pushdown automata
- Model checking probabilistic systems against pushdown specifications
- Branching-time model-checking of probabilistic pushdown automata
- Weighted one-deterministic-counter automata
- Model checking stochastic automata
- STACS 2005
- About decisiveness of dynamic probabilistic models
- The finite satisfiability problem for PCTL is undecidable
- On the existence and computability of long-run average properties in probabilistic VASS
- Derivation tree analysis for accelerated fixed-point computation
- Model checking failure-prone open systems using probabilistic automata
- scientific article; zbMATH DE number 7561608 (Why is no real title available?)
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- Stochastic Games with Lossy Channels
- The satisfiability problem for unbounded fragments of probabilistic CTL
- Model checking with probabilistic tabled logic programming
- The satisfiability problem for a quantitative fragment of PCTL
- The finite satisfiability problem for PCTL is undecidable
- Analyzing probabilistic pushdown automata
- Recursive stochastic games with positive rewards
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Separable GPL: decidable model checking with more non-determinism
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- Introducing divergence for infinite probabilistic models
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- General-nondeterministic fuzzy pushdown automata and their languages
- Probabilistic total store ordering
- Verification of probabilistic systems with faulty communication
- On the memory consumption of probabilistic pushdown automata
- Querying probabilistic business processes for sub-flows
- Beyond decisiveness of infinite Markov chains
- Markov chains and Markov decision processes in Isabelle/HOL
- The satisfiability problem for a quantitative fragment of PCTL
- Satisfiability of quantitative probabilistic CTL: rise to the challenge
- Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
- Certificates for probabilistic pushdown automata via optimistic value iteration
- Deciding fast termination for probabilistic VASS with nondeterminism
- The recursive arrival problem
This page was built for publication: Model Checking Probabilistic Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310649)
