Probabilistic Barbed Congruence

Electronic Notes in Theoretical Computer Science

Volumn 190, Issue 3, 2007, Pages 185-203

  Deng, Yuxin ^a   Du, Wenjie ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b SHANGHAI NORMAL UNIVERSITY   (China)

Author keywords

Axiomatisation; Barbed congruence; Observational equivalence; Probabilistic process calculus

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES;

AXIOMATISATION; BARBED CONGRUENCE; OBSERVATIONAL EQUIVALENCE; PROBABILISTIC PROCESS CALCULUS;

PROBABILITY;

EID: 34548260270     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.07.011     Document Type: Article

References (18)

1. L. Aceto, Z. Ésik, and A. Ingólfsdóttir. Equational axioms for probabilistic bisimilarity (preliminary report). Technical Report RS-02-6, BRICS, 2002
2. S. Andova. Probabilistic Process Algebra. PhD thesis, Eindhoven University of Technology, 2002
3. Andova S., Baeten J.C.M., and Willemse T.A.C. A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification. Proceedings of the 17th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 4137 (2006), Springer 327-342
4. Baeten J.C.M., Bergstra J.A., and Smolka S.A. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation 121 2 (1995) 234-255
5. Baier C., and Kwiatkowaska M.Z. Domain equations for probabilistic processes. Mathematical Structures in Computer Science 10 6 (2000) 665-717
6. Bandini E., and Segala R. Axiomatizations for probabilistic bisimulation. Proceedings of the 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science volume 2076 (2001), Springer 370-381
7. Deng Y., and Palamidessi C. Axiomatizations for probabilistic finite-state behaviors. Theoretical Computer Science 373 1-2 (2007) 92-114
8. Deng Y., Palamidessi C., and Pang J. Compositional reasoning for probabilistic finite-state behaviors. Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science volume 3838 (2005), Springer 309-337
9. Deng Y., van Glabbeek R., Hennessy M., Morgan C., and Zhang C. Remarks on testing probabilistic processes. Electronic Notes in Theoretical Computer Science 172 (2007) 359-397
10. Giacalone A., Jou C.-C., and Smolka S.A. Algebraic reasoning for probabilistic concurrent systems. Proceedings of IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods (1990) 453-459
11. Kwiatkowska M.Z., and Norman G. A testing equivalence for reactive probabilistic processes. Electronic Notes in Theoretical Computer Science 16 2 (1998) 114-132
12. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
13. Milner R. Communication and Concurrency (1989), Prentice-Hall
14. Milner R., and Sangiorgi D. Barbed bisimulation. Proceedings of the 19th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science volume 623 (1992), Springer 685-695
15. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992
16. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Deptartment of EECS, 1995
17. Segala R., and Lynch N.A. Probabilistic simulations for probabilistic processes. Proceedings of the 5th International Conference on Concurrency Theory. Lecture Notes in Computer Science volume 836 (1994), Springer 481-496
18. Stark E.W., and Smolka S.A. A complete axiom system for finite-state probabilistic processes. Proof, language, and interaction: essays in honour of Robin Milner (2000), MIT Press 571-595