Stats

  • Locked Locked
  • Replies 2
  • Subscribers 64
  • Views 13847
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

PSL Fairness Assertions

archive

Hi.....

What is fairness and starvation in verification and how i can check this fairness problems with assertions?

Thanks


Originally posted in cdnusers.org by vlsi_dude

  • Hi:

    In PSL/SVA, there is a type of assertions called liveness assertion. Liveness assertion is very good to check fairness and starvation. Let me give a simple example. If you want to check for a round robin arbiter starvation, you can capture the assertion in English as "if channel A gets a request, it eventually needs to be granted". Then you can write assertion like:

    // psl reqA |-> eventually gntA;

    In SVA, reqA |-> ##[0:$] gntA;

    Does this make sense to you?

    Bin


    Originally posted in cdnusers.org by binju

  • Thanks Bin

    I got it what i wanted to know.

    Thanks again


    Originally posted in cdnusers.org by vlsi_dude

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.