Testing preorders for probabilistic processes can be characterized by simulations

Theoretical Computer Science

Volumn 282, Issue 1, 2002, Pages 33-51

  Jonsson, Bengt ^a   Yi, Wang ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Probabilistic testing; Probabilistic transition system; Refinement and simulation; Semantics

Indexed keywords

COMPUTER SIMULATION; PROBABILISTIC LOGICS; SEMANTICS;

TRANSITION SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037036299     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00044-5     Document Type: Conference Paper

References (35)

1. Observation equivalence as a testing equivalence
2. Testing equivalences and fully abstract models for probabilistic processes
3. Testing preorders for probabilistic processes
4. The complexity of probabilistic verification
5. Testing equivalences for processes
6. Algebraic reasoning for probabilistic concurrent systems
7. A calculus for communicating systems with time and probabilities
8. A logic for reasoning about time and reliability
9. Probabilistic temporal logics for finite and bounded models
10. Simulations between specifications of distributed systems
11. Testing and refinement for nondeterministic and probabilistic processes
12. Specification and refinement of probabilistic processes
13. Probabilistic extensions in: Process algebra
14. Compositional testing preorders for probabilistic processes
15. Fully abstract characterization of probabilistic may testing
16. A probabilistic pdl
17. Bisimulation through probabilistic testing
18. The anchored version of the temporal framework
19. Performance analysis using stochastic Petri nets
20. Verification of multiprocess probabilistic protocols
21. Reasoning about probabilistic behavior in concurrent systems
22. Probabilistic automata
23. A compositional trace-based semantics for probabilistic automata
24. Probabilistic simulations for probabilistic processes
25. Reactive, generative, and stratified models of probabilistic processes
26. An automata-theoretic approach to automatic program verification
27. Automatic verification of probabilistic concurrent finite-state programs
28. Composition and behaviors of probabilistic I/O-Automata
29. Algebraic reasoning for real-time probabilistic processes with uncertain information
30. Testing probabilistic and nondeterministic processes
31. Fully abstract characterizations of testing preorders for probabilistic processes