WS-BPEL Extensions for Versioning

This article proposes specific extensions for WS-BPEL (Business Process Execution Language) to support versioning of processes and partner links. It introduces new activities and extends existing activities, including partner links, invoke, receive, import, and onmessage activities. It proposes version-related extensions to variables and introduces version handlers. The proposed extensions represent a complete solution for process-level and scope-level versioning at development, deployment, and run-time. It also provides means to version applications that consist of several BPEL processes, and to put temporal constraints on versions. The proposed approach has been tested in real-world environment. It solves major challenges in BPEL versioning.     

Computing the behaviour of asynchronous processes

We describe a variation of Brock-Ackerman's (1981) model of nondeterministic asynchronous process, and devise a computational method for characterizing asynchronous processes defined by networks. This method is shown to be equivalent to a method of combining traces related to that of Brock and Ackerman. Recursively defined networks are also considered.     

A transformation system for concurrent processes

Program transformation techniques have been extensively studied in the framework of functional and logic languages, where they were applied mainly to obtain more efficient and readable programs. All these works are based on the Unfold/Fold program transformation method developed by Burstall and Darlington in the context of their recursive equational language. The use of Unfold/Fold based transformations for concurrent languages is a relevant issue that has not yet received an adequate attention. In this paper we define a transformation methodology for CCS. We give a set of general rules which are a specialization of classical program transformation rules, such as Fold and Unfold. Moreover, we define the general form of other rules, “oriented” to the goal of a transformation strategy, and we give conditions for the correctness of these rules. We prove that a strategy using the general rules and a set of goal oriented rules is sound, i.e. it transforms CCS programs into equivalent ones. We show an example of application of our method. We define a strategy to transform, if possible, a full CCS program into an equivalent program whose semantics is a finite transition system. We show that, by means of our methodology, we are able to a find finite representations for a class of CCS programs which is larger than the ones handled by the other existing methods. Our transformational approach can be seen as unifying in a common framework a set of different techniques of program analysis. A further advantage of our approach is that it is based only on syntactic transformations, thus it does not requires any semantic information. Received: 24 April 1997 / 19 November 1997     

A proof system for distributed processes

Summary A partial correctness proof system for Brinch Hansen's Distributed Processes (DP) is presented. Two important aspects of the system are: Proofs of individual processes of a DP program are completely isolated from each other; in particular, no assumptions are allowed in the proof of one process about the behavior of the other processes. Secondly a process is characterized by its externally visible behavior, i.e. the sequence of interactions between this process and the other processes of the program. An example demonstrates the use of the system.This paper is an extended version of a paper presented at the Workshop on Logics of Programs, Brooklyn, New York, June 17–19, 1985 and was supported in part by the National Science Foundation under grant ECS-8404725     

A proof system for distributed processes

Summary A partial correctness proof system for Brinch Hansen’s Distributed Processes (DP) is presented. Two important aspects of the system are: Proofs of individual processes of a DP program are completely isolated from each other; in particular, no assumptions are allowed in the proof of one process about the behavior of the other processes. Secondly a process is characterized by its externally visible behavior, i.e. the sequence of interactions between this process and the other processes of the program. An example demonstrates the use of the system. This paper is an extended version of a paper presented at the Workshop on Logics of Programs, Brooklyn, New York, June 17–19, 1985 and was supported in part by the National Science Foundation under grant ECS-8404725.     

On the stability of asynchronous iterative processes

We consider an iterative process in which one out of a finite set of possible operators is applied at each iteration. We obtain necessary and sufficient conditions for convergence to a common fixed point of these operators, when the order at which different operators are applied is left completely free, except for the requirement that each operator is applied infinitely many times. The theory developed is similar in spirit to Lyapunov stability theory. We also derive some very different, qualitatively, results for partially asynchronous iterative processes, that is, for the case where certain constraints are imposed on the order at which the different operators are applied.Research supported by an IBM Faculty Development Award and the Army Research Office under Contract DAAAG-29-84-K-0005.     

Safe termination detection in an asynchronous distributed system when processes may crash and recover

The termination detection problem involves detecting whether an ongoing distributed computation has ceased all its activities. We investigate the termination detection problem in an asynchronous distributed system under the crash-recovery model. It has been shown that the problem is impossible to solve under the crash-recovery model in general. We identify two conditions under which the termination detection problem can be solved in a safe manner. We also propose algorithms to detect termination under the conditions identified.     

一种异步电动机故障诊断新方法

针对基于RBF神经网络的异步电动机故障诊断方法存在参数确定较困难的问题,提出了一种基于差分进化算法优化RBF神经网络的异步电动机故障诊断方法。首先采用小波变换对异步电动机运行状态信号进行消噪处理,然后采用主元分析法与小波包分析法相结合方式提取消噪后的异步电动机运行状态信号特征,最后采用差分进化算法优化后的RBF神经网络对异步电动机运行状态信号特征进行诊断。实验结果表明,与未优化的RBF神经网络相比,采用差分进化算法优化后的RBF神经网络可有效识别出异步电动机故障。     

一种异步电动机故障诊断新方法

