傅育熙
个性化签名
 姓名：傅育熙
 目前身份：
 担任导师情况：
 学位：

学术头衔：
博士生导师
 职称：

学科领域：
计算机软件
 研究兴趣：
傅育熙，博士、教授、博士生导师。1981年就读于同济大学计算机系，1988年由国家教委公派至英国曼彻斯特大学计算机系攻读博士学位，1992年获博士学位。1993年在曼彻斯特大学计算机系作研究助理，参与欧共体项目“CLICSII”研究。1994年1月起在上海交通大学计算机科学与工程系工作，现为上海交通大学计算机科学与工程系主任、软件学院院长、上海高校软件理论研究中心主任、中国计算机学会理事会理事、中国数学会数理逻辑专业委员会常务理事、教育部高等学校计算机科学与技术教学指导委员会专业教学指导分委员会委员、上海市计算机学会理事及学术委员会副主任、理论与人工智能专业委员会主任委员、Asian Association for Foundation of Software (AAFS) 的执行委员、上海市计算机行业协会副会长、全国示范性软件学院院长联席会主席（2004年度），是《计算机研究与发展》、《小型微型计算机系统》、《微电子学与计算机》、《计算机教育》、《软件世界》、《中国进出口软件》、《科学中国人》的编委。傅育熙教授曾负责十余个国家级科研项目的研究，是国务院政府特殊津贴、国家杰出青年基金获得者。

主页访问
2694

关注数
1

成果阅读
68

成果数
10
【期刊论文】Variations on Mobile Processes*
傅育熙， Yuxi Fu
Theoretical Computer Science, 221(1):327368, 1999.，0001，（）：
1年11月30日
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of modeling sequential computation in that it captures the operational semantics of callbyname lambda calculus. A translation from pi calculus to chi calculus is given, demonstrating that, practically speaking, pi is a sublanguage of chi. A higher order version of chi calculus is proposed and examined. It combines the communication mechanism of chi calculus and the recursion mechanism of full lambda calculus, and therefore extends both.
concurrency theory,， process algebra,， mobile process,， bisimulation

5浏览

0点赞

0收藏

0分享

159下载

0评论

引用
【期刊论文】Tau Laws for Pi Calculus
傅育熙， Yuxi Fu*， Zhenrong Yang
，0001，（）：
1年11月30日
The paper investigates the nonsymbolic algebraic semantics of the weak bisimulation congruences on finite pi processes. The weak bisimulation congruences are studied both in the absence and in the presence of the mismatch operator. Some interesting phenomena about the open congruences are revealed. Several new tau laws are discovered and their relationship is discussed. The contributions of the paper are mainly as follows: 1. It is proved that Milner's three tau laws fail to lift a complete system for the strong open congruence to a complete system for the weak open congruence in the absence of both the mismatch operator and the restriction operator. A fourth tau law is proposed to deal with the match operator under the prefix operation. It is shown that for this calculus a complete system for the strong open congruence extended with all the four tau laws is complete for the weak open congruence. 2. It is verified that the four tau laws are also enough for the weak open congruence of the picalculus without the mismatch operator. Two complete systems are given, one using distinctions and the other using a schematic law for the restriction operator. 3. It is pointed out that the standard definition of the weak open congruence gives rise to a bad equivalence relation in the presence of the mismatch operator. Two alternatives are proposed. These are the late open congruence and the early open congruence. Their difference is similar to that between the weak late congruence and the weak early congruence. Complete axiomatic systems for the two weak open congruences are given.
Process Algebra,， Mobile Process,， Bisimulation,， Axiomatization

9浏览

0点赞

0收藏

0分享

142下载

0评论

引用
【期刊论文】Categorical Properties of Logical Frameworks*
傅育熙， Yuxi Fu†
Mathematical Structures in Computer Science, 7(1):147, 1997.，0001，（）：
1年11月30日
In this paper we define a logical framework, called λTT, that is wellsuited for semantic analysis. We introduce the notion of a fibration L1: T1→C1 being internally definable1 in a fibration L2: T2→C2. This notion amounts to distinguishing an internal category L in L2 and relating L1 to the externalization of L through a pullback. When both L1 and L2 are term models of typed calculi L1 and L2 respectively, we say that L1 is an internal typed calculus definable in the frame language L2. We will show by examples that if an object language is adequately represented in λTT, then it is an internal typed calculus definable in the frame language λTT. These examples also show a general phenomenon: if the term model of an object language has categorical structure S, then an adequate encoding of the language in λTT imposes an explicit internal categorical structure S in the term model of λTT and the two structures are related via internal definability. Our categorical investigation of logical frameworks indicates a sensible model theory of encodings.

6浏览

0点赞

0收藏

0分享

96下载

0评论

