No.996

1996/07/22〜1996/07/24

Irek Ulidowski

目　次

1. Fighting Livelock in the i-Protocol with the Concurrency Factory(Concurrency Theory and Applications '96)-------------------------1

　　　　Department of Computer Science, SUNY at Stony Brook / Department of Computer Science, SUNY at Stony Brook / Department of Computer Science, SUNY at Stony Brook / Computer Command and Control Company　　　Ramakrishna, Y.S. / Smolka, Scott A. / Stark, Eugene W. / Sokolsky, Oleg

　

2. Symbolic Alternative Characterizations of Testing Preorder for Regular Timed Processes(Concurrency Theory and Applications '96)---5

　　　　Information Engineering Department, Nagoya University / Information Engineering Department, Nagoya University / Information Engineering Department, Nagoya University　　　Yuen,Shoji / Sakabe,Toshiki / Inagaki,Yasuyoshi

　

3. Speed-Sensitive Orders for Communicating Processes(Concurrency Theory and Applications '96)--------------------------------------23

　　　　Department of Information Science,Ochanomizu University　　　Satoh,Ichiro

　

4. Stepwise Synthesis of Partial Specifications preserving Strong $(\Omega_1,\Omega_2)$-Equivalence(Concurrency Theory and Applications '96)---39

　　　　電子技術総合研究所 / 電子技術総合研究所 / 電子技術総合研究所 / 電子技術総合研究所　　　磯部 祥尚 / 中田 秀基 / 佐藤 豊 / 大蒔 和仁　(Isobe,Yoshinao / Nakada,Hidemoto / Sato,Yutaka / Ohmaki,Kazuhito)

　

5. Program Slicing using Functional Networks(Concurrency Theory and Applications '96)-----------------------------------------------54

　　　　School of Computing, University of North London / School of Computing, University of North London　　　Danicic,Sebastian / Harman,Mark

　

6. A Theory of Weak Bisimulation for Core CML(Concurrency Theory and Applications '96)----------------------------------------------66

　　　　School of Cognitive and Computing Sciences, University of Sussex at Brighton / School of Cognitive and Computing Sciences, University of Sussex at Brighton / School of Cognitive and Computing Sciences, University of Sussex at Brighton　　　Ferreira,W. / Hennessy,M. / Jeffrey,A.

　

7. A Metric Semantics for the $\pi$-Calculus Extended with External Events(Concurrency Theory and Applications '96)-----------------67

　　　　NTT Communication Science Laboratories / NTT Communication Science Laboratories　　　Horita,Eiichi / Mano,Ken

　

8. A Domain for Concurrent Semantics of Mobile Processes(Concurrency Theory and Applications '96)-----------------------------------82

　　　　Faculty of Engineering, Okayama University　　　Murakami,Masaki

　

9. Symbolic Bisimulations and Proof Systems for The $\pi$-Calculus(Concurrency Theory and Applications '96)-------------------------96

　　　　Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences　　　Lin,Huimin

　

10. Time-Action Alternating Model for Verifying Symbolic Bisimulation Equivalence of Timed Processes(Concurrency Theory and Applications '96)---98

　　　　Dept. of Information and Computer Sciences, Osaka University / Dept. of Information and Computer Sciences, Osaka University / Dept. of Information and Computer Sciences, Osaka University　　　中田 明夫 / 東野 輝夫 / 谷口 健一　(NAKATA,Akio / HIGASHINO,Teruo / TANIGUCHI,Kenichi)

　

11. Multi-action $\pi$-calculus(Concurrency Theory and Applications '96)-----------------------------------------------------------111

　　　　Okayama University / Okayama University　　　ODA,Yukihiro / MURAKAMI,Masaki

　

12. On Typing Systems for the Polyadic $\pi$-Calculus(Concurrency Theory and Applications '96)-------------------------------------125

　　　　Department of Computer Science, Shizuoka University　　　Togashi,Atsushi

　

13. A Calculus of Parallel Continuations and its Monad Models(Concurrency Theory and Applications '96)-----------------------------143

　　　　Department of Computer Science and Communication Engineering, Kyushu University　　　SATO,Hiroyuki

　

14. GRAPH TYPES FOR MONADIC MOBILE PROCESSES(Concurrency Theory and Applications '96)----------------------------------------------158

　　　　Department of Computer Science, University of Edinburgh　　　YOSHIDA,NOBUKO

　

15. Execution and verification of 2nd order interval temporal logic(Concurrency Theory and Applications '96)-----------------------162

　　　　Sony Computer Science Laboratory Inc.　　　Kono,Shinji

　

16. Real-Time Synchronization Machines for Continuous Media Data(Concurrency Theory and Applications '96)--------------------------181

　　　　京都大学数理解析研究所 / 京都大学数理解析研究所 / 京都大学数理解析研究所　　　川勝 則孝 / 中島 玲二 / 田辺 誠　(Kawakatsu,Noritaka / Nakajima,Reiji / Tanabe,Makoto)

　

17. ORDERED SOS RULES AND WEAK BISIMULATION(Concurrency Theory and Applications '96)-----------------------------------------------195

　　　　Department of Computing, Imperial College / Research Institute for Mathematical Sciences, Kyoto University　　　PHILLIPS,IAIN / ULIDOWSKI,IREK

　

18. Towards Cycle Filling as Parallelization(Concurrency Theory and Applications '96)----------------------------------------------207

　　　　Department of Computer Science, Ritsumeikan University　　　Takayama,Yukihide

　

19. The symbolic model-checking methods for real-time systems(Concurrency Theory and Applications '96)-----------------------------222

　　　　Dept. of Computer Science, Shimane University　　　Yamane,Satoshi