Completed trace equivalence of inhomogeneous linear algebraic Hybrid Automata

Completed trace equivalence of inhomogeneous linear algebraic Hybrid Automata

Lei Huang1, 2, Zhi Liu2 

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

2Sichuan College of Architectural Technology, China

In order to reduce states of inhomogeneous linear algebraic Hybrid Automaton, the paper proposes completed trace equivalence of inhomogeneous linear algebraic Hybrid Automata. Firstly, it introduces inhomogeneous linear algebraic programs into Hybrid Automata and establishes inhomogeneous linear algebraic Hybrid Automata. And then, it uses mathematical computation and completed trace equivalence to get completed trace equivalence of inhomogeneous linear algebraic Hybrid Automata. Finally, the travel queue automata example shows that completed trace equivalence of inhomogeneous algebraic Hybrid Automata can reduce states.