期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
Event-Based Operational Semantics and a Consistency Result for Real-Time Concurrent Processes with Action Refinement 被引量:2
1
作者 Xiu-LiSun Wen-YinZhang Jin-ZhaoWu 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第6期828-839,共12页
In this paper an event-based operational interleaving semantics is proposed for real-time processes, for which action refinement and a denotational true concurrency semantics are developed and defined in terms of time... In this paper an event-based operational interleaving semantics is proposed for real-time processes, for which action refinement and a denotational true concurrency semantics are developed and defined in terms of timed event structures. The authors characterize the timed event traces that are generated by the operational semantics in a denotational way, and show that this operational semantics is consistent with the denotational semantics in the sense that they generate the same set of timed event traces, thereby eliminating the gap between the true concurrency and interleaving semantics. Keywords action refinement - real-time process algebra - semantics - timed event structure - formal method This work was supported by the National Natural Science Foundation of China (Grant No. 60373113) and the “Hundred-Talent Program” of Chinese Academy of Sciences.Xiu-Li Sun was born in 1975. She received her B.S. degree in 1998 and M.S. degree in 2002 from Taiyuan University of Technology, Shanxi. She is studying in the Institute of Computer Application, Chengdu for her doctorate.Wen-Ying Zhang was born in 1972. Now he is a Ph.D. candidate of Computer Application, the Chinese Academy of Sciences. His current research interests include formal verification, digital watermarking and pattern recognition.Jin-Zhao Wu was born in 1965. He obtained his Ph.D. degree in 1994 from the Institute of System Science, CAS. From 1994 to 1999 he was a postdoctoral researcher. His research interests include formal specification and verification, automatic reasoning, logic programming. 展开更多
关键词 action refinement real-time process algebra SEMANTICS timed event structure formal method
原文传递
The Intelligent CAI System for Chemistry Based on Automated Reasoning
2
作者 王晓京 张景中 《Journal of Computer Science & Technology》 SCIE EI CSCD 1999年第5期495-509,共15页
A new type of intelligent CAI system for chemistry is developed inthis paPer based on automated reaJsoning with chemistry knowledge. The systemhas shown its ability to solve chemistry problems, to assist students and ... A new type of intelligent CAI system for chemistry is developed inthis paPer based on automated reaJsoning with chemistry knowledge. The systemhas shown its ability to solve chemistry problems, to assist students and teachersin studies and instruction with the automated reasoning functions. Its open modeof the knowledge base and its unique style of the illterface between the system andhuman provide more opportunities for the users to acquire living knowledge throughactive participation. The automated reasoning based on basic chemistry knowledgealso opened a new approach to the information storage and management of the ICAIsystem for sciences. 展开更多
关键词 ICAI automated reasoning chemistry knowledge base terminology understanding
原文传递
具有动作细化的实时并发进程的基于事件的操作语义以及一致性结果
3
作者 Xiu-LiSun Wen-YinZhang Jin-ZhaoWu 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第C00期28-28,共1页
对于包含动作精化的实时进程代数,人们已经为它定义了指称真并发语义。在这种语义里,动作精化被看作是一个操作符。人们自然会有这样的疑问:既然已经定义了指称真并发语义,为什么还要定义操作语义?这个问题可以从以下两个方面回答... 对于包含动作精化的实时进程代数,人们已经为它定义了指称真并发语义。在这种语义里,动作精化被看作是一个操作符。人们自然会有这样的疑问:既然已经定义了指称真并发语义,为什么还要定义操作语义?这个问题可以从以下两个方面回答:首先,对于不带时间变量和动作精化操作的进程,为它赋予一个“标准”语义的含义就是指为它定义一个操作语义。定义操作语义常用的方法是定义一个具有标记的传递系统,它是由一些推理规则组成的集合。 展开更多
关键词 操作语义 实时 并发进程 操作符 进程代数 事件 细化 刻画 时间变量 推理规则
原文传递
逻辑程序中的对称结构
4
作者 Jin-ZhaoWu HaraldFecher 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第C00期25-25,共1页
逻辑程序设计是程序设计的重要方法之一,所谓程序语义,就是赋予程序以意义。语义研究是逻辑程序设计中的一个重要课题,衡量一个给定逻辑程序语义成功与否一般有三个标准:第一,是否与常识相吻合;第二,表达能力如何;第三,是否具... 逻辑程序设计是程序设计的重要方法之一,所谓程序语义,就是赋予程序以意义。语义研究是逻辑程序设计中的一个重要课题,衡量一个给定逻辑程序语义成功与否一般有三个标准:第一,是否与常识相吻合;第二,表达能力如何;第三,是否具有可计算性。用这三个标准衡量,几乎所有已知的逻辑程序语义都有缺点。例如封闭世界假设CWA,与常识相吻合并且计算复杂性不大,但表达能力太弱,只适用于确定的程序。虽然被加以改进,表达能力增强,但计算复杂度增大并且时常与常识相悖。又比如,SLD-归结,SLDNF-归结以及循环不动点语义只对确定的,层次的和分层的程序有效;完全化过程对于非分层的程序还可能导致矛盾。因而,从表达能力上看,这些语义都是受限的。 展开更多
关键词 逻辑程序设计 归结 计算复杂度 计算复杂性 可计算性 分层 语义 吻合 封闭 循环
原文传递
Symmetric Structure in Logic Programming
5
作者 Jin-ZhaoWu HaraldFecher 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第6期803-811,共9页
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics.... It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics. The work presented here may be seen as representative examples along this line. The focus is on the derivation of negative information and some other classic semantic issues. We first define a permutation group associated with a given logic program. Since usually the canonical models used to reflect the common sense or intended meaning are minimal or completed models of the program, we expose the relationships between minimal models and completed models of the original program and its so-called G-reduced form newlt-derived via the permutation group defined. By means of this G reduced form, we introduce a rule to assume negative information termed G-CWA, which is actually a generalization of the GCWA. We also develop the notions of G-definite, G-hierarchical and G-stratified logic programs, which are more general than definite, hierarchical and stratified programs, and extend some well-known declarative and procedural semantics to them, respectively. Keywords symmetry - logic programming - semantics Partially supported by the National Natural Science Foundation of China under Grant No.60373113.Jin-Zhao Wu was born in 1965. He obtained his Ph.D. degree in 1994 from the Institute of Systems Science, the Chinese Academy of Sciences. From 1994 to 1999 he was a post-doctoral and research scientist in Peking University and Max-Planck Institute of Computer Science. Since 2000 he has been working on the Faculty of Mathematics and Computer Science, University of Mannheim.Harald Fecher was born in 1972. He obtained his Ph.D. degree in 2003 from the Faculty of Mathematics and Computer Science, University of Mannheim. Since 2004 he has been research scientist in the Faculty of Computer Science, University of Kiel. 展开更多
关键词 SYMMETRY logic programming SEMANTICS
原文传递
Action Refinement for Real-Time Concurrent Processes with Urgency
6
作者 覃广平 吴尽昭 《Journal of Computer Science & Technology》 SCIE EI CSCD 2005年第4期514-525,共12页
Action refinement for real-time concurrent processes with urgent interactions is studied, where a partial-order setting, i.e., timed bundle event structures, is used as the system model and a real-time LOTOS-like proc... Action refinement for real-time concurrent processes with urgent interactions is studied, where a partial-order setting, i.e., timed bundle event structures, is used as the system model and a real-time LOTOS-like process algebra is used as the specification language. It is shown that the proposed refinement approaches have the commonly expected properties:(1) the behaviour of the refined process can be inferred compositionally from the behaviour of the original process and from the behaviour of the processes substituted for actions; (2) the timed extensions of pomset (partially ordered multiset) trace equivalence and history preserving bisimulation equivalence are both congruences under the refinement; (3) the syntactic and semantic refinements coincide up to the aforementioned equivalence relations with respect to a cpo-based denotational semantics. 展开更多
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部