Probabilistic bisimilarity as testing equivalence

Deng, Y; Feng, Y

Probabilistic bisimilarity as testing equivalence

Deng, Y Feng, Y

Permalink

Publication Type:: Journal Article
Citation:: Information and Computation, 2017, 257 pp. 58 - 64
Issue Date:: 2017-12-01

Closed Access

	Filename	Description	Size
	Probabilistic bisimilarity as testing equivalence.pdf	Published Version	270.79 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Deng, Y	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.date.issued	2017-12-01	en_US
dc.identifier.citation	Information and Computation, 2017, 257 pp. 58 - 64	en_US
dc.identifier.issn	0890-5401	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125351
dc.description.abstract	© 2017 Elsevier Inc. Larsen and Skou initiated the study of probabilistic bisimilarity and its characterisation in terms of tests. Later on, van Breugel et al. showed that, for labelled Markov processes with continuous state spaces, probabilistic bisimilarity nicely coincides with a simple notion of testing equivalence. Their proof employs advanced machinery from topology. In the discrete case of finite-state reactive probabilistic processes, we prove that coincidence result with an elementary and more accessible proof.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP160101652
dc.relation.ispartof	Information and Computation	en_US
dc.relation.isbasedon	10.1016/j.ic.2017.09.014	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Probabilistic bisimilarity as testing equivalence	en_US
dc.type	Journal Article
utslib.citation.volume	257	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	257	en_US

Abstract:

© 2017 Elsevier Inc. Larsen and Skou initiated the study of probabilistic bisimilarity and its characterisation in terms of tests. Later on, van Breugel et al. showed that, for labelled Markov processes with continuous state spaces, probabilistic bisimilarity nicely coincides with a simple notion of testing equivalence. Their proof employs advanced machinery from topology. In the discrete case of finite-state reactive probabilistic processes, we prove that coincidence result with an elementary and more accessible proof.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/125351