Studies of biological systems are often facilitated by diagram models that summarize the current understanding of underlying mechanisms. The increasing complexity of our understanding of biology necessitates computational models that can extend these representations to include their dynamic behavior. We present here a new tool we call Synthesizing Biological Theories which enables biologists and modelers to construct high-level theories and models of biological systems, capturing biological hypotheses, inferred mechanisms, and experimental results within the same framework. Among the key features of the tool are convenient ways to represent several competing theories and the interactive nature of building and running the models using an intuitive, rigorous scenario-based visual language. The definition of the modeling language is geared towards enabling formal verification and analysis.

No abstract

No abstract

Formalization of a general computer storage allocation process is attempted. With a given computer M is associated a fictitious computer M ′ essentially identical to M except in respect to possession of unbounded primary storage. Mappings of the total storage set (internal and external) of M into the direct address set of M ′ are introduced. A program sequence P for M ′ is termed M -admissible (relative to a specific execution time period) if there is a mapping under which P and its effective data referents are all located in the direct address set of M . Storage allocation is considered as a process of establishing for an arbitrary M ′ program a sequence of mappings, a decoupling of the program into M -admissible subprograms and a linking set of interludes. An existence proof in terms of a completely interpretive M program as indicated. Some special cases are discussed. Various restrictions on generality of M ′ programs are considered under which more practical realization of allocation processes becomes tractable.

No abstract