anchor.diff:  
   jtwfg can analyze such graphs and find the deadlock(s).
   
  -=== Example 2
  +=== Example 2 for a deadlock in a "task wait for graph"
   
   The situation in the second example is a bit more interesting.
   
  
positive.code: 
  To use the jtwfg deadlock detection, you transform your "execution engine" domain model objects into jtwfg graph model objects and call then the jtwfg deadlock detector.
  
  === Example 1
  
  A graph consists of *tasks* and synchronous *waits-for edges*. As soon as a circular dependency exists, the involved tasks are _deadlocked_.
  
  
negative.code: "Task 5" is fine.
  
  jtwfg can analyze such graphs and find the deadlock(s).
  
  === More about the deadlock detection topic in general
  
  