skip to content
Asynchronous circuits Preview this item
ClosePreview this item
Checking...

Asynchronous circuits

Author: Janusz A Brzozowski; Carl-Johan H Seger
Publisher: New York : Springer-Verlag, ©1995.
Series: Monographs in computer science.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
Although asynchronous circuits date back to the early 1950s most of the digital circuits in use today are synchronous because, traditionally, asynchronous circuits have been viewed as difficult to understand and design. In recent years, however, there has been a great surge of interest in asynchronous circuits, largely through the development of new asynchronous design methodologies. This book provides a  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Janusz A Brzozowski; Carl-Johan H Seger
ISBN: 0387944206 9780387944203
OCLC Number: 1012455909
Description: 1 online resource
Contents: 1 Introductory Examples --
1.1 Logic Gates --
1.2 Performance Estimation --
1.3 RS Flip-Flop --
1.4 Dynamic CMOS Logic --
1.5 Divide-by-2 Counter --
1.6 Summary --
2 Mathematical Background --
2.1 Sets and Relations --
2.2 Boolean Algebra --
2.3 Ternary Algebra --
2.4 Directed Graphs --
3 Delay Models --
3.1 Environment Modes --
3.2 Gates with Delays --
3.3 Ideal Delays --
3.4 Inertial Delays --
4 Gate Circuits --
4.1 Properties of Gates --
4.2 Classes of Gate Circuits --
4.3 The Circuit Graph --
4.4 Network Models --
4.5 Models of More Complex Gates --
5 CMOS Transistor Circuits --
5.1 CMOS Cells --
5.2 Combinational CMOS Circuits --
5.3 General CMOS Circuits --
5.4 Node Excitation Functions --
5.5 Path Strength Models --
5.6 Capacitance Effects --
5.7 Network Model of CMOS Circuits --
6 Up-Bounded-Delay Race Models --
6.1 The General Multiple-Winner Model --
6.2 GMW Analysis and UIN Delays --
6.3 The Outcome in GMW Analysis --
6.4 Stable States and Feedback-State Networks --
6.5 GMW Analysis and Network Models --
6.6 The Extended GMW Model --
6.7 Single-Winner Race Models --
6.8 Up-Bounded Ideal Delays --
6.9 Proofs --
7 Ternary Simulation --
7.1 Introductory Examples --
7.2 Algorithm A --
7.3 Algorithm B --
7.4 Feedback-Delay Models --
7.5 Hazards --
7.6 Ternary Simulation and the GSW Model --
7.7 Ternary Simulation and the XMW Model --
7.8 Proofs of Main Results --
8 Bi-Bounded Delay Models --
8.1 Discrete Binary Models --
8.2 Continuous Binary Model --
8.3 Algorithms for Continuous Binary Analysis --
8.4 Continuous Ternary Model --
8.5 Discrete Ternary Model --
9 Complexity of Race Analysis --
9.1 Stable-State Reachability --
9.2 Limited Reachability --
10 Regular Languages and Finite Automata --
10.1 Regular Languages --
10.2 Regular Expressions --
10.3 Quotient Equations --
10.4 Finite Automata --
10.5 Equivalence and Reduction of Automata --
10.6 Nondeterministic Automata --
10.7 Expression Automata --
11 Behaviors and Realizations --
11.1 Motivation --
11.2 Behaviors --
11.3 Projections of Implementations to Specifications --
11.4 Relevant Words --
11.5 Proper Behaviors --
11.6 Realization --
11.7 Behavior Schemas --
11.8 Concluding Remarks --
12 Types of Behaviors --
12.1 Introductory Examples --
12.2 Fundamental-Mode Specifications --
12.3 Fundamental-Mode Network Behaviors --
12.4 Direct Behaviors --
12.5 Serial Behaviors --
13 Limitations of Up-Bounded Delay Models --
13.1 Delay-Insensitivity in Fundamental Mode --
13.2 Composite Functions --
13.3 Main Theorem for Fundamental Mode --
13.4 Delay-Insensitivity in Input/Output Mode --
13.5 Concluding Remarks --
14 Symbolic Analysis --
14.1 Representing Boolean Functions --
14.2 Symbolic Representations --
14.3 Deriving Symbolic Behaviors --
14.4 Symbolic Race Analysis --
14.5 Symbolic Verification of Realization --
14.6 Symbolic Model Checking --
15 Design of Asynchronous Circuits --
15.1 Introduction --
15.2 Fundamental-Mode Huffman Circuits --
15.3 Hollaar Circuits --
15.4 Burst-Mode Circuits --
15.5 Module Synthesis Using I-Nets --
15.6 Signal Transition Graphs --
15.7 Change Diagrams --
15.8 Protocols in DI Circuits --
15.9 Ebergen's Trace Theory Method --
15.10 Compilation of Communicating Processes --
15.11 Handshake Circuits --
15.12 Module-Based Compilation Systems --
15.13 DCVSL and Interconnection Modules --
15.14 Micropipelines --
15.15 Concluding Remarks --
List of Figures --
List of Tables --
List of Mathematical Concepts.
Series Title: Monographs in computer science.
Responsibility: Janusz A. Brzozowski, Carl-Johan H. Seger ; with a foreword by Charles E. Molnar.

