Probabilistic bisimilarity as testing equivalence
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1231682 (Why is no real title available?)
- Algebraic laws for nondeterminism and concurrency
- Approximating labelled Markov processes
- Bisimulation for labelled Markov processes
- Bisimulation through probabilistic testing
- Characterising probabilistic processes logically (extended abstract)
- Domain theory, testing and simulation for labelled Markov processes
- Exploring probabilistic bisimulations. I
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Probabilistic logical characterization
- Testing Finitary Probabilistic Processes
- Testing equivalences for processes
- Testing preorders for probabilistic processes
- Testing probabilistic automata
Cited in
(12)- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- scientific article; zbMATH DE number 2086650 (Why is no real title available?)
- Bisimulation through probabilistic testing
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Formalisation of Probabilistic Testing Semantics in Coq
- Scalar Outcomes Suffice for Finitary Probabilistic Testing
- Testing probabilistic equivalence through reinforcement learning
- Proximity Oblivious Testing and the Role of Invariances
- Upper-expectation bisimilarity and Łukasiewicz \(\mu \)-calculus
- scientific article; zbMATH DE number 2038731 (Why is no real title available?)
- Bisimulations for probabilistic and quantum processes (invited paper)
- Equational axioms for probabilistic bisimilarity
This page was built for publication: Probabilistic bisimilarity as testing equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680507)