引用
【期刊论文】Bisimulation Congruence of Chi Calculus
傅育熙， Yuxi Fu*
，0001，（）：
1年11月30日
Chi calculus was proposed as a process calculus that has a uniform treatment of names. Preliminary properties of chi calculus have been examined in literature. In this paper a more systematic study of bisimilarities for chi processes is carried out. The notion of Lbisimilarity is introduced to give a possible classification of bisimilarities on chi processes. It is shown that the set of Lbisimilarities form a four element lattice and that wellknown bisimilarities for chi processes fit into the lattice hierarchy. The four distinct Lbisimilarities give rise to four congruence relations. Complete axiomatization system is given for each of the four congruences.
Process Algebra,， Mobile Process,， Bisimulation,， Axiomatization

9浏览

0点赞

0收藏

0分享

107下载

0评论

引用
【期刊论文】The Ground Congruence for Chi Calculus*
傅育熙， Yuxi Fu**， Zhenrong Yang
FST TCS 2000, Lecture Notes in Computer Science 1974, 385396, 2000.，0001，（）：
1年11月30日
The definition of open bisimilarity on the χprocesses does not give rise to a sensible relation on the χprocesses with the mismatch operator. The paper proposes ground open congruence as a principal open congruence on the χprocesses with the mismatch operator. Thealgebraic properties of the ground congruence is studied. The paper also takes a close look at barbed congruence. This relation is similar to the ground congruence. The precise relationship between the two is worked out. It is pointed out that the sound and complete system for the ground congruence can be obtained by removing one tau law from the complete system for the barbed congruence.

7浏览

0点赞

0收藏

0分享

99下载

0评论

引用
【期刊论文】Recursive Models of General Inductive Types*
傅育熙， Yuxi Fu†
Fundamenta Informaticae, 26(2):115131, 1996.，0001，（）：
1年11月30日
We give an interpretation of MartinL

4浏览

0点赞

0收藏

0分享

60下载

0评论

引用
【期刊论文】Chi Calculus with Mismatch*
傅育熙， Yuxi Fu**， Zhenrong Yang
CONCUR 2000, Lecture Notes in Computer Science 1877, 596610, 2000.，0001，（）：
1年11月30日
The theory of chi processes with the mismatch operator is studied. Two open congruence relations are investigated. These are weak early open congruence and weak late open congruence. Complete systems are given for both congruence relations. These systems use some new tau laws. The results of this paper correct some popular mistakes in literature.

9浏览

0点赞

0收藏

0分享

51下载

0评论

引用
【期刊论文】Open Bisimulations on Chi Processes*
傅育熙， Yuxi Fu**
CONCUR'99, Lecture Notes in Computer Science 1664, 304319, 1999.，0001，（）：
1年11月30日
The paper carries out a systematic investigation into the axiomatization problem of the asymmetric chi calculus. As a crucial step in attacking the problem, an open style bisimilarity is defined for each of the eighteen Lbisimilarities and the two are proved to be equal. On top of the open bisimilarities, explicit definitions of the eighteen Lcongruences are given, which suggest immediately possible axioms for the congruence relations. In addition to the axioms for strong bisimilarity, the paper proposes altogether twenty one additional axioms, three of which being the wellknown tau laws and the other eighteen being new. These axioms help to lift a complete system for the strong bisimilarity to complete systems for the eighteen Lcongruences.

8浏览

0点赞

0收藏

0分享

65下载

0评论

引用
【期刊论文】Bisimulation Lattice of Chi Processes*
傅育熙， Yuxi Fu**
ASIAN'98, Lecture Notes in Computer Science 1538, 245262, 1998.，0001，（）：
1年11月30日
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of Lbisimilarity is introduced to give a possible classification of bisimilarities on chi processes. It is shown that the set of Lbisimilarities forms a four element lattice and that wellknown bisimilarities for chi processes fit into the lattice hierarchy. The four distinct Lbisimilarities give rise to four congruence relations. Complete axiomatization system is given for each of the four relations. The bisimulation lattice of asynchronous chi processes and that of asymmetric chi processes are also investigated. It turns out that the former consists of two elements while the latter twelve elements. Finally it is pointed out that the asynchronous asymmetric chi calculus has a bisimulation lattice of eight elements.

6浏览

0点赞

0收藏

0分享

69下载

0评论

引用
傅育熙， Yuxi Fu†‡§
，0001，（）：
1年11月30日
The paper proposes a new process algebra, called χcalculus. The language differs from πcalculus in several aspects. First it takes a more uniform view on input and output. Second, the closed names of the language is homogeneous in the sense that there is only one kind of bound names. Thirdly, the effects of communications in χcalculus are delimited by localization operators, not by sequentiality combinator. Finally, the language cherishes more freedom of parallelism than xcalculus. The algebraic properties of χprocesses are studied in terms of local bisimulation. It is shown that local bisimilarity is a congruence equivalence on χprocesses.
Bisimulation,， πCalculus

5浏览

0点赞

0收藏

0分享

52下载

0评论

引用