Testing preorders for probabilistic processes.
type: Item
instance of: scholarly article
title: Testing preorders for probabilistic processes.
zbMATH Open document ID: 1045.68564
author: Rance Cleaveland
author: Zeynep Dayar
author: Scott A. Smolka
author: Shoji Yuen
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 1853073
zbMATH Keywords: probabilistic testing preorders
MaRDI profile type: Publication
full work available at URL: inco.1999.2808
OpenAlex ID: W2038373047
cites work: Testing preorders for probabilistic processes
cites work: Testing equivalences for processes
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
cites work: Bisimulation through probabilistic testing
cites work: Q4002642
cites work: Q3746875
cites work: Testing probabilistic automata
cites work: Composition and behaviors of probabilistic I/O automata
DOI: 10.1006/INCO.1999.2808
description: scientific article; zbMATH DE number 1853073