Testing equivalences for processes

Theoretical Computer Science

Volumn 34, Issue 1-2, 1984, Pages 83-133

  De Nicola, R ^a   Hennessy, M C B ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; MATHEMATICAL TECHNIQUES - TREES;

ABSTRACT MODELS; CONCURRENCY; EQUIVALENCES; PROOF SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0020845493     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(84)90113-0     Document Type: Article

References (29)

1. Varieties of ordered algebras
2. The programming language concurrent Pascal
3. Distributed processes A concurrent programming concept
4. Algebraic families of interpretations
5. An enlarged definition and complete axiomatization of observational congruence of finite processes
6. A complete set of axioms for a theory of communicating sequential processes
7. Semantics of nondeterminism, concurrency and communication
8. Initial algebra semantics and continuous algebras
9. Algebraic semantics
10. Powerdomains and nondeterministic recursive definitions
11. A term model for CCS
12. A term model for synchronous process
13. On observing nondeterminism and concurrency
14. Communicating sequential processes
15. A model for communicating sequential processes
16. A theory of communicating sequential processes
17. A theory of nondeterminism
18. Formal semantics of nondeterminism and parallelism
19. Experience with processes and monitors in Mesa
20. A calculus of communicating systems
21. A powerdomain construction
22. Possible futures, acceptances, refusals and communicating processes
23. Data types as lattices
24. Power domains