Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1988: CSL '88 pp 272–287Cite as

On the existence of fair schedulers

  • Conference paper
  • First Online:

  • 143 Accesses

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

Abstract

We proof that any ω-regular language can be accepted by a letter-fair and a *-letter-fair scheduler, where *-letter-fairness also forbids starvation due to conspiracy of some processes. On the other hand, for a similar fairness concept, namely edge- or *-edge-fairness, there are simple ω-regular languages without fair schedulers.

This author was supported by a grant of the DFG.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and E.R. Olderog, Proof Rules and Transformation Dealing with Fairness, Sci. Comput. Programming 3 (1983) 65–100

    Article  Google Scholar 

  2. E. Best, Fairness and Conspiracies, Inform. Process. Lett. 18 (1984) 215–220

    Article  Google Scholar 

  3. L. Boasson, M. Nivat, Adherences of Languages, J. Comp. Sys. Sci. 20 (1980), 285–309

    Article  Google Scholar 

  4. J.R. Büchi, On a Decision Method in Restricted Second-Order Arithmetic, Proc. 1960 Intern. Congr. on Logic, Methodology and Philosophy of Science (Stanford University Press, 1960), 1–11

    Google Scholar 

  5. Ph. Darondeau, About Fair Asynchrony, TCS 37 (1985) 305–336

    Article  Google Scholar 

  6. N. Francez, Fairness, Springer-Verlag, Berlin (1986)

    Google Scholar 

  7. I. Guessarian, W. Niar, An Automaton Characterization of Fairness in SCCS, LNCS 294 (1988) 356–272

    Google Scholar 

  8. I. Guessarian and L. Priese, On the Minimal Number of x Operators in Fair SCCS-Processes, to appear in IPL

    Google Scholar 

  9. D. Harel, Effective Transformations on Infinite Trees, with Application to High Undecidability, Dominoes and Fairness, J. ACM 33 (1986) 224–248

    Article  Google Scholar 

  10. M. Hennessy and R. de Nicola, Testing Equivalences for Processes, TCS 34 (1984) 83–133

    Google Scholar 

  11. J. Hoogeboom, G. Rozenberg, Infinitary Languages, LNCS 224 (1986), 266–342

    Google Scholar 

  12. R. McNaughton, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control (1966), 521–530

    Google Scholar 

  13. R. Milner, A Calculus of Communicating Systems, LNCS 92 (1980)

    Google Scholar 

  14. D.E. Muller, Infinite Sequences and Finite Machines, Proc. 4th Ann. Symp. on Switching Circuit Theory (1903), 3–16

    Google Scholar 

  15. E.R. Olderog und K.R. Apt, Transformations realizing fairness assumptions for parallel programs. TR 84-8, LITP, Paris, 1984

    Google Scholar 

  16. D. Park, Concurrency and Automata on Infinite Sequences, LNCS 104 (1981), 167–183

    Google Scholar 

  17. L. Priese, R. Rehrmann and U. Willecke-Klemme, An Introduction to The Regular Theory of Fairness, TCS 54 (1987), 139–163

    Article  Google Scholar 

  18. L. Priese, Fairness, EATCS Bulletin Vol. 35 (1989), 171–180

    Google Scholar 

  19. J.P. Queille and J. Sifakis, Fairness and Related Properties in Transition Systems — a Temporal Logic to deal with Fairness, Acta Inform. 19 (1983) 195–220

    Article  Google Scholar 

  20. R. Rehrmann, Deciding the Path-and Word-Fair Equivalence Problem, Bericht Nr. 43, Reihe Theoretische Informatik, Univ.-GH-Paderborn (1987), 31 pp.

    Google Scholar 

  21. W. Thomas, Automata on Infinite Objects, to appear in: Handbook of Theoretical Computer Science (J.V. Leeuwen, Ed.), North-Holland, Amsterdam

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 17, Univ.-GH-Paderborn, FRG Maurice Nivat L.I.T.P., Université de Paris 7, Paris, France

    Lutz Priese

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Priese, L. (1989). On the existence of fair schedulers. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026307

Download citation

  • DOI: https://doi.org/10.1007/BFb0026307

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51659-0

  • Online ISBN: 978-3-540-46736-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation