Acceptance trees

Journal of the ACM (JACM)

Volumn 32, Issue 4, 1985, Pages 896-928

  Hennessy, M ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Axioms; nondeterministic machines; testing equivalence; trees

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

ACCEPTANCE TREES; NONDETERMINISTIC MACHINES;

AUTOMATA THEORY;

EID: 0022145767     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/4221.4249     Document Type: Article

References (35)

1. Bergstra, J.A., and Klop, J.W. Fixed point semantics in process algebras. Tech. Rep. IW 206/82, Mathematisch Centrum, Amsterdam, The Netherlands, 1982.
2. Bergstra, J.A., and Klop, J.W. Process algebra for communication and mutual exclusion. Tech. Rep. IW 218/83, Mathematisch Centrum, Amsterdam, The Netherlands, 1983.
3. Brookes, S.D. A model for communicating sequential processes. Ph.D. dissertation. Oxford University, Oxford, England, 1983.
4. Brookes, S. D. and Rounds, W.C. Behavioural equivalence relations induced by programming logic. In Proceedings of ICALP 1983, Lecture Notes in Computer Science, vol. 154. Springer-Verlag, New York, 1983.
5. Brooks, S. D., Hoare, C.A.R., and Roscoe, A.W. A theory of communicating sequential processes. J. ACM 31, 3 (July 1984), 560-599.
6. de Bakker, J. W., and Zucker, J. I. Processes and the denotational semantics of concurrency. Tech. Rep. IW 209/82, Mathematisch Centrum, Amsterdam, The Netherlands, 1982.
7. De Nicola, R. A complete set of axioms for a theory of communicating sequential processes. In Proceedings of FCT '83. Lecture Notes in Computer Science, vol. 158. Springer-Verlag, New York, 1983, pp. 115-126; Inf. Control, to appear.
8. De Nicola, R., and Hennessy, M. Testing equivalences for processes. Theor. Comput. Sci. 34, 1,2(1984), 83-135.
9. Ginsburg, S., and Rice, H.G. Two families of languages related to ALGOL. J. ACM 9, 3 (July 1962), 350-371.
10. Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B. Initial algebra semantics and continuous algebras. J. ACM 24, 1 (Jan. 1977), 68-95.
11. Golson, W.G., and Rounds, W.C. Connections between two theories of concurrency: Metric spaces and synchronisation trees. Inf Control 57 (1983), 102-124.
12. Gordon, M. The Denotational Description of Programming Languages, Springer-Verlag, New York, 1979.
13. Guessarian, I. Algebraic semantics. In Lecture Notes in Computer Science, vol. 99. Springer-Verlag, New York, 1981.
14. Hennessy, M. A term model for synchronous process. Inf. Control 51, 1 (Oct. 1981), 58-75.
15. Hennessy, M. Synchronous and asynchronous experiments on processes, Inf. Control 59, 1-3 (1983), 36-83.
16. Hennessy, M., and Milner, R. Algebraic laws for nondeterminism and concurrency, J. ACM 32, 1 (Jan. 1985), 137-162.
17. Hennessy, M., and Plotkin, G. A term model for CCS. In Lecture Notes in Computer Science, vol. 88. Springer-Verlag, New York, 1980, pp. 261-274.
18. Hoare, C.A.R. Communicating sequential processes. Commun. ACM 21, 8 (Aug. 1978), 666-676.
19. Hoare, C.A.R. A model for communicating sequential processes. Tech. Monograph Prg.-22. Comput. Lab., University of Oxford, Oxford, England, 1981.
20. Hopcroft, J., and Ullman, J. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969.
21. Howie, J. An Introduction to Semigroup Theory. Academic Press, Orlando, Fla., 1976.
22. Kennaway, J. K. Formal semantics of nondeterminism and parallelism, Ph.D. dissertation. University of Oxford, Oxford, England, 1981.
23. Kennaway, J.K., and Hoare, C.A.R. A theory of nondeterminism. In Proceedings of ICALP 1980. Lecture Notes in Computer Science, vol. 85. Springer-Verlag, New York, 1980, pp. 338-350.
24. Milner, R. A calculus of communicating systems. In Lecture Notes in Computer Science, vol. 92, Springer-Verlag, New York, 1980.
25. Milner, R. On relating synchrony and asynchrony, Tech. Rep. CSR-75-80, University of Edinburgh, Edinburgh, Scotland, 1980.
26. Milner, R. Calculi for synchrony and asynchrony. Theor. Comput. Sci. 25, (1983), 267-310.
27. Olderog, E. R., and Hoare, C. A. R. Specification-oriented semantics for communicating processes. In Lecture Notes in Computer Science, vol. 154. Springer-Verlag, New York, 1983.
28. Plotkin, G. A structural approach to operational semantics, Lecture Notes. Aarhus University, Aarhus, Denmark, 1981.
29. Rounds, W. C., and Brookes, S. D. Possible futures, acceptances, refusals, and communicating processes. In Proceedings of the 22nd Foundations of Computer Science Annual Symposium (Nashville, Tenn., Oct.). IEEE, New York, 1981.
30. Salomaa, A. Two complete axiom systems for the algebra of regular events. J. ACM 13, 1 (Jan. 1966), 158-169.
31. Scott, D. Data types as lattices. SIAM J. Comput. 5 (1976), 522-587.
32. Stirling, C. A proof theoretic characterisation of observational equivalence, Tech. Rep. CSR-132-83. University of Edinburgh, Edinburgh, Scotland, 1983; Theor. Comput. Sci., to be published.
33. Stirling, C. Unpublished manuscript.
34. Stoy, J. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Mass., 1977.
35. Winskel, G. On powerdomains and modality. Theor. Comput. Sci. 36 (1985), 127-137.