| 09:30 – 09:35 | | 开幕式 |
| 09:35 – 10:20 | 朱涵 |
The Observation Theory of Mobile Process |
| 10:20 – 11:05 | 蔡小娟 |
Interactive Turing Machine |
| 11:05 – 11:20 | | Tea Break |
| 11:20 – 11:50 | 龙环 |
Semantics and Expressiveness of Ambient Calculi |
| | 午休 |
| 13:30 – 14:00 | 蔡烜 |
Some Combinatoral Problems |
| 14:00 – 14:30 | 何超栋 |
On the Decidability of Equivalence Checking Problems |
| 14:30 – 14:45 | | Tea Break |
| 14:45 – 15:15 | 朱洪教授 |
曼哈顿网络是NP难的，从3SAT到MMN问题的规约 |
| 15:15 – 15:45 | 陶红伟 |
基于分层和权重的软件多维可信度量模型 |
| 15:45 – 16:00 | | Tea Break |
| 16:00 – 16:30 | 陈翌佳博士 |
On the Complexity of Goedel's Proof Predicate |
| 16:30 – 17:00 | 邓玉欣博士 |
Testing Finitary Probabilistic Processes |
| 17:00 – 17:30 | 傅育熙教授 |
From Computation Model to Interaction Model |
| 17:30 | | 实验室活动 |
