APPROXIMATE TRACE EQUIVALENCE OF REAL-TIME LINEAR ALGEBRAIC TRANSITION SYSTEMS

APPROXIMATE TRACE EQUIVALENCE OF REAL-TIME LINEAR ALGEBRAIC TRANSITION SYSTEMS

Hui Zhang1, Jinzhao Wu2, Hongyan Tan3, Hao Yang1

1Chengdu Institute of Computer Application, Chinese Academy of Sciences, China

2Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis, Guangxi University for Nationalities, China

3Institute of Acoustics, Chinese Academy of Sciences, China

In allusion to data error and equivalence relation for software program design, the paper proposes approximate trace equivalence of real-time linear algebraic transition systems. Firstly, it leads real-time algebraic program into transition system and establishes real-time linear algebraic transition system. And then, it uses matrix norm and matrix singular value decomposition to analyse approximation of traces. Afterwards, it obtains approximate trace equivalence of real-time linear algebraic transition systems. Finally, the traffic light control vehicle flow system example shows that approximate trace equivalence of real-time algebraic transition systems can optimize real-time linear algebraic programs and reduce states.