Cited in
(31)- Model Checking Quantitative Linear Time Logic
- Minimal counterexamples for linear-time probabilistic verification
- Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
- Observing continuous-time MDPs by 1-clock timed automata
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Model checking probabilistic systems
- Undecidability results for distributed probabilistic systems
- Game-Based Probabilistic Predicate Abstraction in PRISM
- CLAN
- GreatSPN 1.7
- ECDAR
- MRMC
- ProbDiVinE
- COMICS
- DiPro
- Ymer
- Delta Sigma
- HASL
- Rapture
- Rabinizer
- Compositional probabilistic verification through multi-objective model checking
- Obligation Blackwell games and p-automata
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Algorithmic probabilistic game semantics. Playing games with automata
- On simulation-based probabilistic model checking of mixed-analog circuits
- Coupling and importance sampling for statistical model checking
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
- scientific article; zbMATH DE number 7649915 (Why is no real title available?)
- Verification of partial-information probabilistic systems using counterexample-guided refinements
This page was built for software: LiQuor
