Axiomatizations for Probabilistic Bisimulation

1. S. Andova. Process algebra with probabilistic choice. In Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601, pages 111–129, 1999.

   Chapter  Google Scholar 

2. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 122:234–255, 1995.

   Article  MathSciNet  Google Scholar 

3. M. Bernardo, L. Donatiello, and R. Gorrieri. Modeling and analyzing concurrent systems with MPA. In Proceedings of the Second Workshop on Process Algebras and Performance Modelling (PAPM), Erlangen, Germany, pages 175–189, 1994.

   Google Scholar 

4. A. Giacalone, C.C Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of the Working Conference on Programming Concepts and Methods (IFIP TC2), Sea of Galilee, Israel, 1990.

   Google Scholar 

5. R.J. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1):59–80, 1996.

   Article  Google Scholar 

6. H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proceedings of the 10th IEEE Symposium on Real-Time Systems, 1989.

   Google Scholar 

7. C.C. Jou and S.A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J.Proceedings of CONCUR 90, LNCS 458, pages 367–383, 1990.

   Google Scholar 

8. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Conference Record of the 16 ^th ACM Symposium on Principles of Programming Languages, pages 344–352, 1989.

   Google Scholar 

9. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.

   Google Scholar 

10. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In Proceedings of CONCUR 2000, LNCS 1877, pages 334–349, 2000.

    Chapter  Google Scholar 

11. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. Technical report MIT/LCS/TR-676. PhD thesis, MIT, Dept. of EECS, 1995.

    Google Scholar 

12. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Proceedings of CONCUR 94, LNCS 836, pages 481–496, 1994.

    Chapter  Google Scholar 

13. K. Seidel. Probabilistic communicating processes. Technical Report PRG-102, Ph.D. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1992.

    Google Scholar 

14. E.W. Stark and S.A. Smolka. A complete axiom system for finite-state probabilistic processes. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999.

    Google Scholar 

15. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pages 327–338, 1985.

    Google Scholar 

16. W. Yi and K.G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47–61, 1992.

    Google Scholar 

Download references