A Practical Introduction to PSL (Series on Integrated by Cindy Eisner, Dana Fisman

By Cindy Eisner, Dana Fisman

This booklet describes the valuables Specification Language PSL, lately standardized as IEEE typical 1850-2005. PSL was once built to satisfy the next specifications: effortless to benefit, write, and skim; concise syntax; carefully well-defined formal semantics; expressive energy, allowing the specification for a wide category of genuine international layout houses; identified effective underlying algorithms in simulation, in addition to formal verification. easy good points are coated, in addition to complex issues comparable to using PSL in multiply-clocked designs. a whole bankruptcy is dedicated to universal error, collected during the authors' a long time of expertise in utilizing and educating the language.

Show description

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

Similar introduction books

Vault Career Guide to Investment Management

From the Vault occupation Library - from a breakdown of the buy-side of the finance - agencies that buy securities as investments - to fairness, mounted source of revenue, and foreign money markets, a glance on the occupation direction in funding administration.

Introduction to Mathematical Logic, Volume 1

Good judgment is usually known as the root of arithmetic: the philosopher reviews the categories of reasoning utilized in the person steps of an explanation. Alonzo Church used to be a pioneer within the box of mathematical good judgment, whose contributions to quantity conception and the theories of algorithms and computability laid the theoretical foundations of computing device technology.

Āryabhaṭīya of Āryabhaṭa: Critically Edited with Introduction and English Translation

Serious variation with English translation of Aryabhatiya, an historical Indian textual content in Sanskrit on Astronomy and arithmetic.

An Introduction to Sequential Dynamical Systems

Sequential Dynamical structures (SDS) are a category of discrete dynamical platforms which considerably generalize many facets of structures akin to mobile automata, and supply a framework for learning dynamical tactics over graphs. this article is the 1st to supply a accomplished advent to SDS. pushed by way of a number of examples and thought-provoking difficulties, the presentation bargains sturdy foundational fabric on finite discrete dynamical platforms which leads systematically to an creation of SDS.

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

Example text

2 The notion of time When a Boolean assertion is embedded in code that is being run, like in the simple assertions of Java and (simulated) VHDL, the notion of time need not be defined – an assertion is checked whenever the statement containing the assertion is executed. For the more complicated assertions of PSL, which first of all stand apart from the code (so that the notion of “execution” is foreign 20 Chapter 3. Some Philosophy to them) and which second of all span multiple time steps, the notion of time must be given more consideration.

The weak versions then waive the requirement that the terminating condition eventually occur, leaving only the requirement that nothing bad must happen. The eventually! operator, however, contains no idea of a bad “something”, only a terminating condition. 34 Chapter 4. Weak vs. Strong Temporal Operators Therefore, there is no way to weaken it without emptying it completely of meaning. , there is no strong version of the operators always and never, for the opposite reason. In the case of always and never, there is no terminating condition to waive.

PSL assumes that time is discrete, that is, that time consists of a sequence of evaluation cycles. The meaning of a PSL property is defined relative to such a sequence of cycles. In this book, we will refer to such a sequence of cycles as a trace. PSL does not dictate how time ticks – that is, it does not dictate how such a sequence of cycles is extracted from a design under verification. This means that the sequence of cycles as seen by two verification tools is not necessarily the same. For example, a cycle-based simulator sees a sequence of signal values calculated cycle-by-cycle, while an event-based simulator running on the same design sees a more detailed sequence of signal values.

Download PDF sample

Rated 4.48 of 5 – based on 26 votes