Laboratoire d'Informatique, URA 1327 du CNRS, Département de Mathématiques et d'Informatique, Ecole Normale Supérieure, LIENS--89-3, April 1989.
Abstract: The authors define a concurrency measure of a distributed computation which is based an the number µ of its consistent cuts. The authors prove that counting consistent cuts take into account the non-transitivity of the concurrency relation, and they give a geometric interpretation of µ using the clock designed by Fidge and Mattern for characterizing concurrency between two events.