A Fixpoint Semantics of Event Systems with and without Fairness Assumptions

Simple item page
dc.creatorBarradas, Hector Ruiz
dc.creatorBert, Didier
dc.date2005-12-21
dc.date.accessioned2026-07-07T06:53:52Z
dc.date.available2026-07-07T06:53:52Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0512082
dc.identifierhttp://arxiv.org/abs/cs/0512082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105741
dc.subjectLogic in Computer Science
dc.titleA Fixpoint Semantics of Event Systems with and without Fairness Assumptions
dc.typetext

Files

Collections

arXiv