Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 173012, 13 pages
http://dx.doi.org/10.1155/2015/173012
Research Article

Quantitative Analysis of Software Approximate Correctness

School of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China

Received 6 November 2014; Accepted 14 June 2015

Academic Editor: Fabio Tramontana

Copyright © 2015 Yanfang Ma. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. X. Shen, H. G. Zhang, and H. M. Wang, “Research and development of trusted computing,” Science China: Information Sciences, vol. 40, no. 2, pp. 139–166, 2010. View at Google Scholar
  2. H. W. Tao and Y. X. Chen, “Another metric model for trustworthiness of softwares based on partition,” in Quantitative Logic and Soft Computing 2010, vol. 82 of Advances in Intelligent and Soft Computing, pp. 695–705, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  3. K. Liu, Z. G. Shan, J. Wang et al., “Overview on major research plan of trustworthy software,” Bulletin of National Natural Science Foundation of China, vol. 3, pp. 145–151, 2008. View at Google Scholar
  4. K. G. Larsen, U. Fahrenberg, and C. Thrane, “Metrics for weighted transition systems: axiomatization and complexity,” Theoretical Computer Science, vol. 412, no. 28, pp. 3358–3369, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. H. Y. Pan, Y. Z. Cao, M. Zhang, and Y. Chen, “Simulation for lattice-valued doubly labeled transition systems,” International Journal of Approximate Reasoning, vol. 55, no. 3, pp. 797–811, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. H. Y. Pan, M. Zhang, H. Y. Wu, and Y. Chen, “Quantitative analysis of lattice-valued Kripke structures,” Fundamenta Informaticae, vol. 135, no. 3, pp. 269–293, 2014. View at Google Scholar · View at MathSciNet
  7. M. S. Ying, “Bisimulation indexes and their applications,” Theoretical Computer Science, vol. 275, no. 1-2, pp. 1–68, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. S. Ying and M. Wirsing, “Approximate bisimilarity,” in Algebraic Methodology and Software Technology: 8th International Conference, AMAST 2000 Iowa City, Iowa, USA, May 20–27, 2000 Proceedings, vol. 1816 of Lecture Notes in Computer Science, pp. 309–322, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  9. A. Girard and G. J. Pappas, “Approximation metrics for discrete and continuous systems,” IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 782–798, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science—Research and Development, vol. 28, no. 4, pp. 331–344, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. U. Fahrenberg and A. Legay, “The quantitative linear-time—branching-time spectrum,” Theoretical Computer Science, vol. 538, pp. 54–69, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y. X. Deng, R. van Glabbeek, M. Hennessy, and C. Morgan, “Testing finitary probabilistic processes,” in CONCUR 2009—Concurrency Theory, vol. 5710 of Lecture Notes in Computer Science, pp. 274–288, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  13. 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, pp. 443–458, Sea of Gallilee, Israel, 1990.
  14. A. Giacalone, C. C. Jou, and S. A. Smolka, “Probabilistic in processes: a algebraic/operational framework,” Tech. Rep. 88/20, Department of Computer Science, SUNY at Stony Brook, New York, NY, USA, 1988. View at Google Scholar
  15. L. Song, Y. X. Deng, and X. J. Cai, “Towards automatic measurement of probabilistic processes,” in Proceedings of the 7th International Conference on Quality Software (QSIC '07), pp. 50–59, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. X. Deng, T. Chothia, C. Palamidessi, and J. Pang, “Metrics for action-labelled quantitative transition systems,” Electronic Notes in Theoretical Computer Science, vol. 153, no. 2, pp. 79–96, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. A. K. Alves de Medeiros, W. M. P. van der Aalst, and A. J. M. M. Weijters, “Quantifying process equivalence based on observed behavior,” Data and Knowledge Engineering, vol. 64, no. 1, pp. 55–74, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Abate, “Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey,” Electronic Notes in Theoretical Computer Science, vol. 297, pp. 3–25, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. K. G. Larsen and A. Skou, “Bisimulation through probabilistic testing,” Information and Computation, vol. 94, no. 1, pp. 1–28, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  20. J. F. He and T. Hoare, “Equating bisimulation with refinement,” Tech. Rep., UNU-IIST, Macau, China, 2003. View at Google Scholar
  21. Y. F. Ma, M. Zhang, Y. X. Chen, and L. Chen, “Two-thirds simulation indexes and modal logic characterization,” Frontiers of Computer Science in China, vol. 5, no. 4, pp. 454–471, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. R. Milner, Communicating and Mobile Systems: The π-Calculus, Cambridge University Press, Cambridge, UK, 2001.
  23. M. D. Ryan and B. Smyth, “Applied pi-calculus,” in Formal Models and Techniques for Analyzing Security Protocols, V. Cortier and S. Kremer, Eds., Ios Press, 2011. View at Google Scholar
  24. K. G. Larsen, Context-dependent bisimulation between process [Doctor of Philosophy University of Edinburgh], Aalborg University Centre, Strandvejen, Denmark, 1986.
  25. Y. F. Ma and M. Zhang, “Topological construction of parameterized bisimulation limit,” Electronic Notes in Theoretical Computer Science, vol. 257, pp. 55–70, 2009. View at Publisher · View at Google Scholar
  26. Y. Ma, M. Zhang, and Y. Chen, “Formal description of software dynamic correctness,” Journal of Computer Research and Development, vol. 50, no. 3, pp. 626–635, 2013. View at Google Scholar · View at Scopus
  27. M. Ying, Topology in Processes Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs, Springer, New York, NY, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  28. R. Milner, Communication and Concurrency, Prentice Hall, New York, NY, USA, 1989.
  29. G. D. Plotkin, “A structural approach to operational semantics,” Tech. Rep. DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981. View at Google Scholar
  30. R. Engelking, General Topology, Polish Scientific, Warszawa, Poland, 1977. View at MathSciNet
  31. R. J. van Glabbeek, S. A. Smolka, and B. Steffen, “Reactive, generative, and stratified models of probabilistic processes,” Information and Computation, vol. 121, no. 1, pp. 59–80, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  32. S. A. Smolka and B. Steffen, “Priority as extremal probability,” in Proceedings of the Theories of Concurrency: Unification and Extension (CONCUR '90), pp. 456–466, August 1990.
  33. R. Milner, “Calculi for synchrony and asynchrony,” Theoretical Computer Science, vol. 25, no. 3, pp. 267–310, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. M. S. Ying, “Additive models of probabilistic processes,” Theoretical Computer Science, vol. 275, no. 1-2, pp. 481–519, 2002. View at Publisher · View at Google Scholar · View at Scopus