Abstract
This paper demonstrates completeness of a termination-rule for iterative programs with strongly fair nondeterminism, even when there are countably infinite options for the nondeterminism. This means that whenever a program is guaranteed to terminate under the assumption of strong fairness, then this termination can be proved via the strongly fair termination rule. A variant of the rule is also shown to be complete for extremely fair nondeterminism, as introduced by Pnueli (1983) and developed by Francez (1986).
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.
