Pages that link to "Item:Q4369884"
From MaRDI portal
The following pages link to The complexity of probabilistic verification (Q4369884):
Displaying 50 items.
- Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- A note on the verification of automata specifications of probabilistic real-time systems (Q294873) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- Stochastic game logic (Q715046) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- On fairness and randomness (Q840697) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- Decidable and expressive classes of probabilistic automata (Q1740668) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- On probabilistic timed automata. (Q1853732) (← links)
- Parallel local search (Q1922627) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- Timed vacuity (Q2024362) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Bounds for synchronizing Markov decision processes (Q2097220) (← links)
- Comparison of algorithms for simple stochastic games (Q2105472) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- Determinization and limit-determinization of Emerson-Lei automata (Q2147175) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- Automatic verification of competitive stochastic systems (Q2248068) (← links)
- Preface to the special issue on probabilistic model checking (Q2248070) (← links)
- Bayesian statistical model checking with application to Stateflow/Simulink verification (Q2248081) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- Concurrent games with tail objectives (Q2464942) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
