Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
Algebra of communicating processes with abstraction
Jan A. Bergstra, Jan Willem Klop
Theoretical Computer Science 37, pages 77–121
1985
<div>We present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’). The system is an extension of ACP, Algebra of Communicating Processes, with Milner's τ-laws and an explicit abstraction operator. By means of a model of finite acyclic process graphs for ACP<sub>τ</sub>, syntactic properties such as consistency and conservativity over ACP are proved. Furthermore, the Expansion Theorem for ACP is shown to carry over to ACP<sub>τ</sub>. Finally, termination of rewriting terms according to the ACP<sub>τ</sub>, axioms is probed using the method of recursive path orderings.</div>
Theoretical Computer Science (TCS)