Sequential Logic Notes
نویسنده
چکیده
Digital logic circuits composed of components such as AND, OR and NOT gates and that do not contain loops are what we refer to as stateless. In other words, the output that the circuit produces only depends on the current inputs, and does not depend on any previous inputs. These types of circuits are also referred to as combinatorial circuits. However, as we design computing systems, we have a need for our circuits to maintain some record of what has happened before. For example, as you type letters into your favorite editor, you want your editor to remember what you have typed. In your computer, these data are stored in a variety of memories (including your disk drive and your Random Access Memory, or RAM). In general, a circuit that maintains a memory of the past is referred to as a sequential logic circuit. At the heart of these circuits are logic devices called latches and flip-flops that store a single bit of data until the bit is overwritten at a later (often arbitrary) time. The concepts outlined in the following sections will be important for our later understanding of several key ideas, including:
منابع مشابه
Separation Logic Semantics for Communicating Processes
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the pi-calculus: dynamic change of alphabet is achieved by communication of channel names. Separation is exploited to ensure that each c...
متن کاملA Propositional Dynamic Logic for Concurrent Programs Based on the pi-Calculus
This work presents a Propositional Dynamic Logic (πDL) in which the programs are described in a language based on the π-Calculus without replication. Our goal is to build a dynamic logic that is suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case. We build a simple Kripke semantics for this logi...
متن کاملCompositionality in the Temporal Logic of Concurrent Systems an Rights Reserved
Since many of these notes are preliminary versions or may be published elsewhere, they have a limited distribution only and are not for review.. Copies of these notes are available from the author or the editor. In this paper we develop a new method for describlng in temporal logic in a compositional manner sequential composition, its iterated version (loops) and its interaction with (nested) p...
متن کاملAsynchronous Operators of Sequential Logic: Venjunction & Sequention
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd asynchronous operators of sequential logic venjunction sequention that can be a new w...
متن کاملLecture Notes on Sequential Programs and Compositional Reasoning
This lecture will focus on developing systematic logical reasoning principles for sequential programs. Writing programs with correctness specifications is one thing. But proving them to be correct is a different matter. Both are exceedingly useful, because the clear expression of our expectations on a program often already make it more correct as it will more likely occur to us if our expectati...
متن کاملA Program Logic for Bytecode
Program logics for bytecode languages such as Java bytecode or the .NET CIL can be used to apply Proof-Carrying Code concepts to bytecode programs and to verify correctness properties of bytecode programs. This paper presents a Hoare-style logic for a sequential bytecode kernel language similar to Java bytecode and CIL. The logic handles object-oriented features such as inheritance, dynamic met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010