Table of Contents Author Guidelines Submit a Manuscript
Table of Contents Alerts

To receive news and publication updates for Mathematical Problems in Engineering, enter your email address in the box below.

Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 421926, 19 pages
http://dx.doi.org/10.1155/2013/421926
Research Article

Approximate Bisimulation and Optimization of Software Programs Based on Symbolic-Numeric Computation

Hui Deng1 and Jinzhao Wu2

1School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
2Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Nanning, Guangxi 530006, China

Received 9 April 2013; Revised 6 August 2013; Accepted 7 August 2013

Academic Editor: Yang Xu

Copyright © 2013 Hui Deng and Jinzhao Wu. 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. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic,” ACM Transactions on Programming Languages and Systems, vol. 8, no. 2, pp. 244–263, 1986. View at Google Scholar · View at Scopus
  2. R. van Glabbeek and U. Goltz, “Equivalence notions for concurrent systems and refinement of actions,” in Mathematical Foundations of Computer Science, vol. 379 of Lecture Notes in Computer Science, pp. 237–248, Springer, Berlin, Germany, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  3. M. Nielsen, “Models for concurrency,” in Mathematical Foundations of Computer Science, vol. 520 of Lecture Notes in Computer Science, pp. 43–46, 1991. View at Google Scholar
  4. T. A. Henzinger, “The theory of hybrid automata,” in Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pp. 278–292, 1996.
  5. R. Milner and D. Sangiorgi, “Barbed bisimulation,” in Automata, Languages and Programming, vol. 623 of Lecture Notes in Computer Science, pp. 685–695, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  6. Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems: Safety, Springer, New York, NY, USA, 1995.
  7. S. Sankaranarayanan, H. B. Sipma, and Z. Manna, “Non-linear loop invariant generation using groebner bases,” ACM SIGPLAN Notices, vol. 39, no. 1, pp. 318–329, 2004. View at Google Scholar · View at Scopus
  8. Y. H. Chen, B. C. Xia, L. Yang, N. J. Zhan, and C. C. Zhou, “Discovering non-linear ranking functions by solving semi- algebraic systems,” in Proceedings of the Theoretical Aspects of Computing (ICTAC '07), vol. 4711 of Lecture Notes in Computer Science, pp. 34–49, 2007.
  9. V. P. Mysore, Algorithmic algebraic model checking: hybrid automata and systems bilogy [Ph.D. thesis], New York University, New York, NY, USA, 2006.
  10. H. Deng, J. Z. Wu, and N. Zhou, “Approximate equivalence and optimization for high-level datapath,” Journal of Information and Computational Science, vol. 8, no. 16, pp. 4131–4142, 2011. View at Google Scholar · View at Scopus
  11. H. Deng and J. Z. Wu, “On approximate bisimulation equivalence for linear semi-algebraic transition systems,” Journal of Jilin University, vol. 43, no. 4, pp. 1052–1058, 2013. View at Google Scholar
  12. R. J. Van Glabbeek, “The linear time-branching time spectrum,” in Proceedings of the Theories of Concurrency: Unification and Extension (CONCUR '90), vol. 458 of Lecture Notes in Computer Science, pp. 278–297, 1990.
  13. 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
  14. G. J. Pappas, “Bisimilar linear systems,” Automatica, vol. 39, no. 12, pp. 2035–2047, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. A. J. van der Schaft, “Equivalence of dynamical systems by bisimulation,” Institute of Electrical and Electronics Engineers, vol. 49, no. 12, pp. 2160–2172, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  16. A. Girard and G. J. Pappas, “Approximate bisimulations for nonlinear dynamical systems,” in Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference (CDC-ECC '05), pp. 684–689, December 2005. View at Publisher · View at Google Scholar · View at Scopus
  17. A. A. Julius, “Approximate abstraction of stochastic hybrid automata,” in Hybrid Systems: Computation and Control, vol. 3927 of Lecture Notes in Computer Science, pp. 318–332, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. A. Girard and G. J. Pappas, “Approximate bisimulation relations for constrained linear systems,” Automatica, vol. 43, no. 8, pp. 1307–1317, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. H. J. Stetter, Numerical Polynomial Algebra, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa, USA, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  20. D. Bates, C. Peterson, and A. J. Sommese, “A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set,” Journal of Complexity, vol. 22, no. 4, pp. 475–489, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. R. P. Ge, “A filled function method for finding a global minimizer of a function of several variables,” Mathematical Programming, vol. 46, no. 2, pp. 191–204, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. R. P. Ge and Y. F. Qin, “A class of filled functions for finding global minimizers of a function of several variables,” Journal of Optimization Theory and Applications, vol. 54, no. 2, pp. 241–252, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. R. P. Ge and Y. F. Qin, “The globally convexized filled functions for global optimization,” Applied Mathematics and Computation, vol. 35, no. 2, pp. 131–158, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. X. Liu, “Finding global minima with a computable filled function,” Journal of Global Optimization, vol. 19, no. 2, pp. 151–161, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. L.-S. Zhang, C.-K. Ng, D. Li, and W.-W. Tian, “A new filled function method for global optimization,” Journal of Global Optimization, vol. 28, no. 1, pp. 17–43, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. Y. L. Zhang, The filled function method for solving constrained global optimization [Ph.D. thesis], Tianjin University, 2007.
  27. D. M. Wang, Selected Lectures in Symbolic Computation, Tsinghua University Press, Beijing, China, 2003.