Skip to main content
SpringerLink
Log in

An automaton characterization of fairness in SCCS

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

Abstract

We describe various kinds of fairness (mainly weak and strong fairness) for finite state SCCS processes by providing an automaton-theoretic characterization of the classes of fair languages. To this end, we introduce a variant of Muller automata, the T-automata, which still recognize the class of ω-regular languages, and which characterize the classes of fair languages.

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. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Proc. POPL Conf., Munich (1987).

    Google Scholar 

  2. A. Arnold, A. Dicky, An algebraic characterization of transition system equivalences, to appear.

    Google Scholar 

  3. J. A. Bergstra, J. W. Klop, Process algebra: specification and verification in bisimulation semantics, in Math. and Comput. Sci. II, (Hazewinkel, Lenstra, Meertens eds.), CWI Monograph 4, North-Holland, Amsterdam (1986), 61–94.

    Google Scholar 

  4. G. Boudol, I. Castellani, On the semantics of concurrency: partial orders and transition systems, Proc. CAAP 87, Lect. Notes in Comput. Sci. 249, Springer-Verlag, Berlin (1987), 123–137.

    Google Scholar 

  5. S. D. Brookes, W. C. Rounds, Behavioural equivalence relations induced by programming logics, Proc. ICALP 83, Lect. Noes in Comput. Sci. 154, Springer-Verlag, Berlin (1983), 97–108.

    Google Scholar 

  6. I. Castellani, Bisimulations and abstraction homomorphisms, Proc.CAAP 85, Lect. Notes in Comput. Sci. 185, Springer-Verlag, Berlin (1985), 223–238.

    Google Scholar 

  7. G. Costa, A metric characterization of fair computations in CCS, Proc. CAAP 85, Lect. Notes in Comput. Sci. 185, Springer-Verlag, Berlin (1985), 239–252.

    Google Scholar 

  8. G. Costa, C. Stirling, Weak and strong fairness in CCS, Proc. MFCS 84, Lect. Notes in Comput. Sci. 176, Springer-Verlag, Berlin (1984), 245–254.

    Google Scholar 

  9. P. Darondeau, About fair asynchrony, Theor. Comput. Sci. 37 (1985), 305–336.

    Google Scholar 

  10. S. Eilenberg, Automata, Languages and Machines, Academic Press, London (1974).

    Google Scholar 

  11. N. Francez, Fairness, Spring-Verlag, Berlin (1986).

    Google Scholar 

  12. R. J. van Glabbeek, Notes on the methodology of CCS and CSP, CWI Tec. Rep. CS-R8624, Amsterdam (1986).

    Google Scholar 

  13. I. Guessarian, W. Niar-Dinedane, Fairness and regularity for SCCS processes, in preparation.

    Google Scholar 

  14. M. Hennessy, Modelling finite delay operators, Tec. Rep. CSR-153-83, Edinburgh (1983).

    Google Scholar 

  15. M. Hennessy, Axiomatizing finite delay operators, Acta Inform. 21 (1984), 61–88.

    Google Scholar 

  16. M. Hennessy, G. Plotkin, Finite conjunctive non-determinism, to appear.

    Google Scholar 

  17. R. Milner, Calculi for Synchrony and Asynchrony, Theoret. Comput. Sci. 25 (1983), 267–310.

    Google Scholar 

  18. R. Milner, A Calculus for Communicating Systems, Lect. Notes in Comput. Sci. 92, Springer-Verlag, Berlin (1980).

    Google Scholar 

  19. R. Milner, Lectures on a Calculus for Communicating Systems, Lect. Notes in Comput. Sci. 197, Springer-Verlag, Berlin (1982), 197–220.

    Google Scholar 

  20. R. Milner, A complete inference system for a class of regular behaviors, Jour. Comput. and Sys. Sci. 28 (1984), 439–466.

    Google Scholar 

  21. R. Milner, A finite delay operator in synchronous CCS, Tec. Rep. CSR-116-82, Edinburgh (1982).

    Google Scholar 

  22. D. E. Muller, Infinite sequences and finite machines, Proc. 4th IEEE Symp. on switching circuit theory and logical design, New-York (1963), 3–16.

    Google Scholar 

  23. D. E. Muller, The general synthesis problem for asynchronous digital networks, Proc. SWAT Conf. (1967), 71–82.

    Google Scholar 

  24. D. E. Muller, A. Saoudi, P. Schupp, Alternating automata, the weak monadic theory of the tree and its complexity, Proc. ICALP 86, Lect. Notes in Comput. Sci. 226, Springer-Verlag, Berlin (1986), 275–283.

    Google Scholar 

  25. W. Niar, Equités et automates en CCS, Thèse de 3ième cycle, Paris (1988).

    Google Scholar 

  26. D. Park, On the semantics of fair parallelism, Abstract Software Specifications, Lect. Notes in Comput. Sci. 86, Springer-Verlag, Berlin (1980), 504–526.

    Google Scholar 

  27. D. Park, Concurrency and automata on infinite sequences, Proc. 5th GI Conf., Lect. Notes in Comput. Sci. 104, Springer-Verlag, Berlin (1981), 167–183.

    Google Scholar 

  28. L. Priese, R. Rehrmann, U. Willecke-Klemme, Some results on fairness: the regular case, Proc. STACS 87, Lect. Notes in Comput. Sci. 247, Springer-Verlag, Berlin (1987), 383–395.

    Google Scholar 

  29. L. Priese, R. Rehrmann, U. Willecke-Klemme, Some results on fairness, Report TI-1987-38, Univ. Paderborn (1987).

    Google Scholar 

  30. L. Priese, U. Willecke-Klemme, On state equivalence relations in nondeterministic or concurrent systems, Report TI-1986-34, Univ. Paderborn (1986).

    Google Scholar 

  31. J. Queille, J. Sifakis, Fairness and related properties in transition systems: A time logic to deal with fairness, Acta Inform. 19 (1983), 195–220.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS-LITP, Université Paris 7, 2, Place Jussieu, 75251, Paris Cédex 05, France

    Irène Guessarian

  2. LITP, Université Paris 7, 2, Place Jussieu, 75251, Paris Cédex 05, France

    Wafaa Niar-Dinedane

Authors
  1. Irène Guessarian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wafaa Niar-Dinedane
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guessarian, I., Niar-Dinedane, W. (1988). An automaton characterization of fairness in SCCS. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035859

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation