Computer Science – Logic in Computer Science
Scientific paper
2005-02-09
Computer Science
Logic in Computer Science
Scientific paper
In this report, we present a formal model of fair iteration of events for B event systems. The model is used to justify proof obligations for basic liveness properties and preservation under refinement of general liveness properties. The model of fair iteration of events uses the dovetail operator, an operator proposed by Broy and Nelson to model fair choice. The proofs are mainly founded in fixpoint calculations of fair iteration of events and weakest precondition calculus.
Barradas Hector Ruiz
Bert Didier
No associations
LandOfFree
Proof obligations for specification and refinement of liveness properties under weak fairness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof obligations for specification and refinement of liveness properties under weak fairness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof obligations for specification and refinement of liveness properties under weak fairness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-722103