Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
DOI10.1016/j.entcs.2008.11.012zbMath1286.68306OpenAlexW2104860213WikidataQ62047482 ScholiaQ62047482MaRDI QIDQ5415660
Stefan Blom, Jaco van de Pol, Matthias Kuntz, Boudewijn R. Haverkort
Publication date: 13 May 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.11.012
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- Unnamed Item
- CCS expressions, finite state processes, and three problems of equivalence
- An implementation of an efficient algorithm for bisimulation equivalence
- Optimal state-space lumping in Markov chains
- Three Partition Refinement Algorithms
- Compositional performance modelling with the TIPPtool
- Symmetry Reduction for Probabilistic Model Checking
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Process algebra for performance evaluation
This page was built for publication: Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking