@InProceedings{SouzaPfitscher02,
  title =        "{I}mplementing a {D}istributed {A}lgorithm for {D}etection of {L}ocal {K}nots and {C}ycles in {D}irected {G}raphs",
  author=        "Souza,  Geraldo Pereira de and Pfitscher,  Gerson Henrique",
  editor=        "Pascoe,  James S. and Loader,  Roger J. and Sunderam,  Vaidy S.",
  pages =        "371--386",
  booktitle=     "{C}ommunicating {P}rocess {A}rchitectures 2002",
  isbn=          "1 58603 268 2",
  year=          "2002",
  month=         "sep",
  abstract=      "In general, most deadlocks take form of cycles (in database
     systems) and knots (in communication systems). Boukerche and
     Tropper have proposed a distributed algorithm to detect
     cycles and knots in generic graphs. Their algorithm has a
     message complexity of 2m vs. (at least) 4m for the Chandy
     and Misra algorithm, where m is the number of links in the
     graph, and requires O (n log n) bits of memory, where n is
     the number of nodes. We have implemented Boukerche's
     algorithm. Our implementation of the algorithm is based on
     the construction of processes of the CSP model. The
     implementation was done using JCSP, an implementation of CSP
     for Java."
}