$B65M\3XIt9-0h2J3X2J(B $B309q8lO@J89VFI(B I$B!&(BIII (2000$BG/EYE_3X4|(B)

$B%a%s%P!<(B

$BC4Ev(B
$B8^==Mr(B $B=_(B (igarashi@graco)
$B;22C$BA}86@h@8(B (masuhara@graco)
$BGp86@h@8(B (kashiwa@graco)
$B6L0f@h@8(B (tamai@graco)
$B;38}BY@h@8(B (yama@graco)
$B?e8}BgCN(B (daichi@graco)
$B2,K\5H1{(B(yoshio@klee)
$B;fL>E/@8(B(kamina@graco)
$B9?(B $B=_>M(B (sshong@is.s.u-tokyo.ac.jp)
$B>>ED8;N)(B (matsuda@graco)

$B%9%1%8%e!<%k(B

$BF|;~(B$B>l=j(B$BC4Ev
11/8($B?e(B) 18:00$B!A(B 15$B9f4[(B106$B9?(B (1,2$B>O(B) ($B;qNA(B ppt)
11/15($B?e(B) 18:00$B!A(B 15$B9f4[(B101$B2,K\(B (3$B>O(B) ($B;qNA(B ps.gz)
11/22($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B;fL>(B (4 $B>O(B)
11/29($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B;fL>(B(4$B>O(B) ($B;qNA(B ps.gz)
12/6($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B>>ED(B (5$B>O(B)
12/13($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B>>ED(B (5$B>O(B)
1/10($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B?e8}(B (8$B>O(B)
1/31($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $BGp86(B (9$B>O(B)
2/7($B?e(B) 18:20$B!A(B 15$B9f4[(B 101 $BGp86(B (9.6) $B8^==Mr(B (10.3)
2/14($B?e(B) 18:00$B!A(B 15$B9f4[(B101 $B9?(B (10.1-2) $B;fL>(B (10.4-5)

$B652J=q(B

Robin Milner, Communicating and Mobile Systems: the Pi-calculus, Cambridge University Press, 174 pages, ISBN 0-521-65869-1, June 1999.

$BL\ ()$B$G0O$^$l$?>O$O!$$?$V$s$H$P$7$^$9!%(B

Part I: Communicating Systems

  1. Introduction
  2. Behaviour of Automata
  3. Sequential Processes and Bisimulation
  4. Concurrent Processes and Reaction
  5. Transitions and Strong Equivalence
  6. (Observation Equivalence: Theory)
  7. (Observation Equivalence: Examples)

Part II: The Pi-Calculus

  1. What is Mobility?
  2. The Pi-Calculus and Reaction
  3. Applications of the Pi-Calculus
  4. Sorts, Objects, and Functions
  5. Commitments and Strong Bisimulation
  6. (Observation Equivalence and Examples)
  7. (Discussion and Related Work)

igarashi@graco.c.u-tokyo.ac.jp
Last update on $Date: 2002-04-25 16:00:38 +0900 (ÌÚ, 25 4·î 2002) $.