Partial Order Reduction in Verification of Wheel Structured Parameterized Circuits
نویسندگان
چکیده
It is known that many systems have the regular structure constructed from several kinds of basic modules. We focus on parameterized asynchronous circuits with a wheel structure, which consists of one kernel module and many identical symmetry modules,and aim at verifying such systems of arbitrary sizes. In this paper, we propose a fully automatic state enumeration procedure for wheel structured systems with an infinite number of symmetry modules based on the state representation using finite automata. We also apply a partial order reduction algorithm for the verification of the wheel structured systems in order to reduce the average computational costs, and demonstrate the efficiency of the proposed algorithm by several experimental results.
منابع مشابه
Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits
This paper proposes a partial order reduction algorithm for timed trace theoretic verification in order to detect both safety failures and timing failures of timed circuits efficiently. This algorithm is based on the framework of timed trace theoretic verification according to the original untimed trace theory. Consequently, its conformance checking supports hierarchical verification. Experimen...
متن کاملTimed Trace Theoretic Verification Using Partial Order Reduction
In this paper, we have extended the trace theoretic verification method with partial order reduction so that it can properly handle timed circuits and timed specification. The partial order reduction algorithm is obtained from the timed version of the Stubborn set method. The experimental results with the STARI circuits show that the proposed method works very efficiently.
متن کاملPartial Order Reduction for Timed Circuit Verification Based on Level Oriented Model
Using a level oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model data-path circuits. On the other hand, in order to use such a model for larger circuit, some technique to avoid the state explosion problem is essential. This paper first defines a level oriented formal model based on time Petri nets, a...
متن کاملAn Approach to Verification of Datapath Circuits
In order to easily verify timed asynchronous circuits including datapaths, this paper proposes an approach to verifying datapath circuits partially with a prescribed set of data values as well as some random values and verifying control circuits formally as usual. From the regularity of datapath circuits, this approach is expected to provide a good balance between the cost and quality of verifi...
متن کاملLevel Oriented Formal Model for Asynchronous Circuit Verification and its Efficient Analysis Method
Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001