5. If it is known that Possibly() is true and Definitely() is false in an execution, then...
Question:
5. If it is known that Possibly(φ) is true and Definitely(φ) is false in an execution, then what can be said about Possibly(φ) and about Definitely(φ) in terms of the paths of the state lattice of that execution?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Distributed Computing Principles Algorithms And Systems
ISBN: 9780521876346
1st Edition
Authors: Ajay D. Kshemkalyani, Mukesh Singhal
Question Posted: