Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems
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 t...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2013-01-01
|
Series: | Advances in Mechanical Engineering |
Online Access: | https://doi.org/10.1155/2013/305636 |
id |
doaj-225cc70c0f4e45b88446a40879a8d92e |
---|---|
record_format |
Article |
spelling |
doaj-225cc70c0f4e45b88446a40879a8d92e2020-11-25T03:34:12ZengSAGE PublishingAdvances in Mechanical Engineering1687-81322013-01-01510.1155/2013/30563610.1155_2013/305636Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation SystemsHui Deng0Jinzhao Wu1Hongyan Tan2 School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Nanning, Guangxi 530006, China Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, ChinaA 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.https://doi.org/10.1155/2013/305636 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hui Deng Jinzhao Wu Hongyan Tan |
spellingShingle |
Hui Deng Jinzhao Wu Hongyan Tan Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems Advances in Mechanical Engineering |
author_facet |
Hui Deng Jinzhao Wu Hongyan Tan |
author_sort |
Hui Deng |
title |
Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems |
title_short |
Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems |
title_full |
Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems |
title_fullStr |
Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems |
title_full_unstemmed |
Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems |
title_sort |
approximate bisimulation for high-level datapaths in intelligent transportation systems |
publisher |
SAGE Publishing |
series |
Advances in Mechanical Engineering |
issn |
1687-8132 |
publishDate |
2013-01-01 |
description |
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. |
url |
https://doi.org/10.1155/2013/305636 |
work_keys_str_mv |
AT huideng approximatebisimulationforhighleveldatapathsinintelligenttransportationsystems AT jinzhaowu approximatebisimulationforhighleveldatapathsinintelligenttransportationsystems AT hongyantan approximatebisimulationforhighleveldatapathsinintelligenttransportationsystems |
_version_ |
1724560060529508352 |