Narrow Results

A number of approaches to asynchronous communication in parallel programs based on both data dependence analysis and buffering techniques are briefly described. A criterion for automatically resolving some classes of deadlocks by means of asynchronous data exchanges is established and examples showing the comparative power of the approaches for deadlock avoidance are presented.

In this paper, we propose a transition system (TS) framework for the analysis and design of logical networks. The formula for calculating the fixed points and cycles of a TS is first provided. Then, the TS representation of Boolean networks (BNs) and Boolean control networks (BCNs) is introduced. The first kind of representation is state-based, which converts a BCN into a TS with either distinguished controls or undistinguished ones. The second representation is output-based, which is also called the simulation of the original BCN. Finally, after introducing the notion of output simulation, our method is applied to design output robust controls of logical networks.

In this paper we present in a tutorial fashion the framework of reaction systems — a formal approach to investigating processes instigated by the living cell. The main idea behind this approach is that this functioning is determined by interactions between biochemical reactions, and these interactions are based on two mechanisms, facilitation and inhibition.