For the most recent entries see the Petri Nets Newsletter.

Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory.

Charron-Bost, B.

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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography