Fairness and regularity for SCCS processes

 Access to full text

 Full (PDF)

1. [1] K. APT, N. FRANCEZ and S. KATZ, Appraising Fairness in Languages for Distributed Programming in Journ. of Distributed Computing (to appear). Zbl0659.68023
2. [2] A. ARNOLD and A. DICKY, An Algebraic Characterization of Transition System Equivalences (to appear). Zbl0679.68116MR1010932
3. [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. Zbl0625.68023MR878573
4. [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. Zbl0614.68023MR900604
5. [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. Zbl0536.68042MR727650
6. [6] I. CASTELLANI, Bisimulations and Abstraction Homomorphisms, Proc. CAAP 85, Lect. Notes in Comput. Sci., Vol. 185, Springer-Verlag, Berlin, 1985, pp. 223-238. Zbl0563.68028MR818024
7. [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. Zbl0563.68024MR818025
8. [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. Zbl0551.68021MR783453
9. [9] P. DARONDEAU, About Fair Asynchrony, Theor. Comput. Sci., Vol.37, 1985, pp. 305-336. Zbl0607.68016MR824477
10. [10] S. EILENGERG, Automata, Languages and Machines, Academic Press, London, 1974. Zbl0359.94067
11. [11] N. FRANCEZ, Fairness, Springer-Verlag, Berlin, 1986. Zbl0602.68007MR856757
12. [12] R. J. VAN GLABBEEK, Notes on the Methodoiogy of CCS and CSP, CWI Tec. Rep. CS-R8624, Amsterdam, 1986. 
13. [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). Zbl0676.68036
14. [14] M. HENNESSY, Modelling Finite Delay Operators, Tec. Rep. CSR-153-83, Edinburgh, 1983. 
15. [15] M. HENNESSY, Axiomatizing Finite Delay Operators, Acta Inform., Vol. 21, 1984, pp. 61-88. Zbl0521.68047MR747171
16. [16] M. HENNESSY and G. PLOTKIN, Finite Conjunctive Non-determinism (to appear). Zbl0649.03013
17. [17] B. LESAEC, Étude de la reconnaissabilité des languages rationnels de mots infinis, Ph. D. Thesis, Univ. Bordeaux-I, 1986. 
18. [18] R. MILNER, Calculi for Synchrony and Asynchrony, Theoret Comput. Sci.,Vol. 25, 1983, pp. 267-310. Zbl0512.68026MR716132
19. [19] R. MILNER, A Calcuius for Communicating Systems, Lect. Notes in Comput. Sci., Vol. 92, Springer-Verlag, Berlin, 1980. Zbl0452.68027
20. [20] R. MILNER, Lectures on a Calcuius for Communicating Systems, Lect. Notes in Comput. Sci., Vol. 197, Springer-Verlag, Berlin, 1982, pp. 197-220. Zbl0609.68020MR822274
21. [21] R. MILNER, A Complete Inference System for a Class of Regular Behaviors, J. Comput. and Sys. Sci., Vol. 28, 1984, pp. 439-466. Zbl0562.68065MR752442
22. [22] R. MILNER, A Finite Delay Operator in Synchronous CCS, Tec. Rep.CSR-116-82, Edinburgh, 1982. 
23. [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. [24] D. E. MULLER, The General Synthesis Problemfor Asynchronous Digital Networks, Proc. SWAT Conf., 1967, pp. 71-82. 
25. [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. Zbl0617.03020MR864690
26. [26] W. NIAR, Equités et Automates en CCS, Thèse de 3e cycle, Paris, 1988. 
27. [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. Zbl0456.68028
28. [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. Zbl0457.68049
29. [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. Zbl0643.68025MR919588
30. [30] L. PRIESE, R. REHRMANN and U. WILLECKE-KLEMM, Some Results on Fairness, Report TI-1987-38, Univ. Paderborn, 1987. 
31. [31] L. PRIESE and U. WILLECKE-KLEMME, On State Equivalence Relations in Nondeterministic or Concurrent Systems, Report TI-1986-34, Univ. Paderbon, 1986. Zbl0612.68029
32. [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. Zbl0489.68024MR714014
33. [33] W. THOMAS, Automata on Infinite Objects, Handbook of Theoretical Computer Science (to appear). Zbl0900.68316MR1127189