Skip to main content
Springer Nature Link
Log in

Deciding the path- and word-fair equivalence problem

  • Conference paper
  • First Online:
CSL '87 (CSL 1987)

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

Included in the following conference series:

  • 134 Accesses

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. Apt and E. R. Olderog. Proof rules and transformation dealing with fairness. Science of Computer programming, 3:65–100, 1983.

    Google Scholar 

  2. Eike Best. Fairness and conspiracies. Information Processing Letters, 18:215–220, 1984.

    Google Scholar 

  3. Gerardo Costa and Colin Stirling. A fair calculus of communicating systems. Acta Informatica, 21:417–441, 1984.

    Google Scholar 

  4. Ph. Darondeau. About fair asynchrony. Theoretical Computer Science, 37:305–336, 1985.

    Google Scholar 

  5. Ido Dayan and David Harel. Fair termination with cruel schedulers. Fundamenta Informaticae, IX:1–12, 1986.

    Google Scholar 

  6. N. Francez. Fairness. Springer-Verlag, 1986.

    Google Scholar 

  7. Irène Guessarian and Wafaa Niar. An Automaton Characterization of Fairness in SCCS. Report, CNRS-LITP, 1987.

    Google Scholar 

  8. David Harel. Effective transformation on infinite trees, with application to high undecidability, dominoes and fairness. Journal of the ACM, 33:224–248, 1986.

    Google Scholar 

  9. M. Hennessy and R. de Nicola. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Google Scholar 

  10. P. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness. In Proceedings of the 8. ICALP, LNCS 115, pages 264–277, 1981.

    Google Scholar 

  11. Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, 1980.

    Google Scholar 

  12. David Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI conference on Theoretical Computer Science, pages 167–183, Springer-Verlag, 1984.

    Google Scholar 

  13. Lucia Pomello. Some Equivalence Notions for Concurrent Systems. Technical Report 103, GMD, July 1984.

    Google Scholar 

  14. Lutz Priese, Ralf Rehrmann, and Uwe Willecke-Klemme. An introduction to the regular theory of fairness. Theoretical Computer Science, 53, 1987.

    Google Scholar 

  15. Lutz Priese, Ralf Rehrmann, and Uwe Willecke-Klemme. Some results on fairness — the regular case. In Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, pages 383–395, EATCS, Springer-Verlag, 1987.

    Google Scholar 

  16. Lutz Priese and Uwe Willecke-Klemme. On State Equivalence Relations in Nondeterministic or Concurrent Systems. Technical Report 34, Universität GH Paderborn, Dezember 1986.

    Google Scholar 

  17. J.P. Queille and J. Sifakis. Fairness and related properties in transition systems — a temporal logic to deal with fairness. Acta Informatica, 19:195–220, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik-Informatik, Universität-Gesamthochschule Paderborn, 4790, Paderborn Warburgerstr.100

    Ralf Rehrmann & Lutz Priese

Authors
  1. Ralf Rehrmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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

© 1988 Springer-Verlag

About this paper

Cite this paper

Rehrmann, R., Priese, L. (1988). Deciding the path- and word-fair equivalence problem. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation