面向传值进程的谓词μ-演算与FO(HML)的完备推演系统

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

π-演算互模拟判定算法的优化和实现

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

an intuitive formal proof for deadline driven scheduler

United Nations University, Int. Inst. for Softw. Technol., China; Vietnam National University, Hanoi, Vietnam; Vietnam Academy of Science and Technology, Vietnam

Formalization and specification for controlling process modularity in mobile computing

新的计算模式，普适计算和全局计算，正在作为高度分布式和移动计算的计算模式展现出来。这篇论文探讨了在抽象层面上支持这些新型计算模式的适合的形式化基础，关注在进程移动单位上的控制, 以便在分布式与移动计算环境下更好地协调进程的移动性。 论文的第一部分概述了针对分布式、移动计算的现有进程演算模型中的进程移动单元，并且设计了一种在此方面更优、更具弹性的进程框架。为了表示这种进程框架，我们提出了一种新的、针对移动和分布式系统的进程演算,这种进程演算的优点是动态、弹性的控制进程的移动单元；具体的思路就是扩展π- calculus以及其支持分布式和移动性的变体。我们把这种新的演算叫做Modular π-calculus。我们通过这种演算的提出来说明进程框架提供了一种针对移动进程更为合适的协调机制以及编程模型，例如移动的代理和动态组件载入的支持。之后，我们通过讨论互模拟的几种提法来具体说明能够反映演算设计的进程描述的关键，之后我们讨论了它们的具体性质。 本文的第二部分提出了一个对进程模型的行为和性质进行推理的规约框架。首先，提出了一个对Modularπ-calculus中进程的系统性质进行规约的模态逻辑。为了更好的理解该逻辑，文中对由这个逻辑推出的进程等价的特征进行了研究，并且证明了该逻辑的区分能力介于互模拟和结构一致之间。接下来关于这个规约框架的自动化，本文针对该逻辑和Modular π-calculus的有限控制子集，提出了模型检测算法，并且给出了算法正确性的证明。同时文中贯穿了一些实际且直观的例子，以展现本文提出的一组框架即演算、逻辑和模型算法的有效性。

BPEL引擎监控平台的设计与实现

WS-BPEL作为WEB服务复合事实上的标准正引起越来越多的关注，它可以用来整合物理上分布的服务，构建复杂的业务流程。复合服务的执行依赖于分布的自治的第三方服务，其实际行为可能与预先指定的行为约束不一致；此外，由于复合服务的动态性和灵活性，其本身在运行期间可能发生动态调整，以适应不断变化的业务环境，因此需要对复合服务的行为在运行期进行连续的监控，保证复合服务的正确执行。同时，通过对复合服务的运行时监控，可以获取执行期间的各种性能信息，从而为流程的优化和动态的服务选择提供依据。 本文首先对业务流程运行时的监控需求进行了分析，然后针对这些监控需求，结合BPEL流程的特点，设计了一种新型的基于事件的监控需求描述语言Mon-BPEL，它可以精确的刻画功能性和非功能性的监控需求。相对于其他基于事件的监控需求描述语言(如 Event Calculus，Past LTL等)，Mon-BPEL可以方便的刻画流程执行事件序列之间的时序关系，同时，它具有简洁易懂，用户友好等特点。 此外，本文研究了基于AOP技术的业务流程监控机制。论文设计了一种针对BPEL语言的AOP扩展方案，以支持对业务流程运行期的动态监控。通过将监控需求映射为方面，从而分离了关注点，降低了业务流程开发的复杂度，提高了流程的可维护性。接着给出了Mon-BPEL监控需求表达式的的自动机语义，并基于自动机理论对监控需求表达式进行计算，检查指定的监控需求是否违背。最后，论文探讨了Aspect的动态编织机制，将监控功能引入BPEL引擎。 论文最后给出了监控平台在OnceBPEL引擎中的实现，并将前面提到的研究成果引入其中,通过实验对系统的功能及性能进行了测试与评估。

Influence of processing medium on frictional wear properties of ball bearing steel prepared by laser surface melting coupled with bionic principles

