The previous chapters were based on a relatively straight-forward understanding of how the Verilog simulator schedules and executes events. This chapter develops a more detailed model of the simulator, including the processing of a number of the more subtle timing semantics of the language. Topics include the simulator scheduling algorithm, non-deterministic aspects of the language, and non-blocking assignments.
The material in this chapter is meant to explain conceptually how Verilog simulators are expected to work. However, the presentation may not match any particular implementation. There are plenty of short-cuts, tricks, and go-fasts that are or could be implemented. Their mileage and software-engineering appropriateness may vary and are not the topic of the chapter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Advanced Timing. In: The Verilog® Hardware Description Language. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-85344-4_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-85344-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-84930-0
Online ISBN: 978-0-387-85344-4
eBook Packages: Springer Book Archive