针对基于RBF神经网络的异步电动机故障诊断方法存在参数确定较困难的问题,提出了一种基于差分进化算法优化RBF神经网络的异步电动机故障诊断方法。首先采用小波变换对异步电动机运行状态信号进行消噪处理,然后采用主元分析法与小波包分析法相结合方式提取消噪后的异步电动机运行状态信号特征,最后采用差分进化算法优化后的RBF神经网络对异步电动机运行状态信号特征进行诊断。实验结果表明,与未优化的RBF神经网络相比,采用差分进化算法优化后的RBF神经网络可有效识别出异步电动机故障。     

多传感器异步线性测量系统的数据融合

由于采样速率和传送数据到融合中心的通信延迟的不同,现代工业生产过程中用于对未知的常值或缓变参数进行估计的多传感器通常是异步工作的,且受到加性测量噪声的干扰。在最小二乘估计意义下,对于测量噪声互不相关的多传感器异步线性测量系统,提出了集中式和分布式递推参数估计数据融合算法,两种算法完全等价,且都是全局最优的。数值仿真实验的结果表明,通过利用多传感器的测量数据,增大了对参数测量的数据流和数据率,传感器测量参数的估计准确度得到明显改善。     

Automatic dynamic generation of likely invariants for WS-BPEL compositions

The wide adoption of Web Services has led to the development of languages to compose them, like the WS-BPEL standard. In order to check whether the composition works as expected, one common approach is to analyze it and infer functional properties describing its behavior. Traditional approaches for inferring properties in WS-BPEL have been static: compositions are transformed into specialized analysis models based on some formalization. However, this formalization could be inexact due to theoretical limitations or differing interpretations of the standard by implementers. Dynamic invariant generation solves these problems by extracting the properties from actual executions and has been successfully used in popular languages, but not to WS-BPEL yet. In this work, we apply dynamic invariant generation to WS-BPEL, providing innovative solutions for several features that require special consideration, like highly multidimensional values in variables, an advanced type system or unstructured code. We have implemented these solutions in Takuan and evaluated its performance with several compositions of varying complexity. We present the results obtained and a comparative analysis of the efficiency and effectiveness of our solutions. Results show that the solutions are successful in reducing the cost of applying dynamic invariant generation and the number of uninteresting invariants generated.     

An integrated framework for the performance analysis of asynchronous communicating stochastic processes

In this paper we present a design framework containing a process algebra and the concurrent functional programming language Eden. In order to study properties of a specification written in our process algebraic notation, we provide a translation mechanism to generate Eden programs. Once we have a translation, we may use the Eden tools to study the performance of the (simulation of the) system. In order to add expressiveness to our design language we use a very powerful process algebra. First, we allow the specification of delays induced by general random variables. We also consider value passing. Finally, the communication between concurrent processes is asynchronous. The usefulness of our framework is presented by two examples featuring all the characteristics of our process algebraic model, we give the corresponding translations, and we provide some performance measures obtained by using Eden tools.Research supported in part by the Ministerio de Ciencia y Tecnologí a projects MASTER (TIC2003-07848-C02-01) and AMEVA (TIC2000-0701-C02-01) and by the Junta de Comunidades de Castilla-La Mancha project PAC-03-001.Accepted in revised form 15 September 2003 by M. Broy, G. Lüttgen and M. Mendler     

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.     

A type system for logic programs

A theory for a type system for logic programs is developed which addressesthe question of well-typing, type inference, and compile-time and run-time type checking. A type is a recursively enumerable set of ground atoms, which is tuple-distributive. The association of a type to a program is intended to mean that only ground atoms that are elements of the type may be derived from the program. A declarative definition of well-typed programs is formulated, based on an intuitive approach related to the fixpoint semantics of logic programs. Whether a program is well typed is undecidable in general. We define a restricted class of types, called regular types, for which type checking is decidable. Regular unary logic programs are proposed as a specification language for regular types. An algorithm for type-checking a logic program with respect to a regular type definition is described, and its complexity is analyzed. Finally, the practicality of the type system is discussed, and some examples are shown. The type system has been implemented in FCP for FCP and is incorporated in the Logix system.     

A polymorphic type system for prolog

We describe a polymorphic type scheme for Prolog which makes static type checking possible. Polymorphism gives a good degree of flexibility to the type system, and makes it intrude very little on a user's programming style. The only additions to the language are type declarations, which an interpreter can ignore if it so desires, with the guarantee that a well-typed program will behave identically with or without type checking. Our implementation is discussed and we observe that the type resolution problem for a Prolog program is another Prolog (meta)program.     

Markov decision processes with delays and asynchronous cost collection

Markov decision processes (MDPs) may involve three types of delays. First, state information, rather than being available instantaneously, may arrive with a delay (observation delay). Second, an action may take effect at a later decision stage rather than immediately (action delay). Third, the cost induced by an action may be collected after a number of stages (cost delay). We de rive two results, one for constant and one for random delays, for reducing an MDP with delays to an MDP without delays, which differs only in the size of the state space. The results are based on the intuition that costs may be collected asynchronously, i.e., at a stage other than the one in which they are induced, as long as they are discounted properly.