Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
From MaRDI portal
Recommendations
- SMT-based bisimulation minimisation of Markov models
- Finite-horizon bisimulation minimisation for probabilistic systems
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- Compositional bisimulation minimization for interval Markov decision processes
- Probabilistic bisimulations for PCTL model checking of interval MDPs
Cited in
(32)- Parity game reductions
- Out of control: reducing probabilistic models by control-state elimination
- Probabilistic model checking of complex biological pathways
- An efficient algorithm to determine probabilistic bisimulation
- Compositional bisimulation minimization for interval Markov decision processes
- Finite-horizon bisimulation minimisation for probabilistic systems
- Deciding probabilistic automata weak bisimulation: theory and practice
- SMT-based bisimulation minimisation of Markov models
- On Abstraction of Probabilistic Systems
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Efficient CTMC Model Checking of Linear Real-Time Objectives
- The how and why of interactive Markov chains
- Bisimulations meet PCTL equivalences for probabilistic automata
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- On the Minimisation of Acyclic Models
- Three-valued abstraction for probabilistic systems
- Probabilistic bisimulations for PCTL model checking of interval MDPs
- Statistical model checking of stochastic component-based systems
- Efficient Coalgebraic Partition Refinement
- Efficient and modular coalgebraic partition refinement
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- On divergence-sensitive weak probabilistic bisimilarity
- Equivalence checking 40 years after: a review of bisimulation tools
- Automatically finding the right probabilities in Bayesian networks
- A spectrum of approximate probabilistic bisimulations
- Bisimulation minimization and symbolic model checking
- Explainability is a game for probabilistic bisimilarity distances
- Branching bisimulation congruence for probabilistic systems
- Model checking finite-horizon Markov chains with probabilistic inference
- Minimization of probabilistic models of programs
- Performability assessment by model checking of Markov reward models
This page was built for publication: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758103)
