

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Professor: Vasudevan; Class: Electrical Machine Design; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Unknown 1989;
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Hardware Design Cycle
Specification
Gates
Transistors
Physical Design
Testing
Documentation/C/C++
Logic Sythesis
High level Sythesis
HDL: Cycle-accurate Concurrent Non-terminating
Concurreny in hardware involves a notion of non-determinism, as there is no apriori scheduling of the concurrent events. No interleaving/semaphores in this context.
RTL and Logic Synthesis stages of the cycle can be highly manual and requires tweaking. Formal verification is needed the most here, to check if functionality is maintained.
In Logic Synthesis, Equivalence Checking is commonly used.
Model Checking (1981) is almost never used in its explicit state-space form, eg. Intel uses STE (Symbolic Trajectory Evaluation) for its microprocessors.
Model Checking and Temporal Logics
A Kripke structure, M, can be used to represent the system as a State-Transition Graph (STG)
M = (S, R, L)
where S: set of states R: set of state-transition relations, SxS L: set of labels/atomic propositions
Example: Traffic Light
Red (r) 1 0 0 Green (g) 0 1 0 Yellow (y) 0 0 1
The corresponding STG is shown below.
The model checking query is expressed as
(M,s)╞ f
In words, does the state s of model M, satisfy the formula f? (Yes/No)
Find the set of states Z such that
Z={s: (M,s)╞ f }
The model checking query is now, Is s є Z?