Performance modelling of a fault-tolerant real-time multiprocessor using stochastic Petri nets

The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault- tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.

On the invariants of coloured Petri Nets

In this paper, we develop a theorem that enables computation of the place invariants of the union of a finite collection of coloured Petri Nets when the individual nets satisfy certain conditions and their invariants are known. We consider the illustrative examples of the Readers-Writers problem, a resource sharing system, and a network of databases and show how this theorem is a valuable tool in the analysis of concurrent systems.

Reflexive Incidence Matrx (RIM) Representation of Petr Nets

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of selfloops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) c which is a combination of two matrices, a "base matrix Cb,,, and a "power matrix CP." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.

Purification, crystallization and partial characterization of the antitumour and insecticidal protein subunit from the delta-endotoxin of Bacillus thuringiensis var. thuringiensis

The antitumour protein from the α-endotoxin of Bacillus thuringiensis var. thuringiensis has been purified, crystallized and partially characterized. The same protein also shows the insecticidal activity. According to amino acid analysis it is an acidic protein with a molecular weight of approx. 13 000.

Purification, crystallization and partial characterization of the antitumour and insecticidal protein subunit from the σ-endotoxin of Bacillus thuringiensis var. thuringiensisstar, open

The antitumour protein from the α-endotoxin of Bacillus thuringiensis var. thuringiensis has been purified, crystallized and partially characterized. The same protein also shows the insecticidal activity. According to amino acid analysis it is an acidic protein with a molecular weight of approx. 13 000.

Graphical simulation of Petri Nets

An interactive graphics package for modeling with Petri Nets has been implemented. It uses the VT-11 graphics terminal supported on the PDP-11/35 computer to draw, execute, analyze, edit and redraw a Petri Net. Each of the above mentioned tasks can be performed by selecting appropriate items from a menu displayed on the screen. Petri Nets with a reasonably large number of nodes can be created and analyzed using this package. The number of nodes supported may be increased by making simple changes in the program. Being interactive, the program seeks information from the user after displaying appropriate messages on the terminal. After completing the Petri Net, it may be executed step by step and the changes in the number of tokens may be observed on the screen, at each place. Some properties of Petri Nets like safety, boundedness, conservation and redundancy can be checked using this package. This package can be used very effectively for modeling asynchronous (concurrent) systems with Petri Nets and simulating the model by “graphical execution.”

Amine-Templated Aluminoborates Exhibiting Graphite and Diamond Nets

A solvothermal reaction of Al2O3, H3BO3, pyridine, and H2O at 180 degrees C/7 days in the presence of organic amine molecules gave rise to four new aluminoborates, [(C6H18N2)(AlB6O13H3)], I; [(C5H16N2) (AlB5O10)]center dot 2H(2)O, II; [(C5H16N2)-(AlB5O10)], III; and [(C5H17N3)(AlB5O10)] center dot H2O, IV, with two- and three-dimensional structures. All the structures have been formed by the connectivity involving Al3+ ions and [B5O10] cyclic pentaborate units. In 1, the 3-connected trigonal nodes form a layer that resembles a graphite structure has been observed. The compounds II, III, and IV, have 4-connected nodes that forms a diamond related three-dimensional structure. The formation of solvatomorphs in II and III is noteworthy and has been observed first time in a family of amine template aluminoborates. A comparison of the various aluminoborate structures reveals subtle relationships between the organic amines (length of the amines) and the final framework structures. The compounds have been characterized using a variety of techniques including IR, second-order optical behavior, and MAS NMR studies.

A new methodology for analyzing distributed systems modeled by petri nets

Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers' problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Small strong epsilon nets

Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn/d+1 points of P. We call a point x a strong centerpoint for a family of objects C if x is an element of P is contained in every object C is an element of C that contains more than a constant fraction of points of P. A strong centerpoint does not exist even for halfspaces in R-2. We prove that a strong centerpoint exists for axis-parallel boxes in Rd and give exact bounds. We then extend this to small strong epsilon-nets in the plane. Let epsilon(S)(i) represent the smallest real number in 0, 1] such that there exists an epsilon(S)(i)-net of size i with respect to S. We prove upper and lower bounds for epsilon(S)(i) where S is the family of axis-parallel rectangles, halfspaces and disks. (C) 2014 Elsevier B.V. All rights reserved.

Interpenetrated and Catenated Zinc Thiosulfates Frameworks with dia and qtz Nets: Synthesis, Structure, and Properties

Reactions between Zn(NO3)(2)center dot 6H(2)O, Na2S2O3, 4,4'-bipyridine (bpy), 1,2-bis(4-pyridyl)ethene (bpe), 1,2-bis (4-pyridyl) ethane (bpa), and 1,3-bis(4-pyridyl)propane (bpp) under solvothermal conditions resulted in four new zinc thiosulfate hybrid compounds. Compound I has four-membered zinc thiosulfate rings connected by the ligand, 1,3-bis(4-pyridyl)propane (bpp) forming a two-dimensional structure. Compounds II-IV have one-dimensional zinc thiosulfate chains connected by the ligands, bpy (II), bpe (III), and bpa (IV) giving rise to three-dimensional structures. All the four-structures exhibit 3-fold interpenetration. Proton conductivity studies indicate reasonable proton mobility at 34 degrees C and at 98% relative humidity. The compounds also exhibit Lewis acid character and good photocatalytic activity for the decomposition of cationic dyes.

Distress call-induced gene expression in the brain of the Indian short-nosed fruit bat, Cynopterus sphinx

Individuals in distress emit audible vocalizations to either warn or inform conspecifics. The Indian short-nosed fruit bat, Cynopterus sphinx, emits distress calls soon after becoming entangled in mist nets, which appear to attract conspecifics. Phase I of these distress calls is longer and louder, and includes a secondary peak, compared to phase II. Activity-dependent expression of egr-1 was examined in free-ranging C. sphinx following the emissions and responses to a distress call. We found that the level of expression of egr-1 was higher in bats that emitted a distress call, in adults that responded, and in pups than in silent bats. Up-regulated cDNA was amplified to identify the target gene (TOE1) of the protein Egr-1. The observed expression pattern Toe1 was similar to that of egr-1. These findings suggest that the neuronal activity related to recognition of a distress call and an auditory feedback mechanism induces the expression of Egr-1. Co-expression of egr-1 with Toe1 may play a role in initial triggering of the genetic mechanism that could be involved in the consolidation or stabilization of distress call memories.

Decision support requirements for intelligent operation of southern grid in India

Control centers (CC) play a very important role in power system operation. An overall view of the system with information about all existing resources and needs is implemented through SCADA (Supervisory control and data acquisition system) and an EMS (energy management system). As advanced technologies have made their way into the utility environment, the operators are flooded with huge amount of data. The last decade has seen extensive applications of AI techniques, knowledge-based systems, Artificial Neural Networks in this area. This paper focuses on the need for development of an intelligent decision support system to assist the operator in making proper decisions. The requirements for realization of such a system are recognized for the effective operation and energy management of the southern grid in India The application of Petri nets leading to decision support system has been illustrated considering 24 bus system that is a part of southern grid.

Invariant-preserving Petri net reduction and conditions for invariant-existence

The use of invariants is an important tool for analysis of distributed and concurrent systems modeled by Petri nets. For a large practical system, the computation of desired invariants by the existing techniques is a time-consuming task. This paper proposes a theoretical foundation for simplified computation of desired invariants. We provide invariant-preserving Petri net reduction rules followed by the conditions for the existence of invariants in various well-structured nets. If an invariant exists, it can be found directly from the net structure using the formulas derived, or by applying the existing techniques on the reduced net.