Skip to main content

Part of the book series: Mathematics and Its Applications () ((MASS,volume 52))

  • 163 Accesses

Abstract

In this chapter our discussion turns to a number of approaches to the design of circuits whose operation always remains correct independent of the delays in their elements. It has already become a tradition that such circuits, both combinational and sequential, are called aperiodic or self-timed circuits.

‘What is the distance between Haleb and Damascus?’ they asked a stranger.

He said: ‘Twelve … days journey - six there and six back.’

Abu’l-Faraj (1226–1286)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Varshavsky, V.I. (1990). Aperiodic Circuits. In: Varshavsky, V.I. (eds) Self-Timed Control of Concurrent Processes. Mathematics and Its Applications (Soviet Series), vol 52. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0487-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0487-3_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6705-8

  • Online ISBN: 978-94-009-0487-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics