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