Skip to main content
SpringerLink
Log in

Proving fairness of schedulers

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 193))

Included in the following conference series:

Abstract

Considering explicit schedulers of nondeterministic programs, we propose a notion of cycles in infinite choice sequences and characterize fair sequences as being composed of cycles. We demonstrate that proof of fairness reduces to showing the existence of such cycles. Guarded commands are used to represent the scheduled actions and a proof technique is presented to discover conspiracies among them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • K R Apt: Ten years of Hoare's logic: a survey — Part I, ACM TOPLAS 3 (4) (Oct 1981) 431–483.

    Google Scholar 

  • K R Apt: Ten years of Hoare logic: a survey — Part II: Nondeterminism, TCS 28 (1/2) (1984) 83–109.

    Google Scholar 

  • K R Apt, E-R Olderog: Proof rules and transformations dealing with fairness, SCP 3 (1) (1983) 65–100.

    Google Scholar 

  • K R Apt, A Pneuli, J Stavi: Fair termination revisited — with delay, TCS 33 (1) (1984) 65–84.

    Google Scholar 

  • E Best: Fairness and conspiracy, IPL 18 (4) (1984) 215–220; Erratum, IPL 19 (3) (1984) 162.

    Google Scholar 

  • O Grumberg, N Francez, J A Makowsky, W P de Roever: A proof rule for fair termination of guarded commands, Proc. Intl. Symp. Algorithmic languages (North-Holland, 1981) 339–416.

    Google Scholar 

  • D Harel: First-order dynamic logic, LNCS 68 (Springer, 1979).

    Google Scholar 

  • D Lehmann, A Pnueli, J Stavi: Impartiality, justice and fairness: the ethics of concurrent termination, Proc. 8th ICALP, Akko, LNCS 115 (Springer, 1981) 246–277.

    Google Scholar 

  • D Lehmann, M O Rabin: On the advantages of free choice: a fully distributed symmetric solution to the dining philosophers' problem, Proc. 8th POPL, Williamsburg (ACM, 1981).

    Google Scholar 

  • S Mahadevan, R K Shyamasundar: On the fairness of distributed programs, Proc. 2nd FST&TCS, Bangalore, (NCSDCT, TIFR, 1982) 171–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, 400 005, Bombay, India

    R Ramanujam & Kamal Lodaya

Authors
  1. R Ramanujam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamal Lodaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramanujam, R., Lodaya, K. (1985). Proving fairness of schedulers. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15648-2

  • Online ISBN: 978-3-540-39527-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation