Testing preorders for probabilistic processes.

DOI10.1006/inco.1999.2808zbMath1045.68564OpenAlexW2038373047MaRDI QIDQ1854314

Shoji Yuen, Zeynep Dayar, Rance Cleaveland, Scott A. Smolka

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2808

zbMATH Keywords

probabilistic testing preorders

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Communication theory (94A05)

Related Items

Specification, testing and implementation relations for symbolic-probabilistic systems, Non-bisimulation-based Markovian behavioral equivalences, Fair testing, Testing probabilistic equivalence through reinforcement learning, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Determining asynchronous test equivalence for probabilistic processes, Composition and behaviors of probabilistic I/O automata, Algebraic theory of probabilistic and nondeterministic processes., Algebraic theory of probabilistic processes., Using schedulers to test probabilistic distributed systems, Model-based testing of probabilistic systems, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems, Testing from a stochastic timed system with a fault model, A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems, Probabilistic Analysis of Binary Sessions, \(\pi\)-calculus with noisy channels, Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity, Additive models of probabilistic processes

Cites Work

• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Testing equivalences for processes
• Composition and behaviors of probabilistic I/O automata
• Reactive, generative, and stratified models of probabilistic processes
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Testing preorders for probabilistic processes
• Testing probabilistic automata
• Unnamed Item
• Unnamed Item