Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
From MaRDI portal
Publication:5758103
DOI10.1007/978-3-540-71209-1_9zbMath1186.68296OpenAlexW1501881008MaRDI QIDQ5758103
Ivan S. Zapreev, David N. Jansen, Tim Kemna, Joost-Pieter Katoen
Publication date: 3 September 2007
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_9
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (23)
Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Model checking finite-horizon Markov chains with probabilistic inference ⋮ An efficient algorithm to determine probabilistic bisimulation ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ Unnamed Item ⋮ Parity game reductions ⋮ On Abstraction of Probabilistic Systems ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ On divergence-sensitive weak probabilistic bisimilarity ⋮ Statistical model checking of stochastic component-based systems ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains ⋮ Three-valued abstraction for probabilistic systems ⋮ On the Minimisation of Acyclic Models ⋮ Efficient CTMC Model Checking of Linear Real-Time Objectives ⋮ Probabilistic model checking of complex biological pathways ⋮ Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking ⋮ Performability assessment by model checking of Markov reward models ⋮ The How and Why of Interactive Markov Chains ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Efficient Coalgebraic Partition Refinement
Uses Software
This page was built for publication: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking