By Cindy Eisner, Dana Fisman

This ebook describes the valuables Specification Language PSL, lately standardized as IEEE general 1850-2005. PSL was once built to meet the subsequent necessities: effortless to benefit, write, and skim; concise syntax; conscientiously well-defined formal semantics; expressive strength, allowing the specification for a wide classification of genuine global layout homes; identified effective underlying algorithms in simulation, in addition to formal verification. simple positive aspects are lined, in addition to complex subject matters similar to using PSL in multiply-clocked designs. an entire bankruptcy is dedicated to universal mistakes, collected during the authors' a long time of expertise in utilizing and instructing the language.

Show description

Read or Download A Practical Introduction to PSL (Series on Integrated Circuits and Systems) PDF

Best introduction books

Exceptional Learners: An Introduction to Special Education.

Unprecedented inexperienced persons is an exceptional advent to the features of outstanding freshmen and their schooling, emphasizing lecture room practices in addition to the mental, sociological, and scientific points of disabilities and giftedness. in line with this period of responsibility, all discussions and examples of academic practices are grounded in a legitimate study base.

Introduction to avionics systems

Creation to Avionic platforms, moment variation explains the foundations and conception of contemporary avionic structures and the way they're applied with present expertise for either civil and armed forces plane. The platforms are analysed mathematically, the place acceptable, in order that the layout and function may be understood.

Extra info for A Practical Introduction to PSL (Series on Integrated Circuits and Systems)

Example text

The Foundation Language (FL), which we focus on in this book, uses this approach, and thus throughout most of this book we shall be interested in whether or not a particular PSL property holds on a particular trace. The Foundation Language is suitable for both static (formal) and dynamic (simulation-based) verification. Another approach, used by the Optional Branching Extension (OBE), uses a tree structure that represents multiple paths. This approach is applicable only to formal verification, and is touched on very briefly in Chapter 11.

1b matches 1, but not 2. 1b) Fig. 3a. 3a the current cycle of the left-hand side (req in && next gnt) is the same as the current cycle of the right-hand side (because they are connected by the Boolean operator ->). Thus, the current cycle of gnt (which is the operand of a next operator) is the same as the current cycle of the SERE (which is also the operand of a next operator). 3a is not in the simple subset of PSL discussed in Chapter 9. 3b. Now a single next operator is applied to both gnt and the SERE, which are both operands of the -> operator.

On the contrary, there are many efficient implementations of PSL in which the always operator does not create, spawn, or in any other way generate actual multiple instances. Still, the term “multiple instances” is a good way to gain intuition about how the always operator works, and a naive and inefficient implementation may well generate multiple instances of a checker or of a process. Getting back to our main point, consider the assertion assert always (a -> next b);. The current cycle of always (a -> next b) is 0.

Download PDF sample

Rated 4.62 of 5 – based on 7 votes