Advertisement

An automaton characterization of fairness in SCCS

  • Irène Guessarian
  • Wafaa Niar-Dinedane
Contributed Papers Semantics Of Parallelism
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

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.

Keywords

Transition System Regular Language Finite Automaton Acceptance Condition Fairness Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1] [Apt-Francez-Katz]
    K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Proc. POPL Conf., Munich (1987).Google Scholar
  2. [2] [Arnold-Dicky]
    A. Arnold, A. Dicky, An algebraic characterization of transition system equivalences, to appear.Google Scholar
  3. [3] [Bergstra-Klop]
    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. [4] [Boudol-Castellani]
    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. [5] [Brookes-Rounds]
    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. [6] [Castellani]
    I. Castellani, Bisimulations and abstraction homomorphisms, Proc.CAAP 85, Lect. Notes in Comput. Sci. 185, Springer-Verlag, Berlin (1985), 223–238.Google Scholar
  7. [7] [Costa]
    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. [8] [Costa-Stirling]
    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. [9] [Darondeau]
    P. Darondeau, About fair asynchrony, Theor. Comput. Sci. 37 (1985), 305–336.Google Scholar
  10. [10] [Eilenberg]
    S. Eilenberg, Automata, Languages and Machines, Academic Press, London (1974).Google Scholar
  11. [11] [Francez]
    N. Francez, Fairness, Spring-Verlag, Berlin (1986).Google Scholar
  12. [12] [van Glabbeek]
    R. J. van Glabbeek, Notes on the methodology of CCS and CSP, CWI Tec. Rep. CS-R8624, Amsterdam (1986).Google Scholar
  13. [13] [Guessarian-Niar-Dinedane]
    I. Guessarian, W. Niar-Dinedane, Fairness and regularity for SCCS processes, in preparation.Google Scholar
  14. [14] [Hennessyl]
    M. Hennessy, Modelling finite delay operators, Tec. Rep. CSR-153-83, Edinburgh (1983).Google Scholar
  15. [15] [Hennessy2]
    M. Hennessy, Axiomatizing finite delay operators, Acta Inform. 21 (1984), 61–88.Google Scholar
  16. [16] [Hennessy-Plotkin]
    M. Hennessy, G. Plotkin, Finite conjunctive non-determinism, to appear.Google Scholar
  17. [17] [Milner1]
    R. Milner, Calculi for Synchrony and Asynchrony, Theoret. Comput. Sci. 25 (1983), 267–310.Google Scholar
  18. [18] [Milner2]
    R. Milner, A Calculus for Communicating Systems, Lect. Notes in Comput. Sci. 92, Springer-Verlag, Berlin (1980).Google Scholar
  19. [19] [Milner3]
    R. Milner, Lectures on a Calculus for Communicating Systems, Lect. Notes in Comput. Sci. 197, Springer-Verlag, Berlin (1982), 197–220.Google Scholar
  20. [20] [Milner4]
    R. Milner, A complete inference system for a class of regular behaviors, Jour. Comput. and Sys. Sci. 28 (1984), 439–466.Google Scholar
  21. [21] [Milner5]
    R. Milner, A finite delay operator in synchronous CCS, Tec. Rep. CSR-116-82, Edinburgh (1982).Google Scholar
  22. [22] [Muller1]
    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. [23] [Muller2]
    D. E. Muller, The general synthesis problem for asynchronous digital networks, Proc. SWAT Conf. (1967), 71–82.Google Scholar
  24. [24] [Muller-Saoudi-Schupp]
    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. [25] [Niar-Dinedane]
    W. Niar, Equités et automates en CCS, Thèse de 3ième cycle, Paris (1988).Google Scholar
  26. [26] [Park1]
    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. [27] [Park2]
    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. [28] [Priese-Rehrmann-Willecke-Klemme1]
    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. [29] [Priese-Rehrmann-Willecke-Klemme2]
    L. Priese, R. Rehrmann, U. Willecke-Klemme, Some results on fairness, Report TI-1987-38, Univ. Paderborn (1987).Google Scholar
  30. [30] [Priese-Willecke-Klemme]
    L. Priese, U. Willecke-Klemme, On state equivalence relations in nondeterministic or concurrent systems, Report TI-1986-34, Univ. Paderborn (1986).Google Scholar
  31. [31] [Queille-Sifakis]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Irène Guessarian
    • 1
  • Wafaa Niar-Dinedane
    • 2
  1. 1.CNRS-LITPUniversité Paris 7Paris Cédex 05France
  2. 2.LITPUniversité Paris 7Paris Cédex 05France

Personalised recommendations