Abstract:

Although asynchronous circuits date back to the early 1950s most of the digital circuits in use today are synchronous because, traditionally, asynchronous circuits have been viewed as difficult to understand and design. In recent years, however, there has been a great surge of interest in asynchronous circuits, largely through the development of new asynchronous design methodologies. This book provides a comprehensive theory of asynchronous circuits, including modelling, analysis, simulation, specification, verification, and an introduction to their design. It is based on courses given to graduate students and will be suitable for computer scientists and engineers involved in the research and development of asynchronous designs.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/1012455909> # Asynchronous circuits
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "1012455909" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    schema:about <http://dewey.info/class/621.395/e20/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/33183358#Topic/asynchronous_circuits> ; # Asynchronous circuits
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/33183358#Person/seger_carl_johan_h> ; # Carl-Johan H. Seger
    schema:copyrightYear "1995" ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/33183358#Person/brzozowski_janusz_a> ; # Janusz A. Brzozowski
    schema:datePublished "1995" ;
    schema:description "Although asynchronous circuits date back to the early 1950s most of the digital circuits in use today are synchronous because, traditionally, asynchronous circuits have been viewed as difficult to understand and design. In recent years, however, there has been a great surge of interest in asynchronous circuits, largely through the development of new asynchronous design methodologies. This book provides a comprehensive theory of asynchronous circuits, including modelling, analysis, simulation, specification, verification, and an introduction to their design. It is based on courses given to graduate students and will be suitable for computer scientists and engineers involved in the research and development of asynchronous designs."@en ;
    schema:description "1 Introductory Examples -- 1.1 Logic Gates -- 1.2 Performance Estimation -- 1.3 RS Flip-Flop -- 1.4 Dynamic CMOS Logic -- 1.5 Divide-by-2 Counter -- 1.6 Summary -- 2 Mathematical Background -- 2.1 Sets and Relations -- 2.2 Boolean Algebra -- 2.3 Ternary Algebra -- 2.4 Directed Graphs -- 3 Delay Models -- 3.1 Environment Modes -- 3.2 Gates with Delays -- 3.3 Ideal Delays -- 3.4 Inertial Delays -- 4 Gate Circuits -- 4.1 Properties of Gates -- 4.2 Classes of Gate Circuits -- 4.3 The Circuit Graph -- 4.4 Network Models -- 4.5 Models of More Complex Gates -- 5 CMOS Transistor Circuits -- 5.1 CMOS Cells -- 5.2 Combinational CMOS Circuits -- 5.3 General CMOS Circuits -- 5.4 Node Excitation Functions -- 5.5 Path Strength Models -- 5.6 Capacitance Effects -- 5.7 Network Model of CMOS Circuits -- 6 Up-Bounded-Delay Race Models -- 6.1 The General Multiple-Winner Model -- 6.2 GMW Analysis and UIN Delays -- 6.3 The Outcome in GMW Analysis -- 6.4 Stable States and Feedback-State Networks -- 6.5 GMW Analysis and Network Models -- 6.6 The Extended GMW Model -- 6.7 Single-Winner Race Models -- 6.8 Up-Bounded Ideal Delays -- 6.9 Proofs -- 7 Ternary Simulation -- 7.1 Introductory Examples -- 7.2 Algorithm A -- 7.3 Algorithm B -- 7.4 Feedback-Delay Models -- 7.5 Hazards -- 7.6 Ternary Simulation and the GSW Model -- 7.7 Ternary Simulation and the XMW Model -- 7.8 Proofs of Main Results -- 8 Bi-Bounded Delay Models -- 8.1 Discrete Binary Models -- 8.2 Continuous Binary Model -- 8.3 Algorithms for Continuous Binary Analysis -- 8.4 Continuous Ternary Model -- 8.5 Discrete Ternary Model -- 9 Complexity of Race Analysis -- 9.1 Stable-State Reachability -- 9.2 Limited Reachability -- 10 Regular Languages and Finite Automata -- 10.1 Regular Languages -- 10.2 Regular Expressions -- 10.3 Quotient Equations -- 10.4 Finite Automata -- 10.5 Equivalence and Reduction of Automata -- 10.6 Nondeterministic Automata -- 10.7 Expression Automata -- 11 Behaviors and Realizations -- 11.1 Motivation -- 11.2 Behaviors -- 11.3 Projections of Implementations to Specifications -- 11.4 Relevant Words -- 11.5 Proper Behaviors -- 11.6 Realization -- 11.7 Behavior Schemas -- 11.8 Concluding Remarks -- 12 Types of Behaviors -- 12.1 Introductory Examples -- 12.2 Fundamental-Mode Specifications -- 12.3 Fundamental-Mode Network Behaviors -- 12.4 Direct Behaviors -- 12.5 Serial Behaviors -- 13 Limitations of Up-Bounded Delay Models -- 13.1 Delay-Insensitivity in Fundamental Mode -- 13.2 Composite Functions -- 13.3 Main Theorem for Fundamental Mode -- 13.4 Delay-Insensitivity in Input/Output Mode -- 13.5 Concluding Remarks -- 14 Symbolic Analysis -- 14.1 Representing Boolean Functions -- 14.2 Symbolic Representations -- 14.3 Deriving Symbolic Behaviors -- 14.4 Symbolic Race Analysis -- 14.5 Symbolic Verification of Realization -- 14.6 Symbolic Model Checking -- 15 Design of Asynchronous Circuits -- 15.1 Introduction -- 15.2 Fundamental-Mode Huffman Circuits -- 15.3 Hollaar Circuits -- 15.4 Burst-Mode Circuits -- 15.5 Module Synthesis Using I-Nets -- 15.6 Signal Transition Graphs -- 15.7 Change Diagrams -- 15.8 Protocols in DI Circuits -- 15.9 Ebergen's Trace Theory Method -- 15.10 Compilation of Communicating Processes -- 15.11 Handshake Circuits -- 15.12 Module-Based Compilation Systems -- 15.13 DCVSL and Interconnection Modules -- 15.14 Micropipelines -- 15.15 Concluding Remarks -- List of Figures -- List of Tables -- List of Mathematical Concepts."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/33183358> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/33183358#Series/monographs_in_computer_science> ; # Monographs in computer science.
    schema:name "Asynchronous circuits"@en ;
    schema:productID "1012455909" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/1012455909#PublicationEvent/new_york_springer_verlag_1995> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/33183358#Agent/springer_verlag> ; # Springer-Verlag
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-0-387-94420-3> ;
    schema:url <https://doi.org/10.1007/978-1-4612-4210-9> ;
    schema:workExample <http://worldcat.org/isbn/9780387944203> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1012455909> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/33183358#Agent/springer_verlag> # Springer-Verlag
    a bgn:Agent ;
    schema:name "Springer-Verlag" ;
    .

<http://experiment.worldcat.org/entity/work/data/33183358#Person/brzozowski_janusz_a> # Janusz A. Brzozowski
    a schema:Person ;
    schema:familyName "Brzozowski" ;
    schema:givenName "Janusz A." ;
    schema:name "Janusz A. Brzozowski" ;
    .

<http://experiment.worldcat.org/entity/work/data/33183358#Person/seger_carl_johan_h> # Carl-Johan H. Seger
    a schema:Person ;
    schema:familyName "Seger" ;
    schema:givenName "Carl-Johan H." ;
    schema:name "Carl-Johan H. Seger" ;
    .

<http://experiment.worldcat.org/entity/work/data/33183358#Series/monographs_in_computer_science> # Monographs in computer science.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/1012455909> ; # Asynchronous circuits
    schema:name "Monographs in computer science." ;
    schema:name "Monographs in computer science" ;
    .

<http://experiment.worldcat.org/entity/work/data/33183358#Topic/asynchronous_circuits> # Asynchronous circuits
    a schema:Intangible ;
    schema:name "Asynchronous circuits"@en ;
    .

<http://worldcat.org/isbn/9780387944203>
    a schema:ProductModel ;
    schema:isbn "0387944206" ;
    schema:isbn "9780387944203" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.