Verification of Bounded Delay Asynchronous Circuits with Timed Traces

  • Authors:
  • Tomohiro Yoneda;Bin Zhou;Bernd-Holger Schlingloff

  • Affiliations:
  • -;-;-

  • Venue:
  • AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we extend the verification method based on the failure semantics of process algebra and the resulting trace theory by Dill et al. for bounded delay asynchronous circuits. We define a timed conformance relation between trace structures which allows to express both safety and responsiveness properties. In our approach, bounded delay circuits as well as their real-time properties are modelled by time Petri nets. We give an explicit state-exploration algorithm to determine whether an implementation conforms to a specification. Since for IO-conflict free specifications the conformance relation is transitive, this algorithm can be used for hierarchical verification of large asynchronous circuits. We describe the implementation of our method and give some experimental results which demonstrate its efficiency.