The metric analogue of weak bisimulation for probabilistic processes

Proceedings-Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 413-422

  Desharnais, Josée ^a   Jagadeesan, Radha ^b   Gupta, Vineet ^c   Panangaden, Prakash ^d  

^a UNIVERSITÉ LAVAL   (Canada)

^b LOYOLA UNIVERSITY CHICAGO   (United States)

^c Stratify Inc   (United States)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; INFORMATION ANALYSIS; LINEAR ALGEBRA; LINEAR PROGRAMMING; MARKOV PROCESSES; METRIC SYSTEM;

ALGEBRAIC LAWS;

PROBABILITY DISTRIBUTIONS;

EID: 0036052667     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2002.1029849     Document Type: Article

References (27)

1. Linear programming in infinite-dimensional spaces
2. Axiomatizing probabilistic processes: ACP with generative probabilities
3. Axiomatizations for probabilistic bisimulation
4. Testing preorders for probabilistic processes
5. A logical characterization of bisimulation for labeled Markov processes
6. Metrics for labeled Markov processes
7. Approximation of labeled Markov processes
8. Robust timed automata
9. A calculus for communicating systems with time and probabilities
10. Time and probability in formal design of distributed systems
11. Probabilistic propositional temporal logics
12. Fractals and self-similarity
13. Compositional testing preorders for probabilistic processes
14. Equivalences, congruences, and complete axiomatizations for probabilistic processes
15. Semantics of probabilistic programs
16. A probabilistic PDL
17. Bisimulation through probablistic testing
18. A probabilistic poly-time framework for protocol analysis
19. Weal bisimulation for probabilistic processes
20. Equivalences on observable processes
21. An algorithm for quantitative verification of probabilistic systems
22. Towards quantitative verification of probabilistic systems
23. Composition and behaviors for probabilistic I/O automata