Storm

swMATH17417MaRDI QIDQ29276FDOQ29276

Author name not available (Why is that?)

Source code repository: https://github.com/moves-rwth/storm

Cited In (45)

• Counterexample-guided inductive synthesis for probabilistic systems
• Title not available (Why is that?)
• Of cores: a partial-exploration framework for Markov decision processes
• Lifted model checking for relational MDPs
• Model checking hyperproperties for Markov decision processes
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Life is random, time is not: Markov decision processes with window objectives
• Deep statistical model checking
• Formal abstraction and synthesis of parametric stochastic processes
• Lumpability for uncertain continuous-time Markov chains
• Enforcing almost-sure reachability in POMDPs
• Safe learning for near-optimal scheduling
• The complexity of reachability in parametric Markov decision processes
• Robustly complete finite-state abstractions for verification of stochastic systems
• Multi-scale verification of distributed synchronisation
• Accelerating SpMV multiplication in probabilistic model checkers using GPUs
• On the Complexity of Reachability in Parametric Markov Decision Processes
• A counter abstraction technique for verifying properties of probabilistic swarm systems
• Automaton-ABC: a statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models
• Quantitative controller synthesis for consumption Markov decision processes
• Scenario-based verification of uncertain MDPs
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• An algebraic method to fidelity-based model checking over quantum Markov chains
• The big-O problem
• Quantifying the resiliency of fail-operational real-time networked control systems
• Solving systems of bilinear equations for transition rate reconstruction
• Fine-tuning the odds in Bayesian networks
• Automated verification and synthesis of stochastic hybrid systems: a survey
• Are parametric Markov chains monotonic?
• Sequential convex programming for the efficient verification of parametric MDPs
• Out of control: reducing probabilistic models by control-state elimination
• Of cores: a partial-exploration framework for Markov decision processes
• Synthesizing optimal bias in randomized self-stabilization
• Simple strategies in multi-objective MDPs
• Multi-cost bounded tradeoff analysis in MDP
• Title not available (Why is that?)
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Exact quantitative probabilistic model checking through rational search
• Enhancing probabilistic model checking with ontologies
• Probabilistic analysis of dynamic fault trees using HOL theorem proving
• Moment-based analysis of Bayesian network properties
• Title not available (Why is that?)
• Abstract model repair for probabilistic systems
• On computing the total variation distance of hidden Markov models
• Task-aware verifiable RNN-based policies for partially observable Markov decision processes

This page was built for software: Storm