Probabilistic bisimilarity as testing equivalence
type: Item
instance of: scholarly article
title: Probabilistic bisimilarity as testing equivalence
zbMATH Open document ID: 1380.68293
author: Yuan Feng
author: Yuxin Deng
published in: Information and Computation
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6807527
zbMATH Keywords: probabilistic processes
zbMATH Keywords: bisimilarity
zbMATH Keywords: testing equivalence
zbMATH Keywords: modal logic
MaRDI profile type: Publication
full work available at URL: j.ic.2017.09.014
OpenAlex ID: W2756502837
cites work: Testing preorders for probabilistic processes
cites work: Testing equivalences for processes
cites work: Characterising Probabilistic Processes Logically
cites work: Testing Finitary Probabilistic Processes
cites work: Bisimulation for labelled Markov processes
cites work: Approximating labelled Markov processes
cites work: Exploring probabilistic bisimulations. I
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Probabilistic logical characterization
cites work: Q4223011
cites work: Bisimulation through probabilistic testing
cites work: Q3992568
cites work: Q3907077
cites work: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
cites work: Testing probabilistic automata
cites work: Domain theory, testing and simulation for labelled Markov processes
DOI: 10.1016/J.IC.2017.09.014
description: scientific article; zbMATH DE number 6807527