Causal automata

doi:10.1016/0304-3975(92)90052-H

Theoretical Computer Science

Volume 101, Issue 2, 20 July 1992, Pages 265-288

https://doi.org/10.1016/0304-3975(92)90052-H Get rights and content

Under an Elsevier user license

open archive

Abstract

We introduce causal automata, a formalism based on a syntactic approach to causality in contrast to conventional approaches based on partial orders. Our main result is the following characterisation .of Milner's notion of confluence in CCS: Confluence≡Determinism+\s{AND, OR\s} Causality.

Cited by (0)

^*: Present address: Department of Computer Science, Stanford University, Stanford, CA 94305, USA.