Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Some results on fairness: The regular case

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

We introduce some steps towards a theory of fairness in ω-regular languages.

This research was supported by a grant of the DFG.

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

  1. K.R. Ap, E.R. OlderogProof rules and transformation dealing with fairness Science of Computer Programming 3 (1983) 65–100

    Google Scholar 

  2. Eike BestFairness and conspiracies Imformation Prossesing Letters 18 (1984) 215–220

    Google Scholar 

  3. L. Boasson, M. NivatAdherences of languages JCSS 20 (1980) 285–309

    Google Scholar 

  4. J.R. BüchiOn a decision method in restricted second order arithmetic Logic, Methodology and Philosophy of Science; Proc. 1960 Int. Congr. for Logic; Stanford University Press 1–11

    Google Scholar 

  5. Gerado Costa, Colin StirlingA Fair Calculus Of Communicating Systems Acta Informatica 21 (1984) 417–441

    Google Scholar 

  6. Ph. DarondeauAbout fair asynchrony Theoretical Computer Science 37 (1985) 305–336

    Google Scholar 

  7. Ido Dayan, David HarelFair termination with cruel schedulers Fundamenta Informaticae IX (1986) 1–12

    Google Scholar 

  8. S. EilenbergAutomata, Languages and machines Vol A Academic Press, New York 1976

    Google Scholar 

  9. N.Francez, D.KozenGeneralized fair termination ACM Symp. of Prog. Languages (1984)

    Google Scholar 

  10. David HarelEffective transformations on infinite trees, with application to high undecidability, dominoes and fairness Journal of the ACM 33 (1986) 224–248

    Google Scholar 

  11. M. Hennessy,R. de NicolaTesting Equivalences for Processes Theoretical Computer Science 34 (1984) 83–133

    Google Scholar 

  12. C.A.R. HoareCommunicating Sequential Processes Comm.ACM 21 (1978) 666–677

    Google Scholar 

  13. D. Lehmann, A. Pnueli, J. StaviImpartiality, justice and fairness LNCS 115 (1981) 264–277

    Google Scholar 

  14. Robin MilnerA Calculus of Communicating Systems Lecture Notes in Computer Science 92 (1980)

    Google Scholar 

  15. D.E.MullerInfinite sequences and finite machines Proc.4th Ann.Symp.on Switch.Circuit Theory and logical Design 3–16 IEEE (1963)

    Google Scholar 

  16. D.ParkConcurrency and automata on infinite sequences LNCS 104 (1981)

    Google Scholar 

  17. D. PerrinRecent results on automata and infinite words LNCS 176 (1984) 134–148

    Google Scholar 

  18. Lucia PomelloSome Equivalence Notions for Concurrent Systems Arbeitspaiere der GMD 103 (July 1984)

    Google Scholar 

  19. J.P. Queille, J. SifakisFairness and related properties in Transition Systems — A temporal logic to deal with fairness Acta Informatica 19 (1983) 195–220

    Google Scholar 

  20. L.E.Rosier, Hsu-Chun. YenLogspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines University of Texas Dep.of Comp.Sciences, Techn. Report No. 85-08 (1985)

    Google Scholar 

  21. R. TarjanDepth-First Search and Linear Graph Algoritms SIAM J. Comp.,Vol.1 (1972) 146–160

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 17 Mathematik / Informatik, Universität-Gesamthochschule-Paderborn, Germany

    Lutz Priese, Ralf Rehrmann & Uwe Willecke-Klemme

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Rehrmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Uwe Willecke-Klemme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Priese, L., Rehrmann, R., Willecke-Klemme, U. (1987). Some results on fairness: The regular case. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039621

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation