Algebra of communicating processes with abstraction

Theoretical Computer Science

Volumn 37, Issue C, 1985, Pages 77-121

  Bergstra, J A ^a   Klop, J W ^a  

^a CWI   (Netherlands)

Author keywords

bisimulations; communicating processes; Concurrency; F.1.1; F.1.2; F.3.2; F.4.3; handshaking; internal actions; process algebra; process graph; recursive path ordering; terminating rewrite rules

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

ACP; ALGEBRA OF COMMUNICATING PROCESSES;

COMPUTER METATHEORY;

EID: 0021870594     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(85)90088-X     Document Type: Review

References (14)

1. Processes and the denotational semantics of concurrency
2. Process algebra for synchronous communication
3. An abstraction mechanism for process algebras
4. Algebra of communicating processes
5. Top-down design and the algebra of communicating processes
6. Behavioural equivalence relations induced by programming logics
7. Ordering for term-rewriting systems
8. A note on simplification ordering
9. A modal characterization of observational congruence on finite terms of CCS
10. A term model for synchronous processes
11. A model for communicating sequential processes
12. A Calculus for Communicating Systems
13. Synchronisation trees