• DocumentCode
    2909396
  • Title

    State chart refinement validation from approximately timed to cycle callable models

  • Author

    Findenig, Rainer ; Ecker, Wolfgang

  • Author_Institution
    Upper Austrian Univ. of Appl. Sci., Hagenberg, Austria
  • fYear
    2010
  • fDate
    29-30 Sept. 2010
  • Firstpage
    72
  • Lastpage
    75
  • Abstract
    Most of today´s designs use a top-down design flow in which hardware is first implemented at transaction level and, as soon as it´s functionality is verified, refined to a register transfer model which is conceptually a cycle true and cycle callable model. Traditionally, both the refinement and its validation are done by hand. We propose a design pattern for both the transaction-level and the cycle callable model that eases both steps: the refinement process is made more intuitive and verifying the cycle callable model is greatly simplified by automatically synchronizing the transaction-level model with the refined model.
  • Keywords
    logic design; sequential circuits; cycle callable models; cycle true models; refined model; register transfer model; state chart refinement validation; top-down design flow; transaction-level model; Computational modeling; Hardware; Synchronization; Time domain analysis; Time varying systems; Trajectory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System on Chip (SoC), 2010 International Symposium on
  • Conference_Location
    Tampere
  • Print_ISBN
    978-1-4244-8279-5
  • Type

    conf

  • DOI
    10.1109/ISSOC.2010.5625551
  • Filename
    5625551