A note on causal trees and their applications to CCS

Stefano Basagni
1999 International Journal of Computer Mathematics  
Causal Trees are a variant of Milner's Synchronization Trees which aims at reconciling two antagonistic views of semantics for concurrent systems: the interleaving models and the truly concurrent ones. The original model of Causal Trees provides us with an interleaving description of a concurrent system which faithfully expresses causaiity by enriching the action labels of a synchronization tree. These enriched labels supply indication of the observable causes of observable actions. In this
more » ... ctions. In this note we revise the original model of Causal Trees, so that every action label bears the casual indication, and not only the observable actions. This permits to inherit all the results of Milner's original theory in a natural way.
doi:10.1080/00207169908804799 fatcat:r3t2uei53vaonge6tdvxmsqkoy