Abstract
We proposed the approximate completed trace equivalence of Linear Algebra Transition Systems(LATS); it is inefficient to eliminate states. We use linear polynomial programs to describe system actions, and then the completed trace equivalence of inhomogeneous linear transition systems is established. Subsequently, it proposed the theory and algorithm of approximate completed trace equivalence of linear algebra transition systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Sun Y, Liu F, Mei S (2010) Polynomial approximate of a nonlinear system and its application topower system (I): theoretical justification. Electric Mach Control Harbin Univ Sci Technol 14(8):19–23
Yang H, Wu J, Zhang Z (2012) Approximate completed trace equivalence of inhomogeneous linear transition systems. IJACT 4(8):58–66
Zhang Z, Wu J-Z, Yang H Approximation to Linear Algebra Transition system. Communications in computer and information science, Vol 304. Emerging Intelligent Computing Technology and Applications, Part 10, pp 336–343
Klin B (2004) From bialgebraic semantics to congruence formats. In: Proceedings of the workshop on structural operational semantics, pp 3–37
Aceto L, Capobianco S, Ingólfsdóttir A (2007) On the existence of a finite base for complete trace equivalence over BPA with interrupt [Online]. Available: http://www.brics.dk/RS/07/5/BRICS-RS-07-5.pdf, February 2007
de Frutos-Escrig D, Gregorio-Rodríguez C, Palomino M (2008) Coinductive characterisations reveal nice relations between preorders and equivalences. Electron Notes Theoretical Comput Sci 212:149–162
Alvim M, Andrés M, Palamidessi C, van Rossum P (2010) Safe equivalences for security properties. Int Fed Inf Process 2010:55–70
Acknowledgments
This work is partly supported by Grants (HCIC201110 ,HCIC201101) of Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis Open Fund, the Fundamental Research Funds for the Central Universities of Lanzhou University, No. 860772, the National Natural Science Foundation of China under Grant No. 60973147, the Doctoral Fund of Ministry of Education of China under Grant No. 20090009110006, the Natural Science Foundation of Guangxi under Grant No. 2011 GXNSFA018154, the Science and Technology Foundation of Guangxi under Grant No. 10169-1, and Guangxi Scientific Research Project No.201012MS274.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, H., He, A., Zhang, Z., Yang, S., liu, Y. (2013). Approximate Completed Trace Equivalence of Linear Algebra Transition Systems. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)