Process algebra for synchronous communication

Information and Control

Volumn 60, Issue 1-3, 1984, Pages 109-137

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

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY; PROCESS ALGEBRA; SYNCHRONOUS COMMUNICATION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0021291978     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(84)80025-X     Document Type: Article

References (45)

1. A refinement of Kahn's semantics to handle nondeterminism and communication
2. Denotational semantics of concurrency
3. Processes and the denotational semantics of concurrency
4. Linear time and branching time semantics for recursion with merge
5. A Process Algebra for the Operational Semantics of Static Data Flow Networks
6. An Algebraic Specification Method for Processes over a Finite Action Set
7. The algebra of recursively defined processes and the algebra of regular processes
8. Algebra of Communicating Processes with Abstraction
9. Verification of an Alternating Bit Protocol by Means of Process Algebra
10. Fair FIFO Queues Satisfy an Algebraic Criterion for Protocol Correctness
11. On the relationship of CCS and CSP
12. Behavioural equivalence relations induced by programming logics
13. Orderings for term-rewriting systems
14. A modal characterization of observational congruence on finite terms of CCS
15. A term model for synchronous processes
16. Synchronous and Asynchronous Experiments on Processes
17. Axiomatising Finite Delay Operators
18. A model for Nondeterministic Machines
19. On observing nondeterminism and concurrency
20. Algebraic Laws for Nondeterminism and Concurrency
21. Testing Equivalences for Processes
22. A term model for CCS
23. Communicating sequential processes
24. A model for communicating sequential processes
25. A Theory of Communicating Sequential Processes
26. Confluent reductions Abstract properties and applications to term rewriting systems
27. Combinatory Reduction Systems
28. Abstraction and nondeterminism in concurrent systems
29. CIRCAL: A Calculus for Circuit Description
30. Concurrent processes and their syntax
31. A Calculus of Communicating Systems
32. A complete inference system for a class of regular behaviours
33. Calculi for synchrony and asynchrony
34. Infinite words, infinite trees, infinite computations
35. Synchronization of concurrent processes
36. Specification-oriented semantics for communicating processes
37. Concurrency and automata on infinite sequences
38. On the composition of processes
39. Partially ordered computations, with applications to VLSI design
40. A Fixpoint Semantics for Nondeterministic Data Flow
41. Event structure semantics for CCS and related languages
42. Synchronisation trees