Windows95／NT系统的进程间通信

１引言Ｗｉｎｄｏｗｓ９５／ＮＴ系统中允许使用多种进程间通信手段,标准的通信方式包括：剪贴板（Ｃｌｉｐｂｏａｒｄ）、动态数据交换（ＤＤＥ）和对象连接与嵌套（ＯＬＥ）。关于这些技术的讨论,不在此赘述。在编写Ｗｉｎｄｏｗｓ９５／ＮＴ应用程序时,进程内的各模块之间通常采用ＳｅｎｄＭｅｓｓａｇｅ过程进行相互通信和交换数据。由于Ｗｉｎｄｏｗｓ９５／ＮＴ系统给每个运行中的应用程序提供了自己的虚拟存储空间,这就意谓着两个应用程序之间不能采用常规模块内相互通信的方法进行进程间通信。Ｄｅｌｐｈｉ作为Ｗｉｄｎｏｗｓ下…     

远程通信技术在计算机监控系统中的应用

在生产现场的计算机监控系统中,利用调制解调器和电话线构成拨号网络,采用Ｖｉ－ｓｕａｌ Ｂａｓｉｃ语言编程,把生产现场检测数据传送到厂部信息管理中心;在厂部管理系统中,采用Ｄｅｌｐｈｉ语言建立数据库,实时处理和保存远程数据。从而解决了某些计算机控制系统（或 ＤＣＳ系统）与远程管理系统数据传送的技术难题。     

数据传送进程的符号互模拟*

本文提出数据传送进程的符号迁移语义，引入符号互模拟的概念，证明了两个进程在传统意义下互模拟当且仅当它们符号互模拟．由于无穷域上的数据传送进程的传统迁移图是无穷的，而其中相当一部分的符号迁移图是有穷的，文章的结果为在有穷时间和空间内判定这类进程的互模拟关系开辟了可能性．     

数据传送进程的符号互模拟

本提出数据传送进程的符号迁移语义，引入符号互模拟的概念，证明了两个进程在传统意义下互模拟当且仅当它们符号互模拟。我穷域上的数据传送进程的传统迁移图是无穷的而其中相当的一部分的符号迁移图是有穷的，章的结果为在有穷时间和空间内判定这类进程的互模拟关系开辟了可能性。     

分布进程间通信合作因果关系及因果序的保证

本文介绍了在计算机分布式环境下相互合作的进程中通信合作事件间的因果关系（ＣａｕｓａｌＲｅｌａｔｉｏｎｓ），基于在一组相互合作的进程间可能同时服务于多个任务，而且这些任务间可能并不相关这一观点，引入了事件类（ＥｖｅｎｔＣｌａｓｓ）概念，并利用事件类概念，提出了保证因果序（ＣａｕｓａｌＯｒｄｅｒｉｎｇ）的算法．     

Windows环境下的并发程序设计

本文从Ｗｉｎｄｏｗｓ的消息驱动机制入手，分析了Ｗｉｎｄｏｗｓ的多任务机制，用ＢｏｒｌａｎｄＣ＾＋＋的ＯｂｊｅｃｔＷｉｎｄｏｗｓ描述了Ｗｉｎｄｏｗｓ环境下的多进程发程序设计及所涉及的有关数据共享问题。     

Unix环境下多进程数据共享的实例

对于Unix操作系统,在同一时刻,系统中可以有多个处于运行的进程。这些进程还可以通过特定的数据共享内存段实现信息交换和数据共享。进程间的数据共享从实现机理上,就是一个进程把要传送的数据写入共享内存段,另一进程从共享内存段中读出该数据。Unix提供了这方面的库函数,用户通过调用标准函数,可以在自己开发的特定应用环境下,使多个应用模块进程之间实现数据信息的交换。     

π-演算中无卫递归的消除

本文提出消除π－演算中无卫递归的公理，证明了将该公理加入到正则π－演算受卫递归子集上的证明系统后，所得到的证明系统在π－演算全体正则子集上关于互模拟等价的可靠性和完备性.     

基于RTX的实时数据处理系统

为了解决远程设备数据处理不及时的问题,提出了一种基于RTX实时操作系统的设备数据处理系统.该系统由RTX实时数据处理进程和人机交互进程两部分组成,其中RTX实时数据处理进程负责接收远程设备端的数据并进行实时的处理,将处理过的数据经共享内存和同步事件对象等通信方式,传输到Win32的人机交互进程进行显示和存储数据,同时用户可以通过控制指令修改远程设备的状态.实验证明,该系统解决了设备数据处理不及时的问题,保证了设备管控的实时性和稳定性,能够满足对远程设备进行实时管控的要求.     

与主进程并发运行的串行通信程序设计

本文介绍利用环形数据队列结合中断技术来处理全双工串行通信数据，实现主进程与通信进程的并发运行，并尽可能地减少两进程之间的互相牵制，从而提高了ＣＰＵ的运行效率。文中详细给出了Ｃ语言源程序。     

Formalising a Value-Passing Calculus in HOL

