Advertisement

Asynchronous Circuits

  • Janusz A. Brzozowski
  • Carl-Johan H. Seger

Part of the Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-xvi
  2. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 1-21
  3. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 23-33
  4. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 35-43
  5. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 45-60
  6. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 61-81
  7. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 83-111
  8. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 113-141
  9. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 143-166
  10. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 167-185
  11. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 187-212
  12. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 213-240
  13. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 241-254
  14. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 255-273
  15. Janusz A. Brzozowski, Carl-Johan H. Seger
    Pages 275-311
  16. Janusz A. Brzozowski, Scott Hauck, Carl-Johan H. Seger
    Pages 313-366
  17. Back Matter
    Pages 367-404

About this book

Introduction

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.

Keywords

Alphabet Boolean algebra Boolean function CMOS Computer Transistor algorithms automata calculus complexity logic model checking regular expressions verification

Authors and affiliations

  • Janusz A. Brzozowski
    • 1
  • Carl-Johan H. Seger
    • 2
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-4210-9
  • Copyright Information Springer-Verlag New York 1995
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8698-1
  • Online ISBN 978-1-4612-4210-9
  • Series Print ISSN 0172-603X
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Biotechnology
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Aerospace
Engineering