基于模糊Petri网的服务发现框架研究

现有的主流服务发现方法不支持模糊逻辑推理，无法处理软计算语义，从而缺乏灵活性．为了弥补人类可理解的软计算逻辑和机器能够识别的硬逻辑的差异，提出了面向服务基于模糊Petri网的Multi-Agent服务发现框架．为支持这一框架。设计了一种模糊Petri网服务描述语言，其主要特点是变迁表示一个服务或者请求；变迁的输入库所表示服务执行前应满足的条件，变迁的输出库所表示只有在所需争件满足的情况下服务才能成功执行．变迁相关的CF值（certainty factor value）表示服务消费者对Agent所提供服务的置信度．其次，提出了支持软计算语义的松弛匹配机制，并且给出了模糊松弛匹配算法；借助于本体库（类库），通过计算命题的真实度，在不精确模糊信息情况下，可以实现服务和请求的模糊松弛匹配．     

基于网语言的Ada程序局部性质的分析和验证

旨在研究利用网语言讨论Ada程序性质和由此而引起的Ada网的状态爆炸问题.研究了Ada网的同步合成与分解,讨论了它们的语言性质,并利用这一结果分析和验证了Ada程序的安全性和活性,从而为复杂的Ada程序的分析与验证提供了一个新的有效途经.     

基于Petri网的一种时序分析方法

Ｐｅｔｒｉ网由于有强大的建模能力和成熟的理论支持,被广泛应用于各种系统的建模．本文通过把Ｐｅｔｒｉ网转换成转移系统,利用转移系统和Ｋｒｉｐｋｅ结构给出时序逻辑语义的解释,从而建立了一种在Ｐｅｔｒｉ网上进行时序分析的方法．这种方法是根据不动点理论,用模型检查验证公式正确性．通过对Ａｄａ程序会合性质进行模型检查,验证了这种方法的有效性．     

Experimenting with dynamic linking with ADA

An approach to achieving dynamic reconfiguration within the framework of Ada¹ is described. A technique for introducing a kernel facility for dynamic reconfiguration in Ada is illustrated, and its implementation using the Verdix VADS 5.5 Ada compiling system on a Sun3–120 running the 4.3 BSD Unix operating system is discussed. This experimental kernel allows an Ada program to change its own configuration dynamically, linking new pieces of code at run-time. It is shown how this dynamic facility can be integrated consistently at the Ada language level, without introducing severe inconsistencies with respect to the Standard semantics.     

Real-time interrupt handling in Ada

The Ada? programming language defines the semantics of interrupt handling as part of the tasking mechanism, making it possible to construct implementation-independent interrupt handlers. However, for the Ada mechanism to be effective, an implementation must provide support not specified by the Ada standard, such as for initializing hardware interrupting devices, handling unexpected interrupts and optimizing for real-time performance constraints. This paper analyses some of the constraints that efficient interrupt support places on an implementation. It develops a model for the interaction between interrupt hardware and Ada tasks and describes optimizations for Ada interrupt handlers. Implementation issues, including task priorities and task termination for interrupt handlers, are discussed in detail.     

基于ASM的元模型形式化语义的研究*

提出一种在模型驱动开发过程中的形式化语义描述方法。该方法利用元建模技术,形式化地描述了元模型及其语义间的映射关系,以提供精确的语义描述,从而为模型驱动开发提供有力的支持。将描述框架用于模型转换规则的定义以及元模型的分析与验证,并以简单Petri网为例,说明该方法可以有效地支持模型转换和代码生成。     

Ada中实时结构的Petri网建模与分析

本文从一般时间网出发，派生出一种简单时间网，并建模了延迟，分支选择，异步选择，优先权等Ada实时结构，特别是把优先权处理为一种时间特性，这样不仅扩充了Petri网在Ada中的建模能力，同时可以更加准确刻画Ada程序行为。     

顺序图至Petri网转化方法的研究与实现

作为一种面向对象分析和设计建模语言，统一建模语言（UML）已经越来越多的被用在大型系统中，然而，UML是半形式化的，这使得很难对其进行严格的语义分析和正确性验证。顺序图作为UML动态描述机制的重要组成部分，同样存在这样的问题，而Petri网作为一种建模工具，有着严格的形式化语义，而且有很多成熟的分析方法。该文针对UML20顺序图模型，结合几个简单Petri网结构，提出了将顺序图转换为Petri网的算法，最后通过实例说明了转化算法的有效性。     

Godel语言延迟声明语句的语义及其实现方法

