Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems

Abstract EN

A relation called approximate bisimulation is proposed to achieve behavior and structure optimization for a type of high-level datapath whose data exchange processes are expressed by nonlinear polynomial systems.

The high-level datapaths are divided into small blocks with a partitioning method and then represented by polynomial transition systems.

A standardized form based on Ritt-Wu’s method is developed to represent the equivalence relation for the high-level datapaths.

Furthermore, we establish an approximate bisimulation relation within a controllable error range and express the approximation with an error control function, which is processed by Sostools.

Meanwhile, the error is controlled through tuning the equivalence restrictions.

An example of high-level datapaths demonstrates the efficiency of our method.