scientific article; zbMATH DE number 7378553
From MaRDI portal
Publication:5009421
DOI10.4230/LIPIcs.CONCUR.2018.9MaRDI QIDQ5009421
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Unnamed Item ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation through probabilistic testing
- A polynomial time primal network simplex algorithm for minimum cost flows
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- A lattice-theoretical fixpoint theorem and its applications
- On the Translocation of Masses
- On the Complexity of Computing Probabilistic Bisimilarity
- Computing Game Metrics on Markov Decision Processes
- Bisimulation, modal logic and model checking games
- Computing Probabilistic Bisimilarity Distances via Policy Iteration
- On-the-Fly Exact Computation of Bisimilarity Distances
- Formal verification of timed properties of randomized distributed algorithms
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
- On Nonterminating Stochastic Games
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
This page was built for publication:
