Free Access
RAIRO-Theor. Inf. Appl.
Volume 23, Number 1, 1989
Page(s) 59 - 86
Published online 03 February 2017
  1. K. APT, N. FRANCEZ and S. KATZ, Appraising Fairness in Languages for Distributed Programming in Journ. of Distributed Computing (to appear). [Zbl: 0659.68023] [Google Scholar]
  2. A. ARNOLD and A. DICKY, An Algebraic Characterization of Transition System Equivalences (to appear). [MR: 1010932] [Zbl: 0679.68116] [Google Scholar]
  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: 878573] [Zbl: 0625.68023] [Google Scholar]
  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: 900604] [Zbl: 0614.68023] [Google Scholar]
  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: 727650] [Zbl: 0536.68042] [Google Scholar]
  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: 818024] [Zbl: 0563.68028] [Google Scholar]
  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: 818025] [Zbl: 0563.68024] [Google Scholar]
  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: 783453] [Zbl: 0551.68021] [Google Scholar]
  9. P. DARONDEAU, About Fair Asynchrony, Theor. Comput. Sci., Vol.37, 1985, pp. 305-336. [MR: 824477] [Zbl: 0607.68016] [Google Scholar]
  10. S. EILENGERG, Automata, Languages and Machines, Academic Press, London, 1974. [Zbl: 0359.94067] [Google Scholar]
  11. N. FRANCEZ, Fairness, Springer-Verlag, Berlin, 1986. [MR: 856757] [Zbl: 0602.68007] [Google Scholar]
  12. R. J. VAN GLABBEEK, Notes on the Methodoiogy of CCS and CSP, CWI Tec. Rep. CS-R8624, Amsterdam, 1986. [Google Scholar]
  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: 0676.68036] [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., Vol. 21, 1984, pp. 61-88. [MR: 747171] [Zbl: 0521.68047] [Google Scholar]
  16. M. HENNESSY and G. PLOTKIN, Finite Conjunctive Non-determinism (to appear). [Zbl: 0649.03013] [Google Scholar]
  17. B. LESAEC, Étude de la reconnaissabilité des languages rationnels de mots infinis, Ph. D. Thesis, Univ. Bordeaux-I, 1986. [Google Scholar]
  18. R. MILNER, Calculi for Synchrony and Asynchrony, Theoret Comput. Sci.,Vol. 25, 1983, pp. 267-310. [MR: 716132] [Zbl: 0512.68026] [Google Scholar]
  19. R. MILNER, A Calcuius for Communicating Systems, Lect. Notes in Comput. Sci., Vol. 92, Springer-Verlag, Berlin, 1980. [Zbl: 0452.68027] [Google Scholar]
  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: 822274] [Zbl: 0609.68020] [Google Scholar]
  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: 752442] [Zbl: 0562.68065] [Google Scholar]
  22. R. MILNER, A Finite Delay Operator in Synchronous CCS, Tec. Rep.CSR-116-82, Edinburgh, 1982. [Google Scholar]
  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. [Google Scholar]
  24. D. E. MULLER, The General Synthesis Problemfor Asynchronous Digital Networks, Proc. SWAT Conf., 1967, pp. 71-82. [Google Scholar]
  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: 864690] [Zbl: 0617.03020] [Google Scholar]
  26. W. NIAR, Equités et Automates en CCS, Thèse de 3e cycle, Paris, 1988. [Google Scholar]
  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: 0456.68028] [Google Scholar]
  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: 0457.68049] [Google Scholar]
  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: 919588] [Zbl: 0643.68025] [Google Scholar]
  30. L. PRIESE, R. REHRMANN and U. WILLECKE-KLEMM, Some Results on Fairness, Report TI-1987-38, Univ. Paderborn, 1987. [Google Scholar]
  31. L. PRIESE and U. WILLECKE-KLEMME, On State Equivalence Relations in Nondeterministic or Concurrent Systems, Report TI-1986-34, Univ. Paderbon, 1986. [Zbl: 0612.68029] [Google Scholar]
  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: 714014] [Zbl: 0489.68024] [Google Scholar]
  33. W. THOMAS, Automata on Infinite Objects, Handbook of Theoretical Computer Science (to appear). [MR: 1127189] [Zbl: 0900.68316] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.