Cell module and fuel conditioner development

The efforts performed to develop a phosphoric acid fuel cell (PAFC) stack design having a 10 kW power rating for operation at higher than atmospheric pressure based on the existing Mark II design configuration are described. The work involves: (1) Performance of pertinent functional analysis, trade studies and thermodynamic cycle analysis for requirements definition and system operating parameter selection purposes, (2) characterization of fuel cell materials and components, and performance testing and evaluation of the repeating electrode components, (3) establishment of the state-of-the-art manufacturing technology for all fuel cell components at Westinghouse and the fabrication of short stacks of various sites, and (4) development of a 10 kW PAFC stack design for higher pressure operation utilizing the top down systems engineering approach

Gas cooled fuel cell systems technology development

The work performed during the Second Logical Unit of Work of a multi-year program designed to develop a phosphoric acid fuel cell (PAFC) for electric utility power plant application is discussed. The Second Logical Unit of Work, which covers the period May 14, 1983 through May 13, 1984, was funded by the U.S. Department of Energy, Office of Fossil Energy, Morgantown Energy Technology Center, and managed by the NASA Lewis Research Center

Gas cooled fuel cell systems technology development

The first phase of a planned multiphase program to develop a Phosphoric is addressed. This report describes the efforts performed that culminated in the: (1) Establishment of the preliminary design requirements and system conceptual design for the nominally rated 375 kW PAFC module and is interfacing power plant systems; (2) Establishment of PAFC component and stack performance, endurance, and design parameter data needed for design verification for power plant application; (3) Improvement of the existing PAFC materials data base and establishment of materials specifications and process procedes for the cell components; and (4) Testing of 122 subscale cell atmospheric test for 110,000 cumulative test hours, 12 subscale cell pressurized tests for 15,000 cumulative test hours, and 12 pressurized stack test for 10,000 cumulative test hours

Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation

The actor model eases the definition of concurrent programs with non uniform behaviors. Static analysis of such a model was previously done in a data-flow oriented way, with type systems. This approach was based on constraint set resolution and was not able to deal with precise properties for communications of behaviors. We present here a new approach, control-flow oriented, based on the abstract interpretation framework, able to deal with communication of behaviors. Within our new analyses, we are able to verify most of the previous properties we observed as well as new ones, principally based on occurrence counting

Nowoczesne rozwiązania telefonicznych central abonenckich. Przegląd Zagadnień Łączności, 1963, nr 6 (21)

Opracowania na podstawie artykułó

Automatic Verification of Erlang-Style Concurrency

This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for Lambda-Actor and use it to build a polytime computable, flow-based, abstract semantics of Lambda-Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program. We have constructed Soter, a tool implementation of the verification method, thereby obtaining the first fully-automatic, infinite-state model checker for a core fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties. Though the ACS coverability problem is Expspace-complete, Soter can analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at http://mjolnir.cs.ox.ac.uk/soter

KaDE: A Tool to Compile Kappa Rules into (Reduced) ODE Models

Tools paper trackInternational audienceKappa is a formal language that can be used to model sys- tems of biochemical interactions among proteins. It offers several se- mantics to describe the behaviour of Kappa models at different levels of abstraction. Each Kappa model is a set of context-free rewrite rules. One way to understand the semantics of a Kappa model is to read its rules as an implicit description of a (potentially infinite) reaction net- work. KaDE is interpreting this definition to compile Kappa models into reaction networks (or equivalently into sets of ordinary differential equations). KaDE uses a static analysis that identifies pairs of sites that are indistinguishable from the rules point of view, to infer backward and forward bisimulations, hence reducing the size of the underlying reaction networks without having to generate them explicitly. In this paper, we describe the main current functionalities of KaDE and we give some benchmarks on case studies

Coarse-grained brownian dynamics simulation of rule-based models

International audienceStudying spatial effects in signal transduction, such as co-localization along scaffold molecules, comes at a cost of complexity. In this paper, we propose a coarse-grained, particle-based spatial simulator, suited for large signal transduction models. Our approach is to combine the particle-based reaction and diffusion method, and (non-spatial) rule-based modeling: the location of each molecular complex is abstracted by a spheric particle, while its internal structure in terms of a site-graph is maintained explicit. The particles diffuse inside the cellular compartment and the colliding complexes stochastically interact according to a rule-based scheme. Since rules operate over molecular motifs (instead of full complexes), the rule set compactly describes a combinatorial or even infinite number of reactions. The method is tested on a model of Mitogen Activated Protein Kinase (MAPK) cascade of yeast pheromone response signaling. Results demonstrate that the molecules of the MAPK cascade co-localize along scaffold molecules, while the scaffold binds to a plasma membrane bound upstream component, localizing the whole signaling complex to the plasma membrane. Especially we show, how rings stabilize the resulting molecular complexes and derive the effective dissociation rate constant for it

Syntactic Markovian Bisimulation for Chemical Reaction Networks

In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of probabilistic bisimulation, defined over the structure of a CRN rather than over its underlying CTMC. SMB identifies a lumpable partition of the CTMC state space a priori, in the sense that it is an equivalence relation over species implying that two CTMC states are lumpable when they are invariant with respect to the total population of species within the same equivalence class. We develop an efficient partition-refinement algorithm which computes the largest SMB of a CRN in polynomial time in the number of species and reactions. We also provide an algorithm for obtaining a quotient network from an SMB that induces the lumped CTMC directly, thus avoiding the generation of the state space of the original CRN altogether. In practice, we show that SMB allows significant reductions in a number of models from the literature. Finally, we study SMB with respect to the deterministic semantics of CRNs based on ordinary differential equations (ODEs), where each equation gives the time-course evolution of the concentration of a species. SMB implies forward CRN bisimulation, a recently developed behavioral notion of equivalence for the ODE semantics, in an analogous sense: it yields a smaller ODE system that keeps track of the sums of the solutions for equivalent species.Comment: Extended version (with proofs), of the corresponding paper published at KimFest 2017 (http://kimfest.cs.aau.dk/

Toward a comprehensive language for biological systems

Rule-based modeling has become a powerful approach for modeling intracellular networks, which are characterized by rich molecular diversity. Truly comprehensive models of cell behavior, however, must address spatial complexity at both the intracellular level and at the level of interacting populations of cells, and will require richer modeling languages and tools. A recent paper in BMC Systems Biology represents a signifcant step toward the development of a unified modeling language and software platform for the development of multi-level, multiscale biological models