An efficient algorithm to determine probabilistic bisimulation
DOI10.3390/A11090131zbMATH Open1461.68133OpenAlexW2889056252WikidataQ129300552 ScholiaQ129300552MaRDI QIDQ2633253FDOQ2633253
Authors: Jan Friso Groote, Jao Rivera Verduzco, Erik de Vink 
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11090131
Recommendations
- Deciding bisimilarity and similarity for probabilistic processes.
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- scientific article; zbMATH DE number 1927574
- An efficient algorithm for computing bisimulation equivalence
probabilistic bisimulationpartition-refinement algorithmprobabilistic labeled transition systemprobabilistic system with nondeterminism
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Three Partition Refinement Algorithms
- Deciding bisimilarity and similarity for probabilistic processes.
- Title not available (Why is that?)
- Polynomial time decision algorithms for probabilistic automata
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- CCS expressions, finite state processes, and three problems of equivalence
- Optimal state-space lumping in Markov chains
- Simple \(O(m \log n)\) time Markov chain lumping
- Modeling and analysis of communicating systems
- An overview of the mCRL2 toolset and its recent advances
- Exploring probabilistic bisimulations. I
- Title not available (Why is that?)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Stochastic model checking
- Simple bisimilarity minimization in \(O(m \log n)\) time
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
- Problem solving using process algebra considered insightful
- SMT-based bisimulation minimisation of Markov models
- A space-efficient simulation algorithm on probabilistic automata
Cited In (12)
- A Space-Efficient Probabilistic Simulation Algorithm
- Title not available (Why is that?)
- Lowerbounds for Bisimulation by Partition Refinement
- Equivalence checking 40 years after: a review of bisimulation tools
- From generic partition refinement to weighted tree automata minimization
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- An implementation of an efficient algorithm for bisimulation equivalence
- Explicit Hopcroft's trick in categorical partition refinement
- Generic partition refinement and weighted tree automata
- Title not available (Why is that?)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Efficient and modular coalgebraic partition refinement
Uses Software
This page was built for publication: An efficient algorithm to determine probabilistic bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633253)