Coupling with bionic principles, an attempt to improve the wear resistance of ball bearing steel (GCr15) with biomimetic units on the surface was made using a pulsed Nd: YAG laser. Air and water film was employed as processing medium, respectively. The microstructures of biomimeitc units were examined by scanning electron microscope and X-ray diffraction was used to describe the microstructure and identify the phases as functions of different mediums as well as water film with different thicknesses. The results indicated that the microstructure zones in the biomimetic specimens processed with water film were more refined and had better wear resistance increased by 55.8% in comparison with that processed in air; a significant improvement in microhardness was achieved by laser surface melting. The application of water film provided considerable microstructural changes and much more regular grain shape in biomimetic units, which played a key role in improving the wear resistance of ball bearing steel. (c) 2010 Elsevier B.V. All rights reserved.

基于多Agent制造过程的建模方法

分析了制造系统与制造过程之间的关系;论证了从过程的角度对制造进行建模更恰当;结合Agent和π演算的特点,给出Agent制造系统描述模型及基于π演算的单个Agent的BDI模型,并指出Agent和π演算结合的制造过程模型有利于进行优化目标在不同制造过程层次的分解,不论从方法的角度还是实现的角度,都适合复杂系统建模。Agent和π演算相结合可以有效分析并解决离散事件的建模与仿真中的问题。

Taxonomic Syntax for First-Order Inference

Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax.

Type-omega DPLs

Type-omega DPLs (Denotational Proof Languages) are languages for proof presentation and search that offer strong soundness guarantees. LCF-type systems such as HOL offer similar guarantees, but their soundness relies heavily on static type systems. By contrast, DPLs ensure soundness dynamically, through their evaluation semantics; no type system is necessary. This is possible owing to a novel two-tier syntax that separates deductions from computations, and to the abstraction of assumption bases, which is factored into the semantics of the language and allows for sound evaluation. Every type-omega DPL properly contains a type-alpha DPL, which can be used to present proofs in a lucid and detailed form, exclusively in terms of primitive inference rules. Derived inference rules are expressed as user-defined methods, which are "proof recipes" that take arguments and dynamically perform appropriate deductions. Methods arise naturally via parametric abstraction over type-alpha proofs. In that light, the evaluation of a method call can be viewed as a computation that carries out a type-alpha deduction. The type-alpha proof "unwound" by such a method call is called the "certificate" of the call. Certificates can be checked by exceptionally simple type-alpha interpreters, and thus they are useful whenever we wish to minimize our trusted base. Methods are statically closed over lexical environments, but dynamically scoped over assumption bases. They can take other methods as arguments, they can iterate, and they can branch conditionally. These capabilities, in tandem with the bifurcated syntax of type-omega DPLs and their dynamic assumption-base semantics, allow the user to define methods in a style that is disciplined enough to ensure soundness yet fluid enough to permit succinct and perspicuous expression of arbitrarily sophisticated derived inference rules. We demonstrate every major feature of type-omega DPLs by defining and studying NDL-omega, a higher-order, lexically scoped, call-by-value type-omega DPL for classical zero-order natural deduction---a simple choice that allows us to focus on type-omega syntax and semantics rather than on the subtleties of the underlying logic. We start by illustrating how type-alpha DPLs naturally lead to type-omega DPLs by way of abstraction; present the formal syntax and semantics of NDL-omega; prove several results about it, including soundness; give numerous examples of methods; point out connections to the lambda-phi calculus, a very general framework for type-omega DPLs; introduce a notion of computational and deductive cost; define several instrumented interpreters for computing such costs and for generating certificates; explore the use of type-omega DPLs as general programming languages; show that DPLs do not have to be type-less by formulating a static Hindley-Milner polymorphic type system for NDL-omega; discuss some idiosyncrasies of type-omega DPLs such as the potential divergence of proof checking; and compare type-omega DPLs to other approaches to proof presentation and discovery. Finally, a complete implementation of NDL-omega in SML-NJ is given for users who want to run the examples and experiment with the language.

Toward a Theory of Representation Design

This research is concerned with designing representations for analytical reasoning problems (of the sort found on the GRE and LSAT). These problems test the ability to draw logical conclusions. A computer program was developed that takes as input a straightforward predicate calculus translation of a problem, requests additional information if necessary, decides what to represent and how, designs representations capturing the constraints of the problem, and creates and executes a LISP program that uses those representations to produce a solution. Even though these problems are typically difficult for theorem provers to solve, the LISP program that uses the designed representations is very efficient.