The complexity of probabilistic verification
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Validation of Stochastic Systems
- Operational causality -- necessarily sufficient and sufficiently necessary
- Obligation Blackwell games and p-automata
- Composition of stochastic services for LTL\(_f\) goal specifications
- Recurrence and transience for finite probabilistic tables
- Regular games with imperfect information are not that regular
- Deciding sparseness of regular languages of finite trees and infinite words
- Computation tree measurement language (CTML)
- Concurrent games with tail objectives
- On the expressiveness and complexity of randomization in finite state monitors
- Quantitative analysis of probabilistic lossy channel systems
- Profile trees for Büchi word automata, with application to determinization
- Counterexamples in Probabilistic LTL Model Checking for Markov Chains
- On verifying that a concurrent program satisfies a nondeterministic specification
- Optimal Translation of LTL to Limit Deterministic Automata
- A note on the attractor-property of infinite-state Markov chains
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Verification of probabilistic systems with faulty communication
- Model checking differentially private properties
- On simulation-based probabilistic model checking of mixed-analog circuits
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- The complexity of coverage
- The probability nesting game
- scientific article; zbMATH DE number 7649960 (Why is no real title available?)
- On the concrete efficiency of probabilistically-checkable proofs
- The smoothed complexity of policy iteration for Markov decision processes
- The Effect of Tossing Coins in Omega-Automata
- Promptness and fairness in Muller LTL formulas
- scientific article; zbMATH DE number 177519 (Why is no real title available?)
- Automatic verification of competitive stochastic systems
- scientific article; zbMATH DE number 7649915 (Why is no real title available?)
- Satisfiability of quantitative probabilistic CTL: rise to the challenge
- Value Iteration
- Policy synthesis and reinforcement learning for discounted LTL
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Two variable vs. linear temporal logic in model checking and games
- Probabilistic Acceptors for Languages over Infinite Words
- Linear-time safe-alternating DFS and SCCs
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Carrying probabilities to the infinite world
- Bounds for synchronizing Markov decision processes
- scientific article; zbMATH DE number 7455748 (Why is no real title available?)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Non-deterministic Weighted Automata on Random Words
- Model checking probabilistic systems against pushdown specifications
- Optimal cost almost-sure reachability in POMDPs
- Model Checking Quantitative Linear Time Logic
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Model-Free Reinforcement Learning for Stochastic Parity Games
- scientific article; zbMATH DE number 7455747 (Why is no real title available?)
- scientific article; zbMATH DE number 7561726 (Why is no real title available?)
- Probabilistic verification of Boolean functions
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Complexity of model checking MDPs against LTL specifications
- Of cores: a partial-exploration framework for Markov decision processes
- Comparison of algorithms for simple stochastic games
- Comparison of algorithms for simple stochastic games
- -automata
- LTL model checking of time-inhomogeneous Markov chains
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
- A survey of stochastic -regular games
- Deciding what is good-for-MDPs
- Weighted versus Probabilistic Logics
- Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
- A temporal negative normal form which preserves implicants and implicates
- Positivity-hardness results on Markov decision processes
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- On fairness and randomness
- Some Complexity Results for SystemVerilog Assertions
- The well-designed logical robot: learning and experience from observations to the Situation Calculus
- Decidable and expressive classes of probabilistic automata
- The complexity of synchronizing Markov decision processes
- Verifying quantitative temporal properties of procedural programs
- Probabilistic Weighted Automata
- scientific article; zbMATH DE number 177248 (Why is no real title available?)
- Symbolic model checking for probabilistic processes
- Metrics for labelled Markov processes
- On Decision Problems for Probabilistic Büchi Automata
- Testing preorders for probabilistic processes can be characterized by simulations
- On relative and probabilistic finite counterability
- Decision Problems for Nash Equilibria in Stochastic Games
- Non-deterministic weighted automata evaluated over Markov chains
- Functional encryption for inner product with full function privacy
- Probabilistic opacity for Markov decision processes
- Stochastic game logic
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Quantitative analysis under fairness constraints
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
- Spanning the spectrum from safety to liveness
- Alternating good-for-MDPs automata
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Learning deterministic probabilistic automata from a model checking perspective
- Moving in a network under random failures: a complexity analysis
- On the power of finite ambiguity in Büchi complementation
- Probabilistic weak simulation is decidable in polynomial time
- Model checking probabilistic systems
- Approximating labelled Markov processes
- A note on the verification of automata specifications of probabilistic real-time systems
- Back to the future: a fresh look at linear temporal logic
This page was built for publication: The complexity of probabilistic verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369884)
