Abstract
While the Boolean layer consists of Boolean expressions that hold or do not hold at a given cycle, the temporal layer provides a way to describe relationships between Boolean expressions over time. A PSL assertion typically looks in only one direction — forwards from the first cycle (although it is possible to look backwards using built-in functions such as prev(), rose() and fell()). Thus, the simple PSL assertion assert a; states that a should hold at the very first cycle, while the PSL assertion assert always a; states that a should hold at the first cycle and at every cycle following the first cycle — that is, at every cycle.
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
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2006). Basic Temporal Properties. In: A Practical Introduction to PSL. Series on Integrated Circuits and Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36123-9_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-36123-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35313-5
Online ISBN: 978-0-387-36123-9
eBook Packages: EngineeringEngineering (R0)