A Fixpoint Semantics of Event Systems with and without Fairness Assumptions

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for deriving "leads-to" properties are proved in this general framework. The general framework is instantiated to minimal progress and weak fairness assumptions and similar results are obtained. We show the power of these results by deriving sufficient conditions for "leads-to" under minimal progress proving soundness of proof obligations without reasoning over state-traces.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Fixpoint Semantics of Event Systems with and without Fairness Assumptions 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 A Fixpoint Semantics of Event Systems with and without Fairness Assumptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fixpoint Semantics of Event Systems with and without Fairness Assumptions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-421965

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.