数理解析研究所講究録 996

Concurrency Theory and Applications ’96

京都大学数理解析研究所
1997 年 5 月

Preface
This volume contains the proceedings of the RIMS Workshop in Computing
titled Concurrency Theory and Applications ‘96 which took place at Kyoto
University in July 1996. The aim of the workshop was to bring together
researchers and practitioners interested in concurrency in order to discuss
recent developments and trends in concurrency theory, exchange experiences
and opinions on applications of concurrency and to establish research contacts.
In response to the call for papers, fifteen papers were accepted to be presented at the workshop and to appear in the proceedings. Also, four speakers
from abroad were invited: Professor Matthew Hennessy of the Universityof Sussex, $UK$ , Professor Scott Smolka of SUNY at Stony Brook, USA, Dr
Huimin Lin of the Chinese Academy of Sciences, Beijing, China and Dr
Mark Harman of the University of North London, $UK$ .
The papers appearing in this volume span a wide range of topics, including
timed and classical process algebras and their applications, semantics forCML, semantics and types for the -calculus, model checking and description of real time and multimedia systems, program slicing and temporallogic.
I would like to thank all those who presented their research at the workshop
as well as those who only attended it. Moreover, I particularly wish to thankYasuhiko Minamide, Shoji Yuen and Susumu Nishimura for an invaluable
help throughout the preparation and organisation of the workshop.
$\pi$

Irek Ulidowski

996

京都大学数理解析研究所講究録

Wor ksof$\Uparrow 0\beta$$R\epsilon s$

and A$\epsilon 0ry$$C$

Aa $ir$ ma 11: 1$22\sim 2l$

Livelock$i\Uparrow th\epsilon$

$i$

$i$

, 1996$U1|\mathfrak{g}_{0}wski$$r\epsilon k$$CoI|$$FiQAtin\mathfrak{g}$$\beta \mathfrak{p}1i$

$i$

July

1.

