Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
THE CONCURRENCY COLUMN BRICS, Department of Computer Science
 

Summary: THE CONCURRENCY COLUMN
BY
LUCA ACETO
BRICS, Department of Computer Science
Aalborg University, 9220 Aalborg , Denmark
Fluca@cs.auc.dk, Fhttp://www.cs.auc.dk/~luca/BEATCS
Fairness is an important concept that appears repeatedly in various forms in
different areas of computer science, and plays a crucial role in the semantics
and verification of reactive systems. Entire books are devoted to the notion
of fairness--see, for instance, the monograph by Nissim Francez published
in 1986--, and researchers in our community have painstakingly developed
a taxonomy of various fairness properties that appear in the literature, such
as unconditional fairness, weak fairness, strong fairness, and so on. This
research is definitely important in light of the plethora of notions of fairness
that have been proposed and studied in the literature.
But when is a temporal property expressing a fairness requirement? The
authors of this column have recently developed a very satisfying answer to
this fundamental question by offering three equivalent characterizations of
"fairness properties" in the setting of linear-time temporal logic: a language-
theoretic, a topological, and a game-theoretic characterization. This survey

  

Source: Aceto, Luca - School of Computer Science, Reykjavk University

 

Collections: Mathematics; Computer Technologies and Information Sciences