Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
From MaRDI portal
(Redirected from Publication:5111641)
Computational methods in Markov chains (60J22) 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)
Recommendations
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- Computing probabilistic bisimilarity distances via policy iteration
- On the complexity of computing probabilistic bisimilarity
- Computing probabilistic bisimilarity distances for probabilistic automata
- Deciding probabilistic bisimilarity distance one for probabilistic automata
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1157649 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3294139 (Why is no real title available?)
- A calculus of communicating systems
- A lattice-theoretical fixpoint theorem and its applications
- A polynomial time primal network simplex algorithm for minimum cost flows
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Bisimulation through probabilistic testing
- Computing probabilistic bisimilarity distances via policy iteration
- Labelled Markov processes.
- On Nonterminating Stochastic Games
- On the complexity of computing probabilistic bisimilarity
- On-the-fly exact computation of bisimilarity distances
- Stochastic Games
- The Distribution of a Product from Several Sources to Numerous Localities
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- The complexity of stochastic games
Cited in
(14)- Relative approximate bisimulations for fuzzy picture automata
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- On-the-fly computation of bisimilarity distances
- Complete axiomatization for the bisimilarity distance on Markov chains
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- On the complexity of computing probabilistic bisimilarity
- On the metric-based approximate minimization of Markov chains
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- On-the-fly exact computation of bisimilarity distances
- Linear distances between Markov chains
- Computing probabilistic bisimilarity distances via policy iteration
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- A monoidal view on fixpoint checks
- Computing bisimilarity metrics for probabilistic timed automata
This page was built for publication: Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111641)
