Fairness for Infinitary Control

  • Jochen Hoenicke
  • Andreas Podelski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9360)


In 1988, Olderog and Apt developed a fair scheduler for a system with finitely many processes based on the concept of explicit scheduling. In 2010, Hoenicke, Olderog, and Podelski extended the fair scheduler from static to dynamic control. In systems with dynamic control, processes can be created dynamically. Thus, the overall number of processes can be infinite, but the number of created processes is finite at each step of an execution of the system. In this paper we extend the fair scheduler to infinitary control. In systems with infinitary control, the number of created processes can be infinite. The fair scheduler for infinitary control is perhaps interesting for its apparent unfairness: instead of treating all processes equal, the scheduler discriminates each process against finitely many other processes. However, it also privileges each process against infinitely many other processes (in fact, all but finitely many).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Apt, K.-R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 2nd edn., Springer (1997)Google Scholar
  2. 2.
    Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixedpoints. In: POPL, pp. 238–252. ACM (1977)Google Scholar
  3. 3.
    Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Comm. of the ACM 18, 453–457 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Francez, N.: Fairness. Springer-Verlag, New York (1986)Google Scholar
  5. 5.
    Hoenicke, J., Olderog, E.-R., Podelski, A.: Fairness for dynamic control. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 251–265. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  6. 6.
    Olderog, E.R., Apt, K.R.: Fairness in parallel programs, the transformational approach. ACM TOPLAS 10, 420–455 (1988)CrossRefGoogle Scholar
  7. 7.
    Olderog, E.-R., Podelski, A.: Explicit fair scheduling for dynamic control. In: Dams, D., Hannemann, U., Steffen, M. (eds.) Concurrency, Compositionality, and Correctness. LNCS, vol. 5930, pp. 96–117. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  8. 8.
    Plotkin, G.: A structural approach to operational semantics. J. of Logic and Algebraic Programming 60–61, 17–139 (2004)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institut für InformatikUniversität FreiburgFreiburg im BreisgauGermany

Personalised recommendations