Abstract
The relationship between alternative underlying semantics for temporal logics is studied. A number of constraints on the allowable sets of computation paths can be built into a logic to try to ensure that the abstract computation path semantics of a concurrent program accurately reflects essential aspects of ‘real’ concurrent programs. Three such constraints are suffix closure (Lamport, 1980), fusion closure (Pratt, 1979) and limit closure (Abrahamson, 1980). Another common constraint is that the set of paths be R-generable, i.e., generated by some binary relation (Manna and Pnueli, 1979). We show that each of the first three constraints is independent of the others, and their conjunction is precisely equivalent to the fourth constraint.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
