References

  1. J. H. Conway (1971): Regular Algebra and Finite Machines. Chapman and Hall, Mathematics series.
  2. Y. Deng, R. J. van Glabbeek, M. Hennessy, C. Morgan & C. Zhang (2007): Remarks on Testing Probabilistic Processes. Electr. Notes Theor. Comput. Sci. 172, pp. 359–397, doi:10.1016/j.entcs.2007.02.013.
  3. Y. Deng & R. Van Glabbeek (2007): Characterising testing preorders for finite probabilistic processes. In: In LICS’07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 313–325, doi:10.1109/LICS.2007.15.
  4. J. Desharnais, B. Möller & G. Struth (2006): Kleene algebra with domain. ACM Trans. Comput. Logic 7, pp. 798–833, doi:10.1145/1183278.1183285.
  5. C. A. R. Hoare, B. Möller, G. Struth & I. Wehrman (2011): Concurrent Kleene Algebra and its Foundations. Journal of Logic and Algebraic Programming 80, pp. 266–296, doi:10.1016/j.jlap.2011.04.005.
  6. C. B. Jones (1981): Development methods for computer programs including a notion of interference. Technical Monograph. Programming Research Group, Oxford University Computing Laboratory. Available at http://books.google.com.au/books?id=zjguSwAACAAJ.
  7. S. C. Kleene (1951): Representation of Events in Nerve Nets and Finite Automata. Automata Studies.
  8. A. Komuravelli, C. S. Pasareanu & E. M. Clarke (2012): Assume-Guarantee Abstraction Refinement for Probabilistic Systems. CoRR abs/1207.5086. Available at http://arxiv.org/abs/1207.5086, doi:10.1007/978-3-642-31424-7_25.
  9. D. Kozen (1994): A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput. 110(2), pp. 366–390, doi:10.1006/inco.1994.1037.
  10. D. Kozen (1997): Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19, pp. 427–443, doi:10.1145/256167.256195.
  11. D. Kozen (2000): On Hoare logic and Kleene algebra with tests. Trans. Computational Logic 1(1), pp. 60–76, doi:10.1145/343369.343378.
  12. D. Kozen (2003): Kleene Algebras with Tests and the Static Analysis of Programs. Technical Report TR2003-1915. Computer Science Department, Cornell University.
  13. M. Kwiatkowska, G. Norman, D. Parker & H. Qu (2010): Assume-Guarantee verification for probabilistic systems. In: Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'10. Springer-Verlag, Berlin, Heidelberg, pp. 23–37, doi:10.1007/978-3-642-12002-2_3.
  14. N. A. Lynch, R. Segala & F. W. Vaandrager (2003): Compositionality for Probabilistic Automata. In: CONCUR, pp. 204–222, doi:10.1007/978-3-540-45187-7_14.
  15. A. McIver, T. M. Rabehaja & G. Struth (2011): On probabilistic Kleene algebras, automata and simulations. In: Proceedings of the 12th international conference on Relational and algebraic methods in computer science, RAMICS'11. Springer-Verlag, Berlin, Heidelberg, pp. 264–279. Available at http://dl.acm.org/citation.cfm?id=2018285.2018305, doi:10.1007/978-3-642-21070-9_20.
  16. A. K. McIver & C. C. Morgan (2004): Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science). SpringerVerlag.
  17. B. Möller (2007): Kleene getting lazy. Sci. Comput. Program. 65, pp. 195–214, doi:10.1016/j.scico.2006.01.010. Available at http://dl.acm.org/citation.cfm?id=1225317.1225705.
  18. M. O. Rabin (1976): Probabilistic Algorithms. Technical Report RC 6164 (#26545). IBM Research Division, San Jose, Yorktown, Zurich.
  19. A. Salomaa (1966): Two Complete Axiom Systems for the Algebra of Regular Events. J. ACM 13, pp. 158–169, doi:10.1145/321312.321326.
  20. S. Schneider (2012): Incorporating time to an integrated formal method. Available at http://www.nii.ac.jp/shonan/seminar017/files/2012/06/Slides1.pdf.
  21. R. Segala (1995): A Compositional Trace-Based Semantics for Probabilistic Automata. In: CONCUR, pp. 234–248, doi:10.1007/3-540-60218-6_17.
  22. R. Segala (1996): Testing Probabilistic Automata. In: CONCUR, pp. 299–314, doi:10.1007/3-540-61604-7_62.
  23. A. Silva, F. Bonchi, M. Bonsangue & J. Rutten (2011): Quantitative Kleene coalgebras. Inf. Comput. 209(5), pp. 822–849, doi:10.1016/j.ic.2010.09.007.
  24. E. W. Stark & S. A. Smolka (1996): A Complete Axiom System for Finite-State Probabilistic Processes. In: In Proof, Language, and Interaction: Essays in Honour of Robin Milner. MIT Press, pp. 571–595.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org