Abstract
We propose a definition of the class of all fairness properties of concurrent systems. In this work, we introduce to the fair transition system, and then discuss the relation among safety property, liveness property and fairness property in the temporal logic of actions. On the way, we give a recent overview work on fairness in reactive and concurrent systems, and innovatively prove the relation among of the fairness. Furthermore, we consider a ring-based leader election protocol. Leader election is an important protocol in distributed computing. We have proven or verified that this protocol satisfies safety and liveness properties, and use the temporal logic of actions for formalization and specification.
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.