cat $ions$96
ear ch lns ti tute for Mat hemat cal Sc enc es, Kyoto Un iversi ty
Co $lIcurr\epsilon nty$ Th$( Ky0to Univ. )${ en $ts$-Protocol witA the Concurrency $Fact0ry——1$

Y. S. Ramakrishna, Scott A. Smolka, Eugene W. Stark(SUNYat Stony Brook,$01e\mathfrak{g}Soko1s$

2.

$S$USA)ky ( $Com\mathfrak{p}uterC$ omma $nd$

ymb $0|ic$ A 1 $tern$ a $tiveCh$ a

Regular Timed$Shoii$$Yuen$ ,$r$

a $ndContro1$$Toshiki$

Sa a $be$ ,$k$$Y$

a $suy0shi$ 1 a a$n$$i$

Ichiro Sa $toh$ ( $0rhan$ 0111

$i$

am

$S$

Sebastian,$Phi|$

a$d\epsilon 1\mathfrak{p}hi$$Preor4\epsilon r$

a,$U$SA)

$for$

$ki$

(

$N$a$\mathfrak{g}0y$a $Univ$ . )$Process\epsilon s------------------23$

zu Univ. )$lr\epsilon s\epsilon rvi\Uparrow 0$

Stronoa1 $ence———————————————–39$

Yoshi nao 1 sobe, Hi4 emo to Nakada,$Pro\mathfrak{g}r$

$i$

$Q$

Synthesis of Partial Specifications$(\Omega 1 ’ \Omega_{2})-EQuiv$

5.

$ny$

$Processes———————–$. $——————-5$$e$$St\epsilon \mathfrak{p}wise$aa $cteriz$ a $tionsofTesti$ ng

3. Speed-S ns iti ve Orders for Commun cat ng

4.

$Com\mathfrak{p}$$Yut$

I $icin\mathfrak{g}usin\mathfrak{g}Functio|i$ a1$Danici\iota$, Mark Harman$Ne$a ka Sa to, Kazu$hi$

to Ohma ki$(ETL)$

two $rks—————————-54$
of North London, England)(Univ

6. A The ory of Weak Bisi mu 1 at on for Core $CML—————————66$$i$

W. Ferreira, M. Hennessy, A(Univ7Jeffreyof Sussex at Brighton, Enoland)

A Me $tricSe$ Illa $ntics\cdot f0rthe$ $\pi-Ca1cu1usExtendedwith$ Ex( $NTT$ Commu $nic$ a $tion$ Sc
a $bor$ a$EiichiHorit$ a, $Ken$ Ma$t\epsilon rn$$i\epsilon nc\epsilon L$$fI0$

8. A $D0mainfor$ $Concurrent$ Semant cs
$i$

$of$

Masaki Murakami (Okayama Univ. )$-|-$a1 Ev $ents-67$$tori\epsilon s$)

Mo $bi1\epsilon p_{r0c\epsilon sses}------------82$

9. Symb $01icBisi$ mul a $ti0ns$ an4
Hu $iminLin$ ( A$C$

10.

$Ti$

me-Ac

$ti0\Uparrow$$in\epsilon s\epsilon$$Pr\sigma 0f$

Ac $a4$ emy

A1 $tern$ a $ti11Q$ Mo

Syst ems$ofScienc\epsilon s$$d\epsilon 1$,Th$for$$B\epsilon ijin0$$Yukihiro0da$ , Ma$s$aMu akam

$ki$$r$( $0k$ ayama$i$

Systems for the $PoIyadic$$Ty\beta in\mathfrak{g}$

A $in$ a)(OsakaUniv. )$\pi-calculus--------------------------------------------111$$MuIt|-acti0n$

$0n$

$C$

Symb $01icBisi$ mu 1 a $ti0n$$\uparrow 0rV\epsilon rifyin\mathfrak{g}$Akio Nakata, Teruo Higashino, Kenichi Taniouchi

12.

,$Processes—————————————98$

Equivalence of Timed

11 .

n-Ca 1 $cu1us———96$

$f$

$\pi$

$Univ$.)-Cal $culus———————-125$

Atsushi Togashi (Shizuoka Univ. )13. A Ca 1 $cu1us0fP$ a a11$r$$e1$

Co $nt|nu$ a $tions$ a$nd$$its$$Mona4$

Mo4 $\epsilon 1s-----------143$

Hiroyuki Sato (Kyushu Univ. )14. GRAPH TYPES FOR MONADIC MOBILE $PROCESSES—————————-158$
Nobuko Yoshida (Univof $E4iIlbur0h$ , Scotland)

15. Execution and verification of 2nd order interval
SA $inii$ Kon

16.

$0$

(So $nycom\mathfrak{p}ut\epsilon rSci\epsilon nce$

$tem00raI$$|0Qic-----162$

La $bor$ a $tory1nc$ . )a $1-Ti$ me Sy $nchronization$ Ma $t\Uparrow\dot{|}n\epsilon sforContinuous$ Me 4 a Da $ta——–181$$(Ky0toUniv. )$$Norit$ a aawa a $tsu$ , $Reiji$ a a ma, a $kot0$ a a$R\epsilon$

$i$

$k$

$K$

$N$

$k$

$k$

$M$

$i\dot{|}$

$T$

$n$

$b\epsilon$

17. ORDERED SOS RULES AND WEAK $BlSlMULAT10N—————————–195$(1 a $inP$ Aa1a ), 1 $rekU1i4owski$ ( $Ky0to$ Un . )$i|1i\mathfrak{p}s$18.

$1m\beta er\dot{|}$$Towar4s$ Cy $c1\epsilon Fi11i$ nO$C0|1e\mathfrak{g}e,$$En\mathfrak{g}|$

$n4$

$iv$

a $sP$ a a 11 $e|iz$ a $tion—————————-207$$r$

Yukihide Takayama (Ritsumeikan Univ. )19.

$Th\epsilon syI11bo1icm0de1-c\Uparrow eckin\mathfrak{g}$Satoshi Yamane (Shimane Univ

me $thodsforre$ a $1-ti$ me $syst\epsilon I\mathfrak{n}s-----------222$)$-\cdot\dot{I}$$-$