Access the full text.
Sign up today, get DeepDyve free for 14 days.
[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
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.