Testing preorders for probabilistic processes can be characterized by simulations

DOI10.1016/S0304-3975(01)00044-5zbMath0997.68082OpenAlexW2052170634MaRDI QIDQ1603706

Bengt Jonsson, Wang Yi

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00044-5

zbMATH Keywords

semanticsprobabilistic testingprobabilistic transition systemrefinement and simulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Remarks on Testing Probabilistic Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observation equivalence as a testing equivalence
• Verification of multiprocess probabilistic protocols
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Testing equivalences for processes
• Composition and behaviors of probabilistic I/O automata
• The complexity of probabilistic verification
• Probabilistic automata

This page was built for publication: Testing preorders for probabilistic processes can be characterized by simulations