@INPROCEEDINGS{HOP10,
  AUTHOR          = {J. Hoenicke and E.-R. Olderog and A. Podelski},
  TITLE           = {Fairness for Dynamic Control},
  EDITOR          = {J. Esparza and R. Majumdar }, 
  BOOKTITLE       = {Tools and Algorithms for the Construction and Analysis of 
Systems (TACAS) },
  SERIES          = {Lecture Notes in Computer Science},
  PUBLISHER       = {Springer-Verlag},
  YEAR            = {2010},
  NOTE            ={To appear},
  subproject = {S2},
  access={restricted},
  bibtex={hoenicke.tacas10.bib},
  pdf={hoenicke.tacas10.pdf},
  abstract={Already in Lamport's bakery algorithm, integers are used for
            fair schedulers of concurrent processes.
            In this paper, we present the extension of a fair scheduler from 
            `static control' (the number of processes is fixed) to 
            `dynamic control' (the number of processes changes during 
             execution).  We believe that our results shed new light on the 
             concept of fairness in the setting of dynamic control.},
}