The complexity of probabilistic verification
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Probabilistic weak simulation is decidable in polynomial time
- A note on the attractor-property of infinite-state Markov chains
- On verifying that a concurrent program satisfies a nondeterministic specification
- A logic for reasoning about time and reliability
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
- Approximating labelled Markov processes
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Testing preorders for probabilistic processes can be characterized by simulations
- Spanning the spectrum from safety to liveness
- Learning deterministic probabilistic automata from a model checking perspective
- Decidable and expressive classes of probabilistic automata
- The complexity of synchronizing Markov decision processes
- On relative and probabilistic finite counterability
- Computation tree measurement language (CTML)
- Probabilistic verification
- On probabilistic timed automata.
- On the complexity of verifying concurrent transition systems
- Parallel local search
- Non-deterministic weighted automata evaluated over Markov chains
- Timed vacuity
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- -automata
- Bounds for synchronizing Markov decision processes
- Comparison of algorithms for simple stochastic games
- Back to the future: a fresh look at linear temporal logic
- Determinization and limit-determinization of Emerson-Lei automata
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Automatic verification of competitive stochastic systems
- Preface to the special issue on probabilistic model checking
- Bayesian statistical model checking with application to Stateflow/Simulink verification
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
- Concurrent games with tail objectives
- Probabilistic verification and approximation
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Quantitative analysis of probabilistic lossy channel systems
- Optimal cost almost-sure reachability in POMDPs
- Verification of probabilistic systems with faulty communication
- On finite-state approximants for probabilistic computation tree logic
- Model checking differentially private properties
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- Recursive Markov decision processes and recursive stochastic games
- Functional encryption for inner product with full function privacy
- The complexity of coverage
- Classes of timed automata and the undecidability of universality
- The probability nesting game
- A note on the verification of automata specifications of probabilistic real-time systems
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Carrying probabilities to the infinite world
- Two variable vs. linear temporal logic in model checking and games
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Model checking probabilistic systems
- The Effect of Tossing Coins in Omega-Automata
- Probabilistic Weighted Automata
- Counterexamples in Probabilistic LTL Model Checking for Markov Chains
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- Optimal Translation of LTL to Limit Deterministic Automata
- LTL to deterministic Emerson-Lei automata
- The Complexity of Synthesis from Probabilistic Components
- On the expressiveness and complexity of randomization in finite state monitors
- Value Iteration
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- Probabilistic Acceptors for Languages over Infinite Words
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Weighted versus Probabilistic Logics
- Decision Problems for Nash Equilibria in Stochastic Games
- LTL model checking of time-inhomogeneous Markov chains
- Quantitative analysis under fairness constraints
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- scientific article; zbMATH DE number 177248 (Why is no real title available?)
- scientific article; zbMATH DE number 177519 (Why is no real title available?)
- A survey of stochastic -regular games
- scientific article; zbMATH DE number 1324653 (Why is no real title available?)
- Moving in a network under random failures: a complexity analysis
- Model checking probabilistic systems against pushdown specifications
- A temporal negative normal form which preserves implicants and implicates
- Symbolic model checking for probabilistic processes
- Probabilistic opacity for Markov decision processes
- scientific article; zbMATH DE number 2086517 (Why is no real title available?)
- Obligation Blackwell games and p-automata
- Non-deterministic Weighted Automata on Random Words
- Verifying quantitative temporal properties of procedural programs
- The satisfiability problem for unbounded fragments of probabilistic CTL
- Comparison of algorithms for simple stochastic games
- scientific article; zbMATH DE number 7455747 (Why is no real title available?)
- On the power of unambiguity in Büchi complementation
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Model checking linear-time properties of probabilistic systems
- Model-Free Reinforcement Learning for Stochastic Parity Games
- Efficient analysis of unambiguous automata using matrix semigroup techniques
- Model checking -regular properties for quantum Markov chains
- Of cores: a partial-exploration framework for Markov decision processes
- Complexity of model checking MDPs against LTL specifications
- Energy-utility analysis for resilient systems using probabilistic model checking
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Model checking of biological systems
- Validation of Stochastic Systems
- Model Checking Quantitative Linear Time 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)
