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.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, to appear in Journ. of Distributed Computing.
A. Arnold, A. Dicky, An algebraic characterization of transition system equivalences, to appear.
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.
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.
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.
P. Darondeau, About fair asynchrony, Theor. Comput. Sci. 37 (1985), 305–336.
I. Guessarian, W. Niar-Dinedane, An automaton characterization of fairness in SCCS, Proc. STACS 88, Lect. Notes in Comput. Sci. 294, Springer-Verlag, Berlin (1988), 356–372.
I. Guessarian, L. Priese, On the minimal number of × operators to model regularity in fair SCCS, to appear in Information Processing Letters.
M. Hennnessy, Modelling finite delay operators, Tec. Rep. CSR-153-83, Edinburgh (1983).
M. Hennnessy, Axiomatizing finite delay operators, Acta Inform. 21 (1984), 61–88.
B. Lesaec, Etude de la reconnaissabilité des langages rationnels de mots infinis, Ph. D. Thesis, Univ. Bordeaux I (1986).
R. Milner, Calculi for Synchrony and Asynchrony, Theoret. Comput. Sci. 25 (1983), 267–310.
R. Milner, A Calculus for Communicating Systems, Lect. Notes in Comput. Sci. 92, Springer-Verlag, Berlin (1980).
R. Milner, A complete inference system for a class of regular behaviors, Jour. Comput. and Sys. Sci. 28 (1984), 439–466.
R. Milner, A finite delay operator in synchronous CCS, Tec. Rep. CSR-116-82, Edinburgh (1982).
D. E. Muller, Infinite sequences and finite machines, Proc. 4th IEEE Symp. on switching circuit theory and logical design, New-York (1963), 3–16.
D. E. Muller, The general synthesis problem for asynchronous digital networks, Proc. SWAT Conf. (1967), 71–82.
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.
D. Park, Concurrency and automata on infinite sequences, Proc. 5th GI Conf., Lect. Notes in Comput. Sci. 104, Springer-Verlag, Berlin (1981), 167–183.
L. Priese, R. Rehrmann, U. Willecke-Klemme, An introduction to the regular theory of fairness, Theor. Comput. Sci. 54 (1987), 139–163.
J. Queille, J. Sifakis, Fairness and related properties in transition systems: A time logic to deal with fairness, Acta Inform. 19 (1983), 195–220.
W. Thomas, Automata on infinite objects, to appear in the ”Handbook of Theoretical Computer Science”, J. van Leeuwen Ed., North Holland.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1989). A characterization of fair computations of finite state SCCS processes. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013123
Download citation
DOI: https://doi.org/10.1007/BFb0013123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51631-6
Online ISBN: 978-3-540-46721-2
eBook Packages: Springer Book Archive