Verification of Asynchronous Circuits using Timed Automata

نویسندگان

  • Marius Bozga
  • Jianmin Hou
  • Oded Maler
  • Sergio Yovine
چکیده

In this work we apply the timing veriication tool OpenKronos, which is based on timed automata, to verify correctness of numerous asynchronous circuits. The desired behavior of these circuits is speciied in terms of signal transition graphs (STG) and we check whether the synthesized circuits behave correctly under the assumption that the inputs satisfy the STG conventions and that the gate delays are bounded between two given numbers. Our results demonstrate the viability of the timed automaton approach for timing analysis of certain classes of circuits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling and Analysis of Asynchronous Circuits and Timing Diagrams Using Parametric Timed Automata

Many successful model checking methods have been applied to hardware design in real-time applications. In this paper, we apply Parametric Timed Automata (PTA) to model the delays of asynchronous circuits. The PTAs modelling the delays of asynchronous circuits fall into the so-called lower bound and upper bound automata (L/U automata) which are subclasses of general PTAs with a decidable reachab...

متن کامل

Timed verification of the generic architecture of a memory circuit using parametric timed automata

Using a variant of Clariso-Cortadella’s parametric method for verifying asynchronous circuits, we analyse some crucial timing behaviors of the architecture of SPSMALL memory, a commercial product of STMicroelectronics. Using the model of parametric timed automata and model checker HYTECH, we formally derive a set of linear constraints that ensure the correctness of the response times of the mem...

متن کامل

Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata

Using a variant of Clariso-Cortadella’s parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of some crucial timing behaviours of the architecture of SPSMALL memory. This allows us to check two different implementations of this architecture.

متن کامل

Timing analysis of asynchronous circuits using timed automata

In this paper we present a method for modeling asynchronous digital circuits by timed automata The constructed timed automata serve as mechanical and veri able objects for asynchronous sequential machines in the same sense that untimed automata do for synchronous machines These results combined with recent results concerning the analysis and synthesis of timed automata provide for the systemati...

متن کامل

Some Progress in the Symbolic Veri cation of Timed Automata

In this paper we discuss the practical di culty of analyzing the behavior of timed automata and report some results obtained using an experimental bdd based extension of kronos We have treated exam ples originating from timing analysis of asynchronous boolean networks and CMOS circuits with delay uncertainties and the results outperform those obtained by previous implementations of timed automa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2002