死锁的例子描述对吗

public class Deadlock {
	static class Friend {
		private final String name;

		public Friend(String name) {
			this.name = name;
		}

		public String getName() {
			return this.name;
		}

		public synchronized void bow(Friend bower) {
			System.out.format("%s: %s has bowed to me!%n", this.name, bower.getName());
			bower.bowBack(this);
		}

		public synchronized void bowBack(Friend bower) {
			System.out.format("%s: %s has bowed back to me!%n", this.name, bower.getName());
		}
	}

	public static void main(String[] args) {
		final Friend alphonse = new Friend("Alphonse");
		final Friend gaston = new Friend("Gaston");
		new Thread(new Runnable() {
			public void run() {
				alphonse.bow(gaston);
			}
		}).start();
		new Thread(new Runnable() {
			public void run() {
				gaston.bow(alphonse);
			}
		}).start();
	}
}

 

Deadlock describes a situation where two or more threads are blocked forever, waiting for each other. Here's an example.

Alphonse and Gaston are friends, and great believers in courtesy. A strict rule of courtesy is that when you bow to a friend, you must remain bowed until your friend has a chance to return the bow. Unfortunately, this rule does not account for the possibility that two friends might bow to each other at the same time. This example application, Deadlock , models this possibility:

 

http://java.sun.com/docs/books/tutorial/essential/concurrency/deadlock.html

 

礼仪的做法是你向对方鞠躬之后，你必须保持鞠躬姿势直到对方有机会向你回鞠躬

 

看打印描述，貌似

a.bow(b): 是b向a鞠躬

b.bowBack(a): 是a向b回鞠躬

 

我觉得更直观理解应该是：

a.bow(b): 是a向b鞠躬

b.bowBack(a): 是b向a回鞠躬