Fairness and regularity for SCCS processes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, STACS 88, Tome 23 (1989) no. 1, pp. 59-86. 
@article{ITA_1989__23_1_59_0,
     author = {Guessarian, Ir\`ene and Niar-Dinedane, Waf\^aa},
     title = {Fairness and regularity for {SCCS} processes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {59--86},
     publisher = {EDP-Sciences},
     volume = {23},
     number = {1},
     year = {1989},
     mrnumber = {990068},
     zbl = {0665.68019},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1989__23_1_59_0/}
}
TY  - JOUR
AU  - Guessarian, Irène
AU  - Niar-Dinedane, Wafâa
TI  - Fairness and regularity for SCCS processes
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1989
SP  - 59
EP  - 86
VL  - 23
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1989__23_1_59_0/
LA  - en
ID  - ITA_1989__23_1_59_0
ER  - 
%0 Journal Article
%A Guessarian, Irène
%A Niar-Dinedane, Wafâa
%T Fairness and regularity for SCCS processes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1989
%P 59-86
%V 23
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1989__23_1_59_0/
%G en
%F ITA_1989__23_1_59_0
Guessarian, Irène; Niar-Dinedane, Wafâa. Fairness and regularity for SCCS processes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, STACS 88, Tome 23 (1989) no. 1, pp. 59-86. http://www.numdam.org/item/ITA_1989__23_1_59_0/

[1] K. Apt, N. Francez and S. Katz, Appraising Fairness in Languages for Distributed Programming in Journ. of Distributed Computing (to appear). | Zbl

[2] A. Arnold and A. Dicky, An Algebraic Characterization of Transition System Equivalences (to appear). | MR | Zbl

[3] J. A. Bergstra and J. W. Klop , Process algebra: Specification and Verification in Bisimulation Semantics, in Math. and Comput. Sci. II, HAZEWTNKEL, LENSTRA and MEERTENS éd., CWI Monograph 4, North-Holland, Amsterdam, 1986, pp. 61- 94. | MR | Zbl

[4] G. Boudol and I. Castellani, On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. CAAP 87, Lect. Notes in Comput. Sci, Vol. 249, Springer-Verlag, Berlin, 1987, pp. 123-147. | MR | Zbl

[5] S. D. Brookes and W. C. Rounds, Behavioural Equivalence Relations induced by Programming Logics, Proc. ICALP 83, Lect. Notes in Comput. Sci. Vol. 154, Springer-Verlag, Berlin, 1983, p. 97-108. | MR | Zbl

[6] I. Castellani, Bisimulations and Abstraction Homomorphisms, Proc. CAAP 85, Lect. Notes in Comput. Sci., Vol. 185, Springer-Verlag, Berlin, 1985, pp. 223-238. | MR | Zbl

[7] G. Costa, A Metric Characterization of Fair Computations in CCS, Proc. CAAP 85, Lect. Notes in Comput. Sci.,Vol. 185, Springer-Verlag, Berlin, 1985, pp. 239-252. | MR | Zbl

[8] G. Costa and C. Stirling, Weak and Strong Fairness in CCS, Proc. MFCS 84, Lect. Notes in Comput. Sci.Vol. 176, Springer-Verlag, Berlin, 1984, pp. 245-254. | MR | Zbl

[9] P. Darondeau, About Fair Asynchrony, Theor. Comput. Sci., Vol.37, 1985, pp. 305-336. | MR | Zbl

[10] S. Eilengerg, Automata, Languages and Machines, Academic Press, London, 1974. | Zbl

[11] N. Francez, Fairness, Springer-Verlag, Berlin, 1986. | MR | Zbl

[12] R. J. Van Glabbeek, Notes on the Methodoiogy of CCS and CSP, CWI Tec. Rep. CS-R8624, Amsterdam, 1986.

[13] I. Guessarian and L. Priese, On the Minimal Number of x Operators to model regularity in fair SCCS, in Information Processing Letters (to appear). | Zbl

[14] M. Hennessy, Modelling Finite Delay Operators, Tec. Rep. CSR-153-83, Edinburgh, 1983.

[15] M. Hennessy, Axiomatizing Finite Delay Operators, Acta Inform., Vol. 21, 1984, pp. 61-88. | MR | Zbl

[16] M. Hennessy and G. Plotkin, Finite Conjunctive Non-determinism (to appear). | Zbl

[17] B. Lesaec, Étude de la reconnaissabilité des languages rationnels de mots infinis, Ph. D. Thesis, Univ. Bordeaux-I, 1986.

[18] R. Milner, Calculi for Synchrony and Asynchrony, Theoret Comput. Sci.,Vol. 25, 1983, pp. 267-310. | MR | Zbl

[19] R. Milner, A Calcuius for Communicating Systems, Lect. Notes in Comput. Sci., Vol. 92, Springer-Verlag, Berlin, 1980. | Zbl

[20] R. Milner, Lectures on a Calcuius for Communicating Systems, Lect. Notes in Comput. Sci., Vol. 197, Springer-Verlag, Berlin, 1982, pp. 197-220. | MR | Zbl

[21] R. Milner, A Complete Inference System for a Class of Regular Behaviors, J. Comput. and Sys. Sci., Vol. 28, 1984, pp. 439-466. | MR | Zbl

[22] R. Milner, A Finite Delay Operator in Synchronous CCS, Tec. Rep.CSR-116-82, Edinburgh, 1982.

[23] D. E. Muller, Infinite Sequences and Finite Machines, Proc. 4th IEEE Symp. on switching circuit theory and logical design, New York, 1963, pp. 3-16.

[24] D. E. Muller, The General Synthesis Problemfor Asynchronous Digital Networks, Proc. SWAT Conf., 1967, pp. 71-82.

[25] D. E. Muller, A. Saoudi and P. Schupp, Alternating Automata, the Weak Monadic Theory of the Tree and its Complexity, Proc. ICALP 86, Lect. Notes in Comput. Sci., Vol. 226, Springer-Verlag, Berlin, 1986, pp. 275-283. | MR | Zbl

[26] W. Niar, Equités et Automates en CCS, Thèse de 3e cycle, Paris, 1988.

[27] D. Park, On the Semantics of Fair Parallelism, Abstract Software Specifications, Lect. Notes in Comput. Sci., Vol. 86, Springer-Verlag, Berlin, 1980, pp. 504-526. | Zbl

[28] D. Park, Concurrency and Automata on Infinite Sequences, Proc. 5th GI Conf., Lect. Notes in Comput. Sci. Vol. 104, Springer-Verlag, Berlin, 1981, pp. 167-183. | Zbl

[29] L. Priese, R. Rehrmann and U. Willecke-Klemme, An Introduction to the Regular Theory of Fairness, Theor. Comput. Sci., Vol. 54, 1987, pp. 139-163. | MR | Zbl

[30] L. Priese, R. Rehrmann and U. Willecke-Klemm, Some Results on Fairness, Report TI-1987-38, Univ. Paderborn, 1987.

[31] L. Priese and U. Willecke-Klemme, On State Equivalence Relations in Nondeterministic or Concurrent Systems, Report TI-1986-34, Univ. Paderbon, 1986.

[32] J. Queille and J. Sifakis, Fairness and Related Properties in Transition Systems: A Time Logic to Deal with Fairness, Acta Inform., Vol. 19, 1983, pp. 195-220. | MR | Zbl

[33] W. Thomas, Automata on Infinite Objects, Handbook of Theoretical Computer Science (to appear). | MR | Zbl