On the temporal analysis of fairness

Dov Gabbay, Amir Pnueli, Saharon Shelali, Jonathan Stavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

498 Scopus citations

Abstract

The use of the temporal logic formalism for program reasoning is reviewed. Several aspects of responsiveness and fairness are analyzed, leading to the need for an additional temporal operator: the 'until' operator-U. Some general questions involving the 'until' operator are then discussed. It is shown that with the addition of this operator the temporal language becomes expressively complete. Then, two deductive systems DX and DUX are proved to be complete for the languages without and with the new operator respectively.

Original languageEnglish
Title of host publicationProceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980
PublisherAssociation for Computing Machinery
Pages163-173
Number of pages11
ISBN (Print)0897910117
DOIs
StatePublished - 28 Jan 1980
Event7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 - Las Vegas, United States
Duration: 28 Jan 198030 Jan 1980

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Conference

Conference7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980
Country/TerritoryUnited States
CityLas Vegas
Period28/01/8030/01/80

Bibliographical note

Publisher Copyright:
© 1980 ACM.

Fingerprint

Dive into the research topics of 'On the temporal analysis of fairness'. Together they form a unique fingerprint.

Cite this