Advanced Design Concepts for Open Distributed Systems Development

Experience with the engineering of large scale open distributed systems has shown that their design should be specified at several well-defined levels of abstraction, in which each level aims at satisfying specific user, architectural, and implementation needs. Therefore, designers should dispose of a comprehensive design methodology, which allows them to conceive a specification at a certain abstraction level and transform this specification into a conforming specification at a lower abstraction level. The collection of these transformations should abridge the total design trajectory from initial user requirements to final implementation. The authors present and discuss some advanced design concepts that provide a basis for such a design methodolog

What makes industries believe in formal methods

The introduction of formal methods in the design and development departments of an industrial company has far reaching and long lasting consequences. In fact it changes the whole environment of methods, tools and skills that determine the design culture of that company. A decision to replace current design practice by formal methods, therefore, appears a vital one and is not lightly taken. The past has shown that efforts to introduce formal methods in industry has faced a lot of controversy and opposition at various hierarchical levels in companies, resulting in a marginal spread of such methods. This paper revisits the requirements for formal description techniques and identifies some critical success and inhibiting factors associated with the introduction of formal methods in the industrial practice. One of the inhibiting factors is the often encountered lack of appropriateness of the formal model to express and manipulate the design concerns that determine the world of the engineer. This factor motivated our research in the area of architectural and implementation design concepts. The last two sections of this paper report on some results of this research

Advances in architectural concepts to support distributed systems design

This paper presents and discusses some architectural concepts for distributed systems design. These concepts are derived from an analysis of limitations of some currently available standard design languages. We conclude that language design should be based upon the careful consideration of architectural concepts. This paper aims at supporting designers by presenting a methodological design framework in which they can reason about the design and implementation of distributed systems. The paper is also meant for language developers and formalists by presenting a collection of architectural concepts which deserve consideration for formal support

Transparent Dynamic reconfiguration for CORBA

Distributed systems with high availability requirements have to support some form of dynamic reconfiguration. This means that they must provide the ability to be maintained or upgraded without being taken off-line. Building a distributed system that allows dynamic reconfiguration is very intrusive to the overall design of the system, and generally requires special skills from both the client and server side application developers. There is an opportunity to provide support for dynamic reconfiguration at the object middleware level of distributed systems, and create a dynamic reconfiguration transparency to application developers. We propose a Dynamic Reconfiguration Service for CORBA that allows the reconfiguration of a running system with maximum transparency for both client and server side developers. We describe the architecture, a prototype implementation, and some preliminary test result

Pay32p of the Yeast Yarrowia lipolytica Is an Intraperoxisomal Component of the Matrix Protein Translocation Machinery

Pay mutants of the yeast Yarrowia lipolytica fail to assemble functional peroxisomes. One mutant strain, pay32-1, has abnormally small peroxisomes that are often found in clusters surrounded by membranous material. The functionally complementing gene PAY32 encodes a protein, Pay32p, of 598 amino acids (66,733 D) that is a member of the tetratricopeptide repeat family. Pay32p is intraperoxisomal. In wild-type peroxisomes, Pay32p is associated primarily with the inner surface of the peroxisomal membrane, but ~30% of Pay32p is localized to the peroxisomal matrix. The majority of Pay32p in the matrix is complexed with two polypeptides of 62 and 64 kD recognized by antibodies to SKL (peroxisomal targeting signal-1). In contrast, in peroxisomes of the pay32-1 mutant, Pay32p is localized exclusively to the matrix and forms no complex. Biochemical characterization of the mutants pay32-1 and pay32-KO (a PAY32 gene disruption strain) showed that Pay32p is a component of the peroxisomal translocation machinery. Mutations in the PAY32 gene prevent the translocation of most peroxisome-bound proteins into the peroxisomal matrix. These proteins, including the 62-kD anti-SKL-reactive polypeptide, are trapped in the peroxisomal membrane at an intermediate stage of translocation in pay32 mutants. Our results suggest that there are at least two distinct translocation machineries involved in the import of proteins into peroxisomes.

Positive representations of finite groups in Riesz spaces

In this paper, which is part of a study of positive representations of locally compact groups in Banach lattices, we initiate the theory of positive representations of finite groups in Riesz spaces. If such a representation has only the zero subspace and possibly the space itself as invariant principal bands, then the space is Archimedean and finite dimensional. Various notions of irreducibility of a positive representation are introduced and, for a finite group acting positively in a space with sufficiently many projections, these are shown to be equal. We describe the finite dimensional positive Archimedean representations of a finite group and establish that, up to order equivalence, these are order direct sums, with unique multiplicities, of the order indecomposable positive representations naturally associated with transitive $G$-spaces. Character theory is shown to break down for positive representations. Induction and systems of imprimitivity are introduced in an ordered context, where the multiplicity formulation of Frobenius reciprocity turns out not to hold.Comment: 23 pages. To appear in International Journal of Mathematic

A design model for Open Distributed Processing systems

This paper proposes design concepts that allow the conception, understanding and development of complex technical structures for open distributed systems. The proposed concepts are related to, and partially motivated by, the present work on Open Distributed Processing (ODP). As opposed to the current ODP approach, the concepts are aimed at supporting a design trajectory with several, related abstraction levels. Simple examples are used to illustrate the proposed concepts

Reliability Centered Maintenance: A Case Study of Railway Transit Maintenance to Achieve Optimal Performance, MTI Report 10-06

The purpose of this qualitative case study was to identify the types of obstacles and patterns experienced by a single heavy rail transit agency located in North America that embedded a Reliability Centered Maintenance (RCM) Process. The outcome of the RCM process also examined the impact of RCM on availability, reliability, and safety of rolling stock. This qualitative study interviewed managers (10 cases), and non-managers (10 cases) at the transit agency obtain data. The data may serve to help rail transit leaders determine future strategic directions that would improve this industry. Despite the RCM record in other fields, it has infrequently been used in heavy rail transit agencies. The research method for the first portion of this qualitative case study was to collect data from subjects by administering an open-ended, in-depth personal interview, of manager and non-managers. The second portion of the study explored how the RCM process affected rolling stock for availability, reliability, and safety. The second portion of the study used data derived from project documents and reports (such as progress reports, email, and other forms of documentation) to answer questions about the phenomena. The exploration and identification of the patterns and obstacles is important because organizational leaders in other heavy rail transit systems may use this knowledge to assist in embedding the process more smoothly, efficiently, and effectively to obtain the desired end results

A Metric for Linear Temporal Logic

We propose a measure and a metric on the sets of infinite traces generated by a set of atomic propositions. To compute these quantities, we first map properties to subsets of the real numbers and then take the Lebesgue measure of the resulting sets. We analyze how this measure is computed for Linear Temporal Logic (LTL) formulas. An implementation for computing the measure of bounded LTL properties is provided and explained. This implementation leverages SAT model counting and effects independence checks on subexpressions to compute the measure and metric compositionally