Gdel语言因语言成份复杂而缺乏严格的语义基础和成熟的编译器,因此推出后它一直发展缓慢。对此采用进化代数描述了其主要语言成分延迟声明语句的过程性语义,然后介绍了依据该语义的具体实现方法并给出运行流程图和C语言描述。最后通过一个例子来具体说明延迟计算在基于扩展Warren机的编译系统中的执行情况。实验结果表明了其可行性。     

串行加工系统Petri网控制器的形式化设计方法

提出了串行加工系统控制描述规格说明的设计方法,研究了规格说明的Petri网语 义.提出了系统Petri网控制器具有活性等希望性质的初始标识的确定算法.这样的Petri网 控制器经编译或算法转换可直接对系统进行实时控制.     

基于矩阵模型的DEDS仿真

离散事件动态系统(DEDS)矩阵模型是一种逻辑运算与代数运算的混合系统。该矩阵模型给出了分析和仿真DEDS的严格框架，并用类似于控制理论状态方程的分析方法描述系统的动态行为。该文采用一种Petri网描述的适用于仿真的DEDS矩阵模型，用Matlab语言，对某炼钢厂炼钢连铸生产过程进行了实例研究。该方法比一般Petri网分析法简洁、完备，并有严密的数学描述和分析手段。     

Modular verification of Ada generics

This paper develops modular verification rules for Ada generics which are proven to be sound and complete. The generic mechanism in Ada allows modules to be parameterized by types, procedures and functions. The modularity property allows a generic to be verified once, and then exported to other modules which assume that it is correct. This requires the generic to have a specification which is used in verifying other modules, but its implementation cannot be used for this purpose. Thus, modular verification cannot be based on removing generics by macro expansion which requires the use of the generic's implementation. The main difficulty with specifying and verifying a generic is that the specification language may need to be extended with a new theory for specifying and reasoning about properties of objects whose type is a parameter to the generic. Such theories must be part of the specification of the generic, and this raises the possibility that the extended specification language may not be expressive, even if it was before the extension. The use of strings in our specification language prevents this from happening, which is proven in the paper; this is a major step toward establishing the completeness of our rules. Modularity also had a large impact on our semantics for programming constructs which is quite different from the usual semantics in the literature, even though it is still based the denotational semantics of Scott and Strachey. The main reason for this is that we had to modify the standard definition of validity. Modularity requires that validity depend on certain internal assertions in a program, such as the precondition of a procedure invoked in the program.     

基于Petri网的仓库管理流程建模

Petri网是一种有效的模型描述语言,它的应用几乎涉及到计算机学科的各个领域.本文介绍了Petri网的相关理论和工作流的发展和现状,提出了基于Petri网的工作流建模思想;基于这种思想,对仓库管理流程进行了自顶向下,逐步细化的逐层建模.     

Ada program partitioning language: a notion for distributing Adaprograms

Ada Program Partitioning Language (APPL) has been designed as part of Honeywell's Distributed Ada project. The goal of the project is to develop an approach for reducing the complexity of building distributed applications in Ada. In the proposed approach, an application is written as a single Ada program using the full capabilities of the Ada language. It is not necessary to factor the underlying hardware configuration into the program design. Once the program has been completed and tested in the host development environment, it is partitioned into fragments and mapped onto the distributed hardware. The partitioning and mapping are expressed in APPL and do not require changes to the Ada source. The main thrusts of the project include the design of APPL and the development of language translation tools and the run-time system to support Ada and APPL for a distributed target. The authors present an overview of APPL, the goals considered in the design, and issues that impact its implementation     

ARTK-M2: A kernel for Ada tasking requirements: An implementation and an automatic generator

A run-time kernel, ARTK-M2, supporting Ada tasking semantics is discussed; full support for task creation, synchronization, communication, scheduling, and termination is provided, together with all options of the Ada rendezvous. An implementation in Modula-2 is presented and a method for automatically translating Ada programs into semantically equivalent Modula-2 programs with corresponding kernel calls is introduced. A parser generator and an attribute grammar were used for the automatic translation. A subset of the Ada Compiler Validation Capability was processed to test the implementation and to illustrate the translation mechanism. The kernel is applicable to the study of real-time control systems; it can also serve as a baseline for studying implementation alternatives of Ada concepts, such as new scheduling algorithms, and for analysing new language constructs. Work is under way to implement some of the changes to the Ada tasking model being proposed as a result of the language revision (Ada9X). Finally, through proper extensions, ARTK-M2 can form an integral part of programming tools such as an Ada compilation system and a distributed kernel for multi-processing environments.