Milner's value-passing calculus for describing and reasoning about communicating systems is formalised in the HOL proof assistant. Based on a previously defined mechanisation of pure CCS (no data communication, only synchronisation) in HOL, value-passing agents are given behavioural semantics by translating them into pure agents. An interactive proof environment is derived that supports both reasoning about the value-passing calculus and verification of value-passing specifications, which are defined over an infinite value domain. Received September 1997 / Accepted in revised form July 1999     

On decidability and model checking for a first order modal logic for value-passing processes

A semantic interpretation of a first order extension of Hennessy-Milner logic for value-passing processes, named HML(FO), is presented. The semantics is based on symbolic transition graphs with assignment. It is shown that the satisfiability of the two-variable sub-logic HML(FO2) of HML(FO) is decidable, and the complexity discussed. Finally, a decision procedure for model checking the value-passing processes with respect to HML(FO2) is obtained.     

Fuzzy arithmetic-based interpolative reasoning for nonlinear dynamic fuzzy systems

FAIR (fuzzy arithmetic-based interpolative reasoning)—a fuzzy reasoning scheme based on fuzzy arithmetic, is presented here. Linguistic rules of the Mamdani type, with fuzzy numbers as consequents, are used in an inference mechanism similar to that of a Takagi–Sugeno model. The inference result is a weighted sum of fuzzy numbers, calculated by means of the extension principle. Both fuzzy and crisp inputs and outputs can be used, and the chaining of rule bases is supported without increasing the spread of the output fuzzy sets in each step. This provides a setting for modeling dynamic fuzzy systems using fuzzy recursion. The matching in the rule antecedents is done by means of a compatibility measure that can be selected to suit the application at hand. Different compatibility measures can be used for different antecedent variables, and reasoning with sparse rule bases is supported. The application of FAIR to the modeling of a nonlinear dynamic system based on a combination of knowledge-driven and data-driven approaches is presented as an example.     

带复杂数据结构的模型检测工具

模型检测是近二十几年来最成功的自动验证技术之一，而模型检测工具的开发是将模型检测和实际相结合的关键．为了有效地对涉及到复杂数据类型的并发传值系统进行模型检测，总结了以扩展的带赋值符号迁移图和模态图分别作为并发系统和逻辑公式的语义模型来实现模型检测工具的工作，特别是将复杂数据结构引入传值进程定义语言和带赋值符号迁移图．同时结合实际例子说明模型检测工具的有效性．     

传值系统的互模拟与谓词等式系

本文引入描述传值并系统的新模型“带赋值符号迁移图（ＳＴＧＡ）”推广了Ｈｅｎｎｅｓｓｙ和Ｌｉｎ提出的“符号迁移图”的概念，允许迁移上带有赋值，从而能将更大的一类传值系统表示为有穷状态图，ＳＴＧＡ的中车优点是在并行运算不封闭，文中给给ＳＴＧＡ的操作语义，在此基础上定义了ＳＴＧＡ的互模拟等价关系，为了刻划ＳＴＧＡ的互模拟，以谓词等式系的形式在一阶逻辑的正子集中扩充了最大和最小不动点，并设计了一个算法将Ｓ     

Mean-value analysis of multi-facility blocking models with state-dependent arrivals

A new mean-value type of algorithm is developed for analyzing multi-facility blocking models with state-dependent arrival rates. It can be applied to a broad class of blocking systems with simultaneous resource possession including, for example, circuit-switched networks. The underlying recursion is cast in terms of blocking probabilities and marginal state probabilities. The developments made here generalize previous results that were restricted to the case of constant arrival rates.     

Model Checking Real-Time Value-Passing Systems

In this paper, to model check real-time value-passing systems, a formal language Timed Symbolic Transition Graph and a logic system named Timed Predicate p-Calculus are proposed. An algorithm is presented which is local in that it generates and investigates the reachable state space in top-down fashion and maintains the partition for time evaluations as coarse as possible while on-the-fly instantiating data variables. It can deal with not only data variables with finite value domain, but also the so called data independent variables with infinite value domain. To authors knowledge, this is the first algorithm for model checking timed systems containing value-passing features.     

A proof system for communicating processes with value-passing

A proof system for a version of CCS with value-passing is proposed in which the reasoning about data is factored out from that about the structure of processes. The system is shown to be sound and complete for finite terms with respect to a denotational semantics based on Acceptance Trees.     

State space reduction for process algebra specifications

Data-flow analysis to identify “dead” variables and reset them to an “undefined” value is an effective technique for fighting state explosion in the enumerative verification of concurrent systems. Although this technique is well-adapted to imperative languages, it is not directly applicable to value-passing process algebras, in which variables cannot be reset explicitly due to the single-assignment constraints of the functional programming style. This paper addresses this problem by performing data-flow analysis on an intermediate model (Petri nets extended with state variables) into which process algebra specifications can be translated automatically. It also addresses important issues such as avoiding the introduction of useless reset operations and handling shared read-only variables that child processes inherit from their parents.