# A Practical Introduction to PSLThe Simple Subset

A Practical Introduction to PSL: The Simple Subset [Previously, in Section 3.4, we saw Assertion 3.3a (repeated here as Assertion 9.1a), in which, if a is asserted at cycle N, we must look ahead to cycle N + 6 to see whether b holds in order to know whether or not we require c to be asserted at N and d to be asserted at N + 2. Such an assertion is not a part of the simple subset of PSL. In the simple subset, time flows from left to right through the property, in the following way: considering each Boolean expression and each SERE as an atomic entity, if we need to know the value of such an entity at cycle M, then the value of everything to the right of the entity need not be known before cycle M.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# A Practical Introduction to PSLThe Simple Subset

1 page

/lp/springer-journals/a-practical-introduction-to-psl-the-simple-subset-r63aN0C604
Publisher
Springer US
ISBN
978-0-387-35313-5
Pages
101 –102
DOI
10.1007/978-0-387-36123-9_9
Publisher site
See Chapter on Publisher Site

### Abstract

[Previously, in Section 3.4, we saw Assertion 3.3a (repeated here as Assertion 9.1a), in which, if a is asserted at cycle N, we must look ahead to cycle N + 6 to see whether b holds in order to know whether or not we require c to be asserted at N and d to be asserted at N + 2. Such an assertion is not a part of the simple subset of PSL. In the simple subset, time flows from left to right through the property, in the following way: considering each Boolean expression and each SERE as an atomic entity, if we need to know the value of such an entity at cycle M, then the value of everything to the right of the entity need not be known before cycle M.]

Published: Jan 